Oracular Approximation of Quantum Multiplexors and Diagonal Unitary Matrices
Robert R. Tucci
TL;DR
This paper introduces a novel quantum circuit approximation technique for quantum multiplexors and diagonal unitary matrices, leveraging complexity theory oracles to improve efficiency and applicability.
Contribution
It presents a new approximation method for quantum multiplexors that also enables efficient approximation of diagonal unitary matrices using complexity theory oracles.
Findings
Provides a quantum circuit approximation for multiplexors
Enables approximation of diagonal unitary matrices
Uses complexity theory oracles for improved efficiency
Abstract
We give a new quantum circuit approximation of quantum multiplexors based on the idea of complexity theory oracles. As an added bonus, our multiplexor approximation immediately gives a quantum circuit approximation of diagonal unitary matrices.
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 · Matrix Theory and Algorithms