Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2011.03057 · Quantum Science and Technology

TEQUILA: a platform for rapid development of quantum algorithms

Jakob S. Kottmann, Sumner Alperin-Lea, Teresa Tamayo-Mendoza, Alba Cervera-Lierta, Cyrille Lavigne, Tzu-Ching Yen, Vladyslav Verteletskyi, Philipp Schleich, Abhinav Anand, Matthias Degroote, Skylar Chaney, Maha Kesibi, Naomi Grace Curnow, Brandon Solo, Georgios Tsilimigkounakis, Claudia Zendejas-Morales, Artur F. Izmaylov, Alán Aspuru‐Guzik

Published Feb 13, 2021• 88 citations
arXivHTMLPDF

Abstract

Abstract Variational quantum algorithms are currently the most promising class of algorithms for deployment on near-term quantum computers. In contrast to classical algorithms, there are almost no standardized methods in quantum algorithmic development yet, and the field continues to evolve rapidly. As in classical computing, heuristics play a crucial role in the development of new quantum algorithms, resulting in a high demand for flexible and reliable ways to implement, test, and share new ideas. Inspired by this demand, we introduce tequila, a development package for quantum algorithms in python, designed for fast and flexible implementation, prototyping and deployment of novel quantum algorithms in electronic structure and other fields. tequila operates with abstract expectation values which can be combined, transformed, differentiated, and optimized. On evaluation, the abstract data structures are compiled to run on state of the art quantum simulators or interfaces.

DOI
10.1088/2058-9565/abe567

Related papers

Automatic differentiation in quantum chemistry

Tamayo Mendoza, Teresa

Automatic differentiation (AD) is a well-established tool that allows us to compute exact derivatives of implemented functions with respect to all their parameters. It does so without requiring any extra coding or knowledge of the analytical derivatives. Derivatives of quantum chemistry algorithms are generally very hard to obtain and often cumbersome to implement. AD shows great potential to solve this problem and to facilitate the implementation of gradients in the context of electronic structure methods. In this dissertation, we have applied AD in a broader context and demonstrate that AD tools can compute arbitrary gradients of quantum chemistry methods with respect to any input parameter and any intermediate function. To this end, we have developed the open-source code DiffiQult, a fully differentiable Hartree-Fock (HF) software package. DiffiQult is a python package that uses AD tools using the external libraries JAX and Algopy. As a proof of concept, DiffiQult is an example of an end-to-end differentiable software package of a quantum chemistry algorithm based solely on AD tools. This application has helped us understand the challenges of AD in quantum chemistry. We outline the details, benefits, and caveats of AD for the HF algorithm in this work. We have chosen HF as a starting point since it contains all the functions included in correlated electronic structure methods. In this way, it opens the door for the development of AD for more accurate algorithms. As an application, we describe DiffiQult within the framework of the fully variational HF method, where we use a gradient-based optimization method to compute system-specific basis functions. As a result, the wavefunction can capture more molecular features, and we obtain a set of basis functions for correlated methods in quantum and classical algorithms. This proves that these functions improve variationally energy while keeping a compact representation in correlated methods by interfacing with the quantum chemistry library PySCF, and with Tequila, a platform for rapid development of quantum algorithms. First, we present optimization results of minimal basis sets with respect to all parameters of the molecules H2O, CH4, NH3, HF. Later we include optimization of the potential energy surface of two isomerization mechanisms of diazene and hydrogens chains. Here, we use a minimal optimized basis set to compute FCI when possible with PySCF and VQE energies of hydrogen chains with Tequila. We obtain similar results compared to a bigger basis set with considerably fewer configurations. Also, we show how this approach improves the estimation of the thermodynamic limit in the hydrogen chain at the HF level. Finally, we apply this approach to the optimization of all atomic orbitals of benzene and compute electronic correlations restricting the active space to the 6 π orbitals of benzene using the UpCCGSD ansatz implemented in Tequila.

•Jan 1, 2021•0 citations

A framework for algorithm deployment on cloud-based quantum computers

Sukin Sim, Yudong Cao, Jonathan Romero +2 more

