Compiling universal quantum circuits
arXiv:1908.03994
Abstract
We propose a method of compiling that permits to identify quantum circuits able to simulate arbitrary -qubit unitary operations via the adjustment of angles in single-qubit gates therein. The method of compiling itself extends older quantum control techniques and stays computationally tractable for several qubits. As an application we identify compiling universal circuits for , and qubits consisting of , and CNOTs respectively.
arXiv comment5 pages, 4 figures. The application to QFT circuits has been eliminated, short circuits composed by CNOTs are presented instead
References in corpus (14)
- Elementary gates for quantum computation
- Synthesis of Quantum Logic Circuits
- Quantum Circuits for General Multiqubit Gates
- Quantum-assisted quantum compiling
- A universal quantum circuit for two-qubit transformations with three CNOT gates
- Simulating Large Quantum Circuits on a Small Quantum Computer
- Efficient decomposition of quantum gates
- Asymptotically optimal approximation of single qubit unitaries by Clifford and T circuits using a constant number of ancillary qubits
- High-Fidelity Single-Shot Toffoli Gate via Quantum Control
- Efficient Decomposition of Single-Qubit Gates into Basis Circuits
- Optimising the Solovay-Kitaev algorithm
- Non-holonomic Quantum Devices
- Quantum compiling with diffusive sets of gates
- Quantum Compiler Optimizations