Quantum State Preparation Using an Exact CNOT Synthesis Formulation
arXiv:2401.01009 · doi:10.23919/DATE58400.2024.10546633
Abstract
Minimizing the use of CNOT gates in quantum state preparation is a crucial step in quantum compilation, as they introduce coupling constraints and more noise than single-qubit gates. Reducing the number of CNOT gates can lead to more efficient and accurate quantum computations. However, the lack of compatibility to model superposition and entanglement challenges the scalability and optimality of CNOT optimization algorithms on classical computers. In this paper, we propose an effective state preparation algorithm using an exact CNOT synthesis formulation. Our method represents a milestone as the first design automation algorithm to surpass manual design, reducing the best CNOT numbers to prepare a Dicke state by 2x. For general states with up to 20 qubits, our method reduces the CNOT number by 9% and 32% for dense and sparse states, on average, compared to the latest algorithms.
arXiv comment6 pages, 7 figures
References in corpus (15)
- Quantum entanglement
- Elementary gates for quantum computation
- Three qubits can be entangled in two inequivalent ways
- Multipartite entanglement and high precision metrology
- Quantum Circuits for General Multiqubit Gates
- On the advantages of using relative phase Toffolis with an application to multiple control Toffoli optimization
- A divide-and-conquer algorithm for quantum state preparation
- Efficient quantum algorithms for and states, and implementation on the IBM quantum computer
- Deterministic Preparation of Dicke States
- Linear-Depth Quantum Circuits for n-qubit Toffoli gates with no Ancilla
- On the CNOT-complexity of CNOT-PHASE circuits
- A Divide-and-Conquer Approach to Dicke State Preparation
- Quantum Circuits for Sparse Isometries
- Efficient Deterministic Preparation of Quantum States Using Decision Diagrams
- Quantum State Preparation Using an Exact CNOT Synthesis Formulation