In recent years, the field of quantum computing has significantly developed in both the improvement of hardware as well as the assembly of various software tools and platforms, including cloud access to quantum devices. Unfortunately, many of these resources are rapidly changing and thus lack accessibility and stability for robust algorithm prototyping and deployment. Effectively leveraging the array of hardware and software resources at a higher level, that can adapt to the rapid development of software and hardware, will allow for further advancement and democratization of quantum technologies to achieve useful computational tasks. As a way to approach this challenge, we present a flexible, high-level framework called algo2qpu that is well-suited for designing and testing instances of algorithms for near-term quantum computers on the cloud. Algorithms that employ adaptive protocols for optimizations of algorithm parameters can be grouped under the umbrella of "adaptive hybrid quantum-classical" (AHQC) algorithms. We demonstrate the utility of algo2qpu for near-term algorithm development by applying the framework to implement proof-of-principle instances of two AHQC algorithms that have applications in quantum chemistry and/or quantum machine learning, namely the quantum autoencoder and the variational quantum classifier, using Rigetti Computing's Forest platform.

arXiv:1810.10576•Oct 24, 2018•16 citations

DEVELOPMENT OF ALGORITHMS AND SIMULATIONS FOR QUANTUM COMPUTERS AND THEIR POTENTIAL APPLICATIONS IN SOLVING QUANTUM PROBLEMS

K. Sabeeh, Gul Rahman

Quantum computing has emerged as a transformative paradigm capable of solving complex computational problems that are intractable for classical computers. Central to the advancement of this technology is the development of efficient quantum algorithms and high fidelity simulations that enable the design, testing, and optimization of quantum solutions before deployment on physical hardware. This study focuses on the design and implementation of quantum algorithms tailored for solving a variety of quantum problems, including quantum chemistry, optimization, and cryptography. Using state of the art simulation platforms such as Qiskit, Cirq, and Pennylane, algorithm performance was evaluated in terms of accuracy, execution time, scalability, and resilience to noise. Benchmarks demonstrate that algorithms such as the Variational Quantum Eigensolver (VQE) and Quantum Approximate Optimization Algorithm (QAOA) achieve significant speedups in problem specific domains, while hybrid quantum–classical methods provide robust pathways for near term quantum advantage. Simulation results reveal that algorithmic efficiency can be significantly improved through optimized circuit depth, qubit connectivity mapping, and advanced error mitigation techniques. The findings highlight the potential of simulation driven quantum algorithm development in accelerating the practical realization of quantum computing applications across disciplines such as materials discovery, molecular modeling, secure communications, and complex optimization tasks.

•Dec 1, 2025•0 citations

Unitaria: Quantum Linear Algebra via Block Encodings

Matthias Deiml, Oliver Hüttenhofer, Ram Mosco +2 more

We introduce Unitaria, a Python library that brings the simplicity of classical linear algebra toolkits such as NumPy and SciPy to the implementation of quantum algorithms based on block encodings, a general-purpose abstraction in which a matrix is embedded as a sub-block of a larger unitary operator. Their implementation has so far required deep knowledge of low-level circuit construction, which Unitaria aims to eliminate. The library provides a composable, array-like interface through which users can define block encodings of matrices and vectors, combine them through standard operations such as addition, multiplication, tensor products, and the Quantum Singular Value Transformation, and extract the resulting quantum circuits automatically. A key feature is a matrix-arithmetic evaluation path in which every operation can be computed directly on encoded vectors and matrices without dependence on ancilla qubits or circuit simulation. This enables correctness verification and classical simulation that scale well beyond what state vector simulation permits and also allows resource estimation, including gate counts, qubit counts, and normalization constants, without executing any circuit. Together, these capabilities allow researchers to develop, verify, and analyze quantum linear algebra algorithms today, ahead of the availability of error-corrected hardware. Unitaria is open source and available at https://github.com/tequilahub/unitaria.

quant-pharXiv:2605.10768•May 12, 2026•1 citation

qlbm – A quantum lattice Boltzmann software framework

Georgescu Calin, Merel A. Schalkers, Matthias Möller

