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:1204.3600 · The Journal of Chemical Physics

Universal programmable quantum circuit schemes to emulate an operator

Ammar Daskin, Ananth Y. Grama, Giorgos Kollias, Sabre Kais

Published Dec 21, 2012• 31 citations
arXivHTMLPDF

Abstract

Unlike fixed designs, programmable circuit designs support an infinite number of operators. The functionality of a programmable circuit can be altered by simply changing the angle values of the rotation gates in the circuit. Here, we present a new quantum circuit design technique resulting in two general programmable circuit schemes. The circuit schemes can be used to simulate any given operator by setting the angle values in the circuit. This provides a fixed circuit design whose angles are determined from the elements of the given matrix-which can be non-unitary-in an efficient way. We also give both the classical and quantum complexity analysis for these circuits and show that the circuits require a few classical computations. For the electronic structure simulation on a quantum computer, one has to perform the following steps: prepare the initial wave function of the system; present the evolution operator U = e(-iHt) for a given atomic and molecular Hamiltonian H in terms of quantum gates array and apply the phase estimation algorithm to find the energy eigenvalues. Thus, in the circuit model of quantum computing for quantum chemistry, a crucial step is presenting the evolution operator for the atomic and molecular Hamiltonians in terms of quantum gate arrays. Since the presented circuit designs are independent from the matrix decomposition techniques and the global optimization processes used to find quantum circuits for a given operator, high accuracy simulations can be done for the unitary propagators of molecular Hamiltonians on quantum computers. As an example, we show how to build the circuit design for the hydrogen molecule.

DOI
10.1063/1.4772185

Related papers

Quantum circuit design methods and applications

Ammar Daskin

Simulating quantum mechanical evolutions in general is difficult on classical computers because the size of the Hilbert space grows exponentially with the number of particles involved in the simulations. However, a quantum computer, which obeys the laws of quantum mechanics, is believed to perform such simulations more efficiently. The time evolution operator, a unitary matrix, of a quantum system acts as a quantum gate changing the state of the system in time. Therefore, any computation on quantum computers can be interpreted as a unitary transformation on quantum state vectors. Generally, quantum gates are sufficiently simple operations so as to avoid difficulty in the physical implementation. The implementation of a general given computation represented by a unitary matrix on quantum computers requires finding an array of elementary quantum gates describing the desired computation. This describes a matrix decomposition problem known as the quantum circuit design problem. In this dissertation, we address the following questions concerning quantum circuit designs: How hard is it to find suitable quantum circuits for a given computation? What are the possible circuit design methods? How do we apply these to simulations of quantum problems, in particular quantum chemistry problems? To answer these questions, we categorize methods for designing quantum circuits as evolutionary algorithms and deterministic methods. We apply our developed group leaders optimization algorithm, an evolutionary algorithm, to find quantum circuits for known quantum algorithms and the simulation of molecular Hamiltonians. Then, we present a deterministic circuit design approach to produce universal circuits, which can be programmable. Moreover, we show how to use these programmable circuit designs within the quantum phase estimation algorithm to find eigenvalues of nonunitary matrices and study resonances in quantum systems. Finally, the quantum phase estimation algorithm is employed to efficiently solve ranking problems: in particular, multiple network alignment is considered to find the similarities between protein-protein interaction networks and molecular networks.

•Jan 1, 2014•3 citations

Simulation of electronic structure Hamiltonians using quantum computers

James D. Whitfield, Jacob Biamonte, Alán Aspuru‐Guzik

Over the last century, a large number of physical and mathematical developments paired with rapidly advancing technology have allowed the field of quantum chemistry to advance dramatically. However, the lack of computationally efficient methods for the exact simulation of quantum systems on classical computers presents a limitation of current computational approaches. We report, in detail, how a set of pre-computed molecular integrals can be used to explicitly create a quantum circuit, i.e. a sequence of elementary quantum operations, that, when run on a quantum computer, obtains the energy of a molecular system with fixed nuclear geometry using the quantum phase estimation algorithm. We extend several known results related to this idea and discuss the adiabatic state preparation procedure for preparing the input states used in the algorithm. With current and near future quantum devices in mind, we provide a complete example using the hydrogen molecule of how a chemical Hamiltonian can be simulated using a quantum computer.

arXiv:1001.3855•Molecular Physics•Mar 5, 2011•555 citations

Decomposition of unitary matrices for finding quantum circuits: Application to molecular Hamiltonians

Ammar Daskin, Sabre Kais

