Floating Point Representations in Quantum Circuit Synthesis

Abstract

We provide a non-deterministic quantum protocol that approximates the single qubit rotations R_x(2a^2 b^2)$ using R_x(2a) and R_x(2b) and a constant number of Clifford and T operations. We then use this method to construct a "floating point" implementation of a small rotation wherein we use the aforementioned method to construct the exponent part of the rotation and also to combine it with a mantissa. This causes the cost of the synthesis to depend more strongly on the relative (rather than absolute) precision required. We analyze the mean and variance of the \Tcount required to use our techniques and provide new lower bounds for the T-count for ancilla free synthesis of small single-qubit axial rotations. We further show that our techniques can use ancillas to beat these lower bounds with high probability. We also discuss the T-depth of our method and see that the vast majority of the cost of the resultant circuits can be shifted to parallel computation paths.

Comments welcome

References in corpus (7)

• Simulating chemistry using quantum computers
• Quantum circuits of T-depth one
• Novel constructions for the fault-tolerant Toffoli gate
• Efficient Decomposition of Single-Qubit Gates into $V$ Basis Circuits
• Resource Requirements for Fault-Tolerant Quantum Simulation: The Transverse Ising Model Ground State
• Efficient discrete-time simulations of continuous-time quantum query algorithms
• Simulating the Transverse Ising Model on a Quantum Computer: Error Correction with the Surface Code

Cited by in corpus (14)

• Quantum Machine Learning for Chemistry and Physics
• Efficient synthesis of universal Repeat-Until-Success circuits
• Quantum Software Engineering: Roadmap and Challenges Ahead
• Importance of Kernel Bandwidth in Quantum Machine Learning
• Repeat-Until-Success circuits with fixed-point oblivious amplitude amplification
• On The Power Of Coherently Controlled Quantum Adiabatic Evolutions
• Magic State Distillation and Gate Compilation in Quantum Algorithms for Quantum Chemistry
• Realization of a quantum neural network using repeat-until-success circuits in a superconducting quantum processor
• A Quantum Hopfield Associative Memory Implemented on an Actual Quantum Processor
• Automatic Post-selection by Ancillae Thermalisation
• Practical sampling schemes for quantum phase estimation
• An Amplitude-Based Implementation of the Unit Step Function on a Quantum Computer
• Ancilla Approximable Quantum State Transformations
• Saving resources through repeat-until-success positive-operator-valued-measure measurements in quantum computation