We present qlbm , a Python software package designed to facilitate the development, simulation, and analysis of Quantum Lattice Boltzmann Methods (QBMs). qlbm is a modular framework that introduces a quantum component abstraction hierarchy tailored to the implementation of novel QBMs. The framework interfaces with state-of-the-art quantum software infrastructure to enable efficient simulation and validation pipelines, and leverages novel execution and pre-processing techniques that significantly reduce the computational resources required to develop quantum circuits. We demonstrate the versatility of the software by showcasing multiple QBMs in 2D and 3D with complex boundary conditions, integrated within automated benchmarking utilities. Accompanying the source code are extensive test suites, thorough online documentation resources, analysis tools, visualization methods, and demos that aim to increase the accessibility of QBMs while encouraging reproducibility and collaboration. Program summary Program Title: qlbm CPC Library link to program files: https://doi.org/10.17632/28hkvsg7p2.1 Developer's repository link: https://github.com/QCFD-Lab/qlbm Licensing provisions: MPL-2.0 Programming language: Python3 Supplementary material: The documentation of is available at https://qcfd-lab.github.io/qlbm/ . Nature of problem: The advent of quantum algorithms for computational fluid dynamics brings with it challenges that are new to the established field of computational physics. These challenges include the lack of standardized implementations of the still nascent quantum methods, the intense computational demands of developing and simulating quantum algorithms on hardware available today, and the absence of tools that integrate novel developments into established infrastructure. Because of these current limitations, physicists and mathematicians expend superfluous resources on tasks that more mature computational physics branches have surmounted long ago. Solution method: QLBM is a software package that provides an end-to-end development environment for quantum lattice Boltzmann methods. The modular design and flexible quantum circuit library provide a base for extending and generalizing quantum algorithms. Performance enhancements exploit the paradigm of quantum computing simulations to accelerate the speed at which researchers can verify the validity of their methods. Its integration with state-of-the-art quantum computing software and visualization tools increases the algorithms' accesibility. These features allow QLBM to effectively generate, simulate, and analyze quantum circuits for 2D and 3D computational fluid dynamics problems.

arXiv:2411.19439•Computer Physics Communications•Jun 5, 2025•9 citations

Algorithm development for near-term quantum computers

Sim, Sukin

Fault-tolerant quantum computers, when realized, guarantee significant speedups for particular computational tasks. Quantum hardware in the near term, however, is limited to low hundreds of noisy qubits that are not error-corrected. To leverage such devices as well as accommodate rapid developments in both hardware and algorithms, variational quantum algorithms (VQAs) were introduced. These algorithms have the potential to be useful in areas such as chemistry, optimization, machine learning, among others. Despite this potential, the largest experiment to date has employed just twelve qubits to implement the Variational Quantum Eigensolver (VQE), a VQA for simulating ground state energies of fermionic systems. In this dissertation, we present several methods for extending and further developing VQAs to step closer towards realizing applications in which quantum computers can provide meaningful advantages over classical computers. In the first part, we present methods for analyzing and optimizing parameterized quantum circuits (PQCs), a core component in VQAs for approximating target quantum states, e.g. ground state wavefunctions in VQE. To compare among PQCs and guide their design and selection, we introduce a set of algorithm-independent descriptors that can be estimated from simulations. Using these descriptors, we rule out circuits with limited capabilities in expressive and entangling powers. Next, we present a strategy for optimizing PQCs with large parameter counts and high redundancy by removing circuit operations that are less important for optimizing the algorithm objective, effectively reducing the search space. We demonstrate that this method enables larger VQE simulations by converging previously difficult optimizations while additionally reducing circuit resources. In the second part, we present methods for developing VQAs that are related to the quantum hardware. We introduce a new algorithm for simulating components of a quantum processor using an existing quantum computer. The goal of this application is to leverage near-term devices and algorithms to aid in the design of more powerful next-generation quantum hardware. Lastly, we present a guide for algorithm prototyping by deploying instances of VQAs on quantum computers via the cloud. We demonstrate instances of two algorithms, the quantum autoencoder and classifier, on an eight-qubit device. While further advancements in hardware and algorithms lie ahead, our work, along with developments from previous studies, represents significant progress towards realizing practical quantum advantage.

