Composability of global phase invariant distance and its application to approximation error management
Open Access
- 1 November 2021
- journal article
- research article
- Published by IOP Publishing in Journal of Physics Communications
- Vol. 5 (11) , 115017
Abstract
Many quantum algorithms can be written as a composition of unitaries, some of which can be exactly synthesized by a universal fault-tolerant gate set like Clifford+T, while others can be approximately synthesized. One task of a quantum compiler is to synthesize each approximately synthesizable unitary up to some approximation error, such that the error of the overall unitary remains bounded by a certain amount. In this paper we consider the case when the errors are measured in the global phase invariant distance. Apart from deriving a relation between this distance and the Frobenius norm, we show that this distance composes. If a unitary is written as a composition (product and tensor product) of other unitaries, we derive bounds on the error of the overall unitary as a function of the errors of the composed unitaries. Our bound is better than the sum-of-error bound, derived by Bernstein- Vazirani(1997), for the operator norm. This builds the intuition that working with the global phase invariant distance might give us a lower resource count while synthesizing quantum circuits. Next we consider the following problem. Suppose we are given a decomposition of a unitary, that is, the unitary is expressed as a composition of other unitaries. We want to distribute the errors in each component such that the resource-count (specifically T-count) is optimized. We consider the specific case when the unitary can be decomposed such that the R z (θ) gates are the only approximately synthesizable component. We prove analytically that for both the operator norm and global phase invariant distance, the error should be distributed equally among these components (given some approximations). The optimal number of T-gates obtained by using the global phase invariant distance is less than what is obtained using the operator norm. Furthermore, we show that in case of approximate Quantum Fourier Transform, the error obtained by pruning rotation gates is less when measured in this distance, rather than the operator norm.Keywords
All Related Versions
Funding Information
- NTT Research
- Government of Canada
This publication has 30 references indexed in Scilit:
- Quantum cryptography: Public key distribution and coin tossingTheoretical Computer Science, 2014
- Polynomial-Time T-Depth Optimization of Clifford+T Circuits Via Matroid PartitioningIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2014
- Asymptotically Optimal Topological Quantum CompilingPhysical Review Letters, 2014
- Asymptotically Optimal Approximation of Single Qubit Unitaries by Clifford andCircuits Using a Constant Number of Ancillary QubitsPhysical Review Letters, 2013
- Magic-state distillation with low overheadPhysical Review A, 2012
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum ComputerSIAM Review, 1999
- Quantum computations: algorithms and error correctionRussian Mathematical Surveys, 1997
- Quantum Complexity TheorySIAM Journal on Computing, 1997
- Quantum theory, the Church–Turing principle and the universal quantum computerProceedings of the Royal Society of London. A. Mathematical and Physical Sciences, 1985
- Simulating physics with computersInternational Journal of Theoretical Physics, 1982