Compiling universal quantum circuits
Rahul P. Singh, A. Mandilara

TL;DR
This paper introduces a compilation method for quantum circuits that can simulate any n-qubit unitary operation by adjusting single-qubit gate angles, extending existing control techniques and remaining computationally feasible for multiple qubits.
Contribution
It presents a novel compilation approach enabling the design of universal quantum circuits for 3 to 5 qubits with specific CNOT counts, advancing quantum circuit synthesis.
Findings
Universal circuits for 3, 4, and 5 qubits identified
Method extends older quantum control techniques
Compilation remains computationally tractable for several qubits
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum-Dot Cellular Automata