•Jan 1, 2021•0 citations
Abstract Variational quantum algorithms are currently the most promising class of algorithms for deployment on near-term quantum computers. In contrast to classical algorithms, there are almost no standardized methods in quantum algorithmic development yet, and the field continues to evolve rapidly. As in classical computing, heuristics play a crucial role in the development of new quantum algorithms, resulting in a high demand for flexible and reliable ways to implement, test, and share new ideas. Inspired by this demand, we introduce tequila, a development package for quantum algorithms in python, designed for fast and flexible implementation, prototyping and deployment of novel quantum algorithms in electronic structure and other fields. tequila operates with abstract expectation values which can be combined, transformed, differentiated, and optimized. On evaluation, the abstract data structures are compiled to run on state of the art quantum simulators or interfaces.
Automatic differentiation (AD) is a well-established tool that allows us to compute exact derivatives of implemented functions with respect to all their parameters. It does so without requiring any extra coding or knowledge of the analytical derivatives. Derivatives of quantum chemistry algorithms are generally very hard to obtain and often cumbersome to implement. AD shows great potential to solve this problem and to facilitate the implementation of gradients in the context of electronic structure methods. In this dissertation, we have applied AD in a broader context and demonstrate that AD tools can compute arbitrary gradients of quantum chemistry methods with respect to any input parameter and any intermediate function. To this end, we have developed the open-source code DiffiQult, a fully differentiable Hartree-Fock (HF) software package. DiffiQult is a python package that uses AD tools using the external libraries JAX and Algopy. As a proof of concept, DiffiQult is an example of an end-to-end differentiable software package of a quantum chemistry algorithm based solely on AD tools. This application has helped us understand the challenges of AD in quantum chemistry. We outline the details, benefits, and caveats of AD for the HF algorithm in this work. We have chosen HF as a starting point since it contains all the functions included in correlated electronic structure methods. In this way, it opens the door for the development of AD for more accurate algorithms. As an application, we describe DiffiQult within the framework of the fully variational HF method, where we use a gradient-based optimization method to compute system-specific basis functions. As a result, the wavefunction can capture more molecular features, and we obtain a set of basis functions for correlated methods in quantum and classical algorithms. This proves that these functions improve variationally energy while keeping a compact representation in correlated methods by interfacing with the quantum chemistry library PySCF, and with Tequila, a platform for rapid development of quantum algorithms. First, we present optimization results of minimal basis sets with respect to all parameters of the molecules H2O, CH4, NH3, HF. Later we include optimization of the potential energy surface of two isomerization mechanisms of diazene and hydrogens chains. Here, we use a minimal optimized basis set to compute FCI when possible with PySCF and VQE energies of hydrogen chains with Tequila. We obtain similar results compared to a bigger basis set with considerably fewer configurations. Also, we show how this approach improves the estimation of the thermodynamic limit in the hydrogen chain at the HF level. Finally, we apply this approach to the optimization of all atomic orbitals of benzene and compute electronic correlations restricting the active space to the 6 π orbitals of benzene using the UpCCGSD ansatz implemented in Tequila.
In recent years, the field of quantum computing has significantly developed in both the improvement of hardware as well as the assembly of various software tools and platforms, including cloud access to quantum devices. Unfortunately, many of these resources are rapidly changing and thus lack accessibility and stability for robust algorithm prototyping and deployment. Effectively leveraging the array of hardware and software resources at a higher level, that can adapt to the rapid development of software and hardware, will allow for further advancement and democratization of quantum technologies to achieve useful computational tasks. As a way to approach this challenge, we present a flexible, high-level framework called algo2qpu that is well-suited for designing and testing instances of algorithms for near-term quantum computers on the cloud. Algorithms that employ adaptive protocols for optimizations of algorithm parameters can be grouped under the umbrella of "adaptive hybrid quantum-classical" (AHQC) algorithms. We demonstrate the utility of algo2qpu for near-term algorithm development by applying the framework to implement proof-of-principle instances of two AHQC algorithms that have applications in quantum chemistry and/or quantum machine learning, namely the quantum autoencoder and the variational quantum classifier, using Rigetti Computing's Forest platform.
Quantum computing has emerged as a transformative paradigm capable of solving complex computational problems that are intractable for classical computers. Central to the advancement of this technology is the development of efficient quantum algorithms and high fidelity simulations that enable the design, testing, and optimization of quantum solutions before deployment on physical hardware. This study focuses on the design and implementation of quantum algorithms tailored for solving a variety of quantum problems, including quantum chemistry, optimization, and cryptography. Using state of the art simulation platforms such as Qiskit, Cirq, and Pennylane, algorithm performance was evaluated in terms of accuracy, execution time, scalability, and resilience to noise. Benchmarks demonstrate that algorithms such as the Variational Quantum Eigensolver (VQE) and Quantum Approximate Optimization Algorithm (QAOA) achieve significant speedups in problem specific domains, while hybrid quantum–classical methods provide robust pathways for near term quantum advantage. Simulation results reveal that algorithmic efficiency can be significantly improved through optimized circuit depth, qubit connectivity mapping, and advanced error mitigation techniques. The findings highlight the potential of simulation driven quantum algorithm development in accelerating the practical realization of quantum computing applications across disciplines such as materials discovery, molecular modeling, secure communications, and complex optimization tasks.
We introduce Unitaria, a Python library that brings the simplicity of classical linear algebra toolkits such as NumPy and SciPy to the implementation of quantum algorithms based on block encodings, a general-purpose abstraction in which a matrix is embedded as a sub-block of a larger unitary operator. Their implementation has so far required deep knowledge of low-level circuit construction, which Unitaria aims to eliminate. The library provides a composable, array-like interface through which users can define block encodings of matrices and vectors, combine them through standard operations such as addition, multiplication, tensor products, and the Quantum Singular Value Transformation, and extract the resulting quantum circuits automatically. A key feature is a matrix-arithmetic evaluation path in which every operation can be computed directly on encoded vectors and matrices without dependence on ancilla qubits or circuit simulation. This enables correctness verification and classical simulation that scale well beyond what state vector simulation permits and also allows resource estimation, including gate counts, qubit counts, and normalization constants, without executing any circuit. Together, these capabilities allow researchers to develop, verify, and analyze quantum linear algebra algorithms today, ahead of the availability of error-corrected hardware. Unitaria is open source and available at https://github.com/tequilahub/unitaria.
We present qlbm , a Python software package designed to facilitate the development, simulation, and analysis of Quantum Lattice Boltzmann Methods (QBMs). qlbm is a modular framework that introduces a quantum component abstraction hierarchy tailored to the implementation of novel QBMs. The framework interfaces with state-of-the-art quantum software infrastructure to enable efficient simulation and validation pipelines, and leverages novel execution and pre-processing techniques that significantly reduce the computational resources required to develop quantum circuits. We demonstrate the versatility of the software by showcasing multiple QBMs in 2D and 3D with complex boundary conditions, integrated within automated benchmarking utilities. Accompanying the source code are extensive test suites, thorough online documentation resources, analysis tools, visualization methods, and demos that aim to increase the accessibility of QBMs while encouraging reproducibility and collaboration. Program summary Program Title: qlbm CPC Library link to program files: https://doi.org/10.17632/28hkvsg7p2.1 Developer's repository link: https://github.com/QCFD-Lab/qlbm Licensing provisions: MPL-2.0 Programming language: Python3 Supplementary material: The documentation of is available at https://qcfd-lab.github.io/qlbm/ . Nature of problem: The advent of quantum algorithms for computational fluid dynamics brings with it challenges that are new to the established field of computational physics. These challenges include the lack of standardized implementations of the still nascent quantum methods, the intense computational demands of developing and simulating quantum algorithms on hardware available today, and the absence of tools that integrate novel developments into established infrastructure. Because of these current limitations, physicists and mathematicians expend superfluous resources on tasks that more mature computational physics branches have surmounted long ago. Solution method: QLBM is a software package that provides an end-to-end development environment for quantum lattice Boltzmann methods. The modular design and flexible quantum circuit library provide a base for extending and generalizing quantum algorithms. Performance enhancements exploit the paradigm of quantum computing simulations to accelerate the speed at which researchers can verify the validity of their methods. Its integration with state-of-the-art quantum computing software and visualization tools increases the algorithms' accesibility. These features allow QLBM to effectively generate, simulate, and analyze quantum circuits for 2D and 3D computational fluid dynamics problems.
Fault-tolerant quantum computers, when realized, guarantee significant speedups for particular computational tasks. Quantum hardware in the near term, however, is limited to low hundreds of noisy qubits that are not error-corrected. To leverage such devices as well as accommodate rapid developments in both hardware and algorithms, variational quantum algorithms (VQAs) were introduced. These algorithms have the potential to be useful in areas such as chemistry, optimization, machine learning, among others. Despite this potential, the largest experiment to date has employed just twelve qubits to implement the Variational Quantum Eigensolver (VQE), a VQA for simulating ground state energies of fermionic systems. In this dissertation, we present several methods for extending and further developing VQAs to step closer towards realizing applications in which quantum computers can provide meaningful advantages over classical computers. In the first part, we present methods for analyzing and optimizing parameterized quantum circuits (PQCs), a core component in VQAs for approximating target quantum states, e.g. ground state wavefunctions in VQE. To compare among PQCs and guide their design and selection, we introduce a set of algorithm-independent descriptors that can be estimated from simulations. Using these descriptors, we rule out circuits with limited capabilities in expressive and entangling powers. Next, we present a strategy for optimizing PQCs with large parameter counts and high redundancy by removing circuit operations that are less important for optimizing the algorithm objective, effectively reducing the search space. We demonstrate that this method enables larger VQE simulations by converging previously difficult optimizations while additionally reducing circuit resources. In the second part, we present methods for developing VQAs that are related to the quantum hardware. We introduce a new algorithm for simulating components of a quantum processor using an existing quantum computer. The goal of this application is to leverage near-term devices and algorithms to aid in the design of more powerful next-generation quantum hardware. Lastly, we present a guide for algorithm prototyping by deploying instances of VQAs on quantum computers via the cloud. We demonstrate instances of two algorithms, the quantum autoencoder and classifier, on an eight-qubit device. While further advancements in hardware and algorithms lie ahead, our work, along with developments from previous studies, represents significant progress towards realizing practical quantum advantage.