Quantum circuit synthesis via a random combinatorial search
arXiv:2311.17298 · doi:10.1103/PhysRevA.109.052605
Abstract
We use a random search technique to find quantum gate sequences that implement perfect quantum state preparation or unitary operator synthesis with arbitrary targets. This approach is based on the recent discovery that there is a large multiplicity of quantum circuits that achieve unit fidelity in performing a given target operation, even at the minimum number of single-qubit and two-qubit gates needed to achieve unit fidelity. We show that the fraction of perfect-fidelity quantum circuits increases rapidly as soon as the circuit size exceeds the minimum circuit size required for achieving unit fidelity. This result implies that near-optimal quantum circuits for a variety of quantum information processing tasks can be identified relatively easily by trying only a few randomly chosen quantum circuits and optimizing their parameters. In addition to analyzing the case where the CNOT gate is the elementary two-qubit gate, we consider the possibility of using alternative two-qubit gates. In particular, we analyze the case where the two-qubit gate is the B gate, which is known to reduce the minimum quantum circuit size for two-qubit operations. We apply the random search method to the problem of decomposing the 4-qubit Toffoli gate and find a 15 CNOT-gate decomposition.
26 pages (preprint), 9 figures
References in corpus (25)
- Quantum Computing
- Natural and artificial atoms for quantum computation
- Optimal Quantum Circuits for General Two-Qubit Gates
- Quantum-state preparation with universal gate decompositions
- Minimal Universal Two-qubit Quantum Circuits
- A universal quantum circuit for two-qubit transformations with three CNOT gates
- Efficient decomposition of quantum gates
- Microwave-induced coupling of superconducting qubits
- Differentiable Quantum Architecture Search
- Quantum circuits with uniformly controlled one-qubit gates
- Selective darkening of degenerate transitions demonstrated with two superconducting quantum bits
- Speed limits for quantum gates in multi-qubit systems
- Compiling quantum algorithms for architectures with multi-qubit gates
- Minimum construction of two-qubit quantum operations
- Approaching the theoretical limit in quantum gate decomposition
- Programmable networks for quantum algorithms
- Approximate Quantum Circuit Synthesis using Block-Encodings
- How many CNOT gates does it take to generate a three-qubit state ?
- Selective darkening of degenerate transitions for implementing quantum controlled-NOT gates
- Numerical analysis of quantum circuits for state preparation and unitary operator synthesis
- Automated Quantum Circuit Design with Nested Monte Carlo Tree Search
- Speed limits for two-qubit gates with weakly anharmonic qubits
- Quantum circuit synthesis using Householder transformations
- Synthesizing quantum circuits via numerical optimization
- Quantum Circuit Distillation and Compression