Constructing appropriate unitary matrix operators for new quantum algorithms and finding the minimum cost gate sequences for the implementation of these unitary operators is of fundamental importance in the field of quantum information and quantum computation. Evolution of quantum circuits faces two major challenges: complex and huge search space and the high costs of simulating quantum circuits on classical computers. Here, we use the group leaders optimization algorithm to decompose a given unitary matrix into a proper-minimum cost quantum gate sequence. We test the method on the known decompositions of Toffoli gate, the amplification step of the Grover search algorithm, the quantum Fourier transform, and the sender part of the quantum teleportation. Using this procedure, we present the circuit designs for the simulation of the unitary propagators of the Hamiltonians for the hydrogen and the water molecules. The approach is general and can be applied to generate the sequence of quantum gates for larger molecular systems.

arXiv:1009.5625•The Journal of Chemical Physics•Apr 14, 2011•61 citations

Rotation-Based Design and Synthesis of Quantum Circuits

Mariam Zomorodi Moghadam, Keivan Navi

In this paper, a new synthesis method for Boolean irreversible functions has been proposed which is based on rotation quantum operators. The primary motivation is that the implementation of these operators is commonly available in quantum technologies. We introduce an approach for synthesizing Boolean irreversible functions in quantum logic which is based on quantum rotation and CNOT operators and uses a prespecified fixed design where by changing the rotation angles a new functionality can be achieved. So this design can be viewed as a programmable array of rotation gates. If reduction in quantum cost is desired, after this step the optimization approach may be applied to reduce the number of gates by using some rules, which leads to a reduction of up to 48% in the quantum cost after optimization compared to the original nonoptimized design obtained from the synthesis method. The paper also introduces efficient designs with rotation operators for some important gates in the quantum circuit libraries. Our main contribution is introducing a novel and low complexity approach for synthesizing irreversible functions using elementary rotation operators with a regular fixed design. Also having as many functions as desired with the same inputs, the execution time just increases by one for each additional function and the circuit width is increased by one for each additional function. It is proved that our approach can always be applied to each Boolean function. We show the correctness of our approach and make an upper bound of the quantum cost of the circuit.

Journal of Circuits Systems and Computers•Jul 25, 2016•10 citations

Self-Referential Quantum Circuits for Universal Computation

Jincheng Zhang

This paper explores a novel approach to quantum computation centered around self-referential quantum circuits. The core concept involves designing circuits that recursively incorporate themselves into their operational structure, effectively creating computational modules capable of self-replication. This is achieved through the strategic implementation of feedback loops and entanglement within the circuit architecture. The potential benefits of this paradigm include a reduction in circuit complexity and the possibility of constructing universal quantum computers from fundamentally simpler components. The theoretical framework presented herein outlines the key principles and mathematical underpinnings of this self-referential design, proposing a pathway toward more efficient and scalable quantum computation. The presented model uses the following notation: |ψ⟩ represents a quantum state, U(θ) represents a unitary operator with rotation angle θ, C represents a quantum circuit, and E represents the expectation value. Specifically, the expectation value of an observable A is denoted as E[A] = <ψ|A|ψ>, where |ψ> is the quantum state. The Hamiltonian of a quantum system is typically represented as H, and the time evolution of the state is governed by the Schrödinger equation: iℏ∂|ψ(t)⟩/∂t = H|ψ(t)⟩. Entanglement is represented by the Bell state |Φ⁺⟩ = (|00⟩ + |11⟩)/√2. Quantum gates, such as the Hadamard gate (H) and the CNOT gate (CN), are represented as unitary transformations. The circuit representation involves sequential application of gates, and the overall unitary transformation is the product of these gates. The circuit depth, denoted as d, represents the number of consecutive gate operations applied to a quantum state. The circuit complexity, denoted as C, is a measure of the number of gates required to implement a specific quantum algorithm. The circuit fidelity, denoted as F, quantifies the accuracy of a quantum circuit's output, ranging from 0 to 1. We define the quantum state preparation as |ψ⟩ = ∑i ci|i⟩, where ci are complex coefficients and |i⟩ are the computational basis states. The unitary transformation is defined as U|ψ⟩ = ∑i (Uici)|i⟩, where Ui are the matrix elements of the unitary operator U. The propagation of quantum states through a circuit is represented by the Schrödinger equation, and the final state is obtained by applying the unitary transformation to the initial state. The concept of quantum coherence, denoted as χ, represents the ability of a quantum system to maintain its superposition state. The fidelity of a quantum state is defined as the probability that a measurement will yield the expected outcome.

•Sep 4, 2026•0 citations

Advances in Molecular Quantum Computing: from Technological Modeling to Circuit Design

Giovanni Amedeo Cirillo, Giovanna Turvani, Mario Simoni +1 more

Molecules are serious candidates for building hardware for quantum computers. They can encode quantum information onto electron or nuclear spins and some of them show important features as the scalability of the number of qubits and a universal set of quantum gates. In this paper we present our advances in the development of a classical simulation infrastructure for molecular Quantum Computing: starting from the definition of simplified models taking into account the main physical features of each analyzed molecule, quantum gates are defined over these models, thus permitting to take into account the real behavior of each technology during the simulation. An interface with a hardware-agnostic description language has been also developed. The knowledge of the behavior of real systems permits to optimize the design of quantum circuits at both physical and compilation levels. Elementary quantum algorithms have been simulated on three different molecular technologies by changing the physical parameters of polarization and manipulation and quantum circuit design strategies. Results confirm the dependency of the fidelity of the results on both levels, thus proving that the choice of optimal operating points and circuit optimization techniques as virtual-Z gates are fundamental for ensuring the execution of quantum circuits with negligible errors.

IEEE Computer Society Annual Symposium on VLSI•Jul 1, 2020•6 citations
Unlike fixed designs, programmable circuit designs support an infinite number of operators. The functionality of a programmable circuit can be altered by simply changing the angle values of the rotation gates in the circuit. Here, we present a new quantum circuit design technique resulting in two general programmable circuit schemes. The circuit schemes can be used to simulate any given operator by setting the angle values in the circuit. This provides a fixed circuit design whose angles are determined from the elements of the given matrix-which can be non-unitary-in an efficient way. We also give both the classical and quantum complexity analysis for these circuits and show that the circuits require a few classical computations. For the electronic structure simulation on a quantum computer, one has to perform the following steps: prepare the initial wave function of the system; present the evolution operator U = e(-iHt) for a given atomic and molecular Hamiltonian H in terms of quantum gates array and apply the phase estimation algorithm to find the energy eigenvalues. Thus, in the circuit model of quantum computing for quantum chemistry, a crucial step is presenting the evolution operator for the atomic and molecular Hamiltonians in terms of quantum gate arrays. Since the presented circuit designs are independent from the matrix decomposition techniques and the global optimization processes used to find quantum circuits for a given operator, high accuracy simulations can be done for the unitary propagators of molecular Hamiltonians on quantum computers. As an example, we show how to build the circuit design for the hydrogen molecule.
Simulating quantum mechanical evolutions in general is difficult on classical computers because the size of the Hilbert space grows exponentially with the number of particles involved in the simulations. However, a quantum computer, which obeys the laws of quantum mechanics, is believed to perform such simulations more efficiently. The time evolution operator, a unitary matrix, of a quantum system acts as a quantum gate changing the state of the system in time. Therefore, any computation on quantum computers can be interpreted as a unitary transformation on quantum state vectors. Generally, quantum gates are sufficiently simple operations so as to avoid difficulty in the physical implementation. The implementation of a general given computation represented by a unitary matrix on quantum computers requires finding an array of elementary quantum gates describing the desired computation. This describes a matrix decomposition problem known as the quantum circuit design problem. In this dissertation, we address the following questions concerning quantum circuit designs: How hard is it to find suitable quantum circuits for a given computation? What are the possible circuit design methods? How do we apply these to simulations of quantum problems, in particular quantum chemistry problems? To answer these questions, we categorize methods for designing quantum circuits as evolutionary algorithms and deterministic methods. We apply our developed group leaders optimization algorithm, an evolutionary algorithm, to find quantum circuits for known quantum algorithms and the simulation of molecular Hamiltonians. Then, we present a deterministic circuit design approach to produce universal circuits, which can be programmable. Moreover, we show how to use these programmable circuit designs within the quantum phase estimation algorithm to find eigenvalues of nonunitary matrices and study resonances in quantum systems. Finally, the quantum phase estimation algorithm is employed to efficiently solve ranking problems: in particular, multiple network alignment is considered to find the similarities between protein-protein interaction networks and molecular networks.
Over the last century, a large number of physical and mathematical developments paired with rapidly advancing technology have allowed the field of quantum chemistry to advance dramatically. However, the lack of computationally efficient methods for the exact simulation of quantum systems on classical computers presents a limitation of current computational approaches. We report, in detail, how a set of pre-computed molecular integrals can be used to explicitly create a quantum circuit, i.e. a sequence of elementary quantum operations, that, when run on a quantum computer, obtains the energy of a molecular system with fixed nuclear geometry using the quantum phase estimation algorithm. We extend several known results related to this idea and discuss the adiabatic state preparation procedure for preparing the input states used in the algorithm. With current and near future quantum devices in mind, we provide a complete example using the hydrogen molecule of how a chemical Hamiltonian can be simulated using a quantum computer.
Constructing appropriate unitary matrix operators for new quantum algorithms and finding the minimum cost gate sequences for the implementation of these unitary operators is of fundamental importance in the field of quantum information and quantum computation. Evolution of quantum circuits faces two major challenges: complex and huge search space and the high costs of simulating quantum circuits on classical computers. Here, we use the group leaders optimization algorithm to decompose a given unitary matrix into a proper-minimum cost quantum gate sequence. We test the method on the known decompositions of Toffoli gate, the amplification step of the Grover search algorithm, the quantum Fourier transform, and the sender part of the quantum teleportation. Using this procedure, we present the circuit designs for the simulation of the unitary propagators of the Hamiltonians for the hydrogen and the water molecules. The approach is general and can be applied to generate the sequence of quantum gates for larger molecular systems.
In this paper, a new synthesis method for Boolean irreversible functions has been proposed which is based on rotation quantum operators. The primary motivation is that the implementation of these operators is commonly available in quantum technologies. We introduce an approach for synthesizing Boolean irreversible functions in quantum logic which is based on quantum rotation and CNOT operators and uses a prespecified fixed design where by changing the rotation angles a new functionality can be achieved. So this design can be viewed as a programmable array of rotation gates. If reduction in quantum cost is desired, after this step the optimization approach may be applied to reduce the number of gates by using some rules, which leads to a reduction of up to 48% in the quantum cost after optimization compared to the original nonoptimized design obtained from the synthesis method. The paper also introduces efficient designs with rotation operators for some important gates in the quantum circuit libraries. Our main contribution is introducing a novel and low complexity approach for synthesizing irreversible functions using elementary rotation operators with a regular fixed design. Also having as many functions as desired with the same inputs, the execution time just increases by one for each additional function and the circuit width is increased by one for each additional function. It is proved that our approach can always be applied to each Boolean function. We show the correctness of our approach and make an upper bound of the quantum cost of the circuit.
This paper explores a novel approach to quantum computation centered around self-referential quantum circuits. The core concept involves designing circuits that recursively incorporate themselves into their operational structure, effectively creating computational modules capable of self-replication. This is achieved through the strategic implementation of feedback loops and entanglement within the circuit architecture. The potential benefits of this paradigm include a reduction in circuit complexity and the possibility of constructing universal quantum computers from fundamentally simpler components. The theoretical framework presented herein outlines the key principles and mathematical underpinnings of this self-referential design, proposing a pathway toward more efficient and scalable quantum computation. The presented model uses the following notation: |ψ⟩ represents a quantum state, U(θ) represents a unitary operator with rotation angle θ, C represents a quantum circuit, and E represents the expectation value. Specifically, the expectation value of an observable A is denoted as E[A] = <ψ|A|ψ>, where |ψ> is the quantum state. The Hamiltonian of a quantum system is typically represented as H, and the time evolution of the state is governed by the Schrödinger equation: iℏ∂|ψ(t)⟩/∂t = H|ψ(t)⟩. Entanglement is represented by the Bell state |Φ⁺⟩ = (|00⟩ + |11⟩)/√2. Quantum gates, such as the Hadamard gate (H) and the CNOT gate (CN), are represented as unitary transformations. The circuit representation involves sequential application of gates, and the overall unitary transformation is the product of these gates. The circuit depth, denoted as d, represents the number of consecutive gate operations applied to a quantum state. The circuit complexity, denoted as C, is a measure of the number of gates required to implement a specific quantum algorithm. The circuit fidelity, denoted as F, quantifies the accuracy of a quantum circuit's output, ranging from 0 to 1. We define the quantum state preparation as |ψ⟩ = ∑i ci|i⟩, where ci are complex coefficients and |i⟩ are the computational basis states. The unitary transformation is defined as U|ψ⟩ = ∑i (Uici)|i⟩, where Ui are the matrix elements of the unitary operator U. The propagation of quantum states through a circuit is represented by the Schrödinger equation, and the final state is obtained by applying the unitary transformation to the initial state. The concept of quantum coherence, denoted as χ, represents the ability of a quantum system to maintain its superposition state. The fidelity of a quantum state is defined as the probability that a measurement will yield the expected outcome.
Molecules are serious candidates for building hardware for quantum computers. They can encode quantum information onto electron or nuclear spins and some of them show important features as the scalability of the number of qubits and a universal set of quantum gates. In this paper we present our advances in the development of a classical simulation infrastructure for molecular Quantum Computing: starting from the definition of simplified models taking into account the main physical features of each analyzed molecule, quantum gates are defined over these models, thus permitting to take into account the real behavior of each technology during the simulation. An interface with a hardware-agnostic description language has been also developed. The knowledge of the behavior of real systems permits to optimize the design of quantum circuits at both physical and compilation levels. Elementary quantum algorithms have been simulated on three different molecular technologies by changing the physical parameters of polarization and manipulation and quantum circuit design strategies. Results confirm the dependency of the fidelity of the results on both levels, thus proving that the choice of optimal operating points and circuit optimization techniques as virtual-Z gates are fundamental for ensuring the execution of quantum circuits with negligible errors.