Universal Programmable Quantum Circuit Schemes to Emulate an Operator

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. They have almost the same quantum complexities as non-general circuits. 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.

combined with former arXiv:1207.1740

References in corpus (7)

• Simulated Quantum Computation of Molecular Energies
• Synthesis of Quantum Logic Circuits
• Polynomial-time quantum algorithm for the simulation of chemical dynamics
• Simulating chemistry using quantum computers
• Quantum computing applied to calculations of molecular energies: CH2 benchmark
• Constructive Quantum Shannon Decomposition from Cartan Involutions
• Realization of a General Three-Qubit Quantum Gate