Composability of global phase invariant distance and its application to approximation error management

• URL: http://arxiv.org/abs/2106.07099v3
• Date: Tue, 23 Nov 2021 19:04:24 GMT
• Title: Composability of global phase invariant distance and its application to approximation error management
• Authors: Priyanka Mukhopadhyay
• Abstract summary: A quantum compiler synthesizes each approximately synthesizable unitary up to some approximation error. In this paper we consider the case when the errors are measured in the global phase invariant distance.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• 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, while others can be approximately synthesized. A quantum compiler synthesizes 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 (Bernstein,Vazirani,1997), derived for the operator norm. This indicates that synthesizing a circuit using global phase invariant distance maybe done with less number of resources. Next we consider the following problem. Suppose we are given a decomposition of a unitary. The task is to distribute the errors in each component such that the T-count is optimized. Specifically, we consider those decompositions where $R_z(\theta)$ 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. 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.

Related papers

• Statistical mechanical mapping and maximum-likelihood thresholds for the surface code under generic single-qubit coherent errors [0.0]
  We consider single-qubit coherent errors in the surface code, i.e., rotations by angle $alpha$ about an axis that can be chosen arbitrarily. We numerically establish the existence of an error-correcting phase, which we chart in a subspace of rotation axes to estimate the corresponding maximum-likelihood thresholds.
  arXiv  Detail & Related papers  (2024-10-29T18:23:23Z)
• Universal transversal gates [0.0]
  A long-standing challenge in quantum error correction is the infeasibility of universal gates, as shown by the Eastin-Knill theorem. We obtain a necessary and sufficient condition for a quantum code to have universal gates and show that the Eastin-Knill no-go result is a special case that does not hold for a general error model.
  arXiv  Detail & Related papers  (2024-10-09T16:34:47Z)
• Trotter error time scaling separation via commutant decomposition [6.418044102466421]
  Suppressing the Trotter error in dynamical quantum simulation typically requires running deeper circuits. We introduce a general framework of commutant decomposition that separates disjoint error components that have fundamentally different scaling with time. We show that this formalism not only straightforwardly reproduces previous results but also provides a better error estimate for higher-order product formulas.
  arXiv  Detail & Related papers  (2024-09-25T05:25:50Z)
• Error Crafting in Probabilistic Quantum Gate Synthesis [0.16777183511743468]
  We exploit the fact that error synthesis can be characterized completely and efficiently. We show a numerical evidence for the synthesis of Pauli rotations based on Clifford+T formalism. Our work opens a novel avenue in quantum circuit design and architecture that orchestrates error countermeasures.
  arXiv  Detail & Related papers  (2024-05-24T13:54:11Z)
• Entrywise error bounds for low-rank approximations of kernel matrices [55.524284152242096]
  We derive entrywise error bounds for low-rank approximations of kernel matrices obtained using the truncated eigen-decomposition. A key technical innovation is a delocalisation result for the eigenvectors of the kernel matrix corresponding to small eigenvalues. We validate our theory with an empirical study of a collection of synthetic and real-world datasets.
  arXiv  Detail & Related papers  (2024-05-23T12:26:25Z)
• Probabilistic state synthesis based on optimal convex approximation [1.2277343096128712]
  We show that the optimal probabilistic synthesis quadratically reduces the approximation error. We also numerically demonstrate how this conversion halves an information-theoretic lower bound on the circuit size.
  arXiv  Detail & Related papers  (2023-03-20T04:43:21Z)
• Random quantum circuits transform local noise into global white noise [118.18170052022323]
  We study the distribution over measurement outcomes of noisy random quantum circuits in the low-fidelity regime. For local noise that is sufficiently weak and unital, correlations (measured by the linear cross-entropy benchmark) between the output distribution $p_textnoisy$ of a generic noisy circuit instance shrink exponentially. If the noise is incoherent, the output distribution approaches the uniform distribution $p_textunif$ at precisely the same rate.
  arXiv  Detail & Related papers  (2021-11-29T19:26:28Z)
• Optimal policy evaluation using kernel-based temporal difference methods [78.83926562536791]
  We use kernel Hilbert spaces for estimating the value function of an infinite-horizon discounted Markov reward process. We derive a non-asymptotic upper bound on the error with explicit dependence on the eigenvalues of the associated kernel operator. We prove minimax lower bounds over sub-classes of MRPs.
  arXiv  Detail & Related papers  (2021-09-24T14:48:20Z)
• Statistically Meaningful Approximation: a Case Study on Approximating Turing Machines with Transformers [50.85524803885483]
  This work proposes a formal definition of statistically meaningful (SM) approximation which requires the approximating network to exhibit good statistical learnability. We study SM approximation for two function classes: circuits and Turing machines.
  arXiv  Detail & Related papers  (2021-07-28T04:28:55Z)
• Random quantum circuits anti-concentrate in log depth [118.18170052022323]
  We study the number of gates needed for the distribution over measurement outcomes for typical circuit instances to be anti-concentrated. Our definition of anti-concentration is that the expected collision probability is only a constant factor larger than if the distribution were uniform. In both the case where the gates are nearest-neighbor on a 1D ring and the case where gates are long-range, we show $O(n log(n)) gates are also sufficient.
  arXiv  Detail & Related papers  (2020-11-24T18:44:57Z)
• Spectral density estimation with the Gaussian Integral Transform [91.3755431537592]
  spectral density operator $hatrho(omega)=delta(omega-hatH)$ plays a central role in linear response theory. We describe a near optimal quantum algorithm providing an approximation to the spectral density.
  arXiv  Detail & Related papers  (2020-04-10T03:14:38Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.