Trotterization-based, iterative approaches to quantum simulation (QS) are restricted to simulation times less than the coherence time of the quantum computer (QC), which limits their utility in the near term. Here, we present a hybrid quantum-classical algorithm, called variational fast forwarding (VFF), for decreasing the quantum circuit depth of QSs. VFF seeks an approximate diagonalization of a short-time simulation to enable longer-time simulations using a constant number of gates. Our error analysis provides two results: (1) the simulation error of VFF scales at worst linearly in the fast-forwarded simulation time, and (2) our cost function’s operational meaning as an upper bound on average-case simulation error provides a natural termination condition for VFF. We implement VFF for the Hubbard, Ising, and Heisenberg models on a simulator. In addition, we implement VFF on Rigetti’s QC to demonstrate simulation beyond the coherence time. Finally, we show how to estimate energy eigenvalues using VFF.
Noise detrimentally affects quantum computations so that they not only become less accurate but also easier to simulate classically as systems scale up. We construct a classical simulation algorithm, lowesa (low weight efficient simulation algorithm), for estimating expectation values of noisy parameterised quantum circuits with a fixed observable. It combines previous results on spectral analysis of parameterised circuits with Pauli back-propagation and recent ideas for simulations of noisy random circuits. We show, under some conditions on the circuits and mild assumptions on noise, that lowesa gives an efficient, polynomial algorithm in the number of qubits (and depth), with approximation error that vanishes exponentially in the physical error rate and a controllable cutoff parameter. This is valid for any expectation value that may be efficiently evaluated on a quantum computer. We discuss the practical limitations of the method for circuit classes with correlated parameters and its scaling with decreasing error rates.
To what extent does Noether’s principle apply to quantum channels? Here, we quantify the degree to which imposing a symmetry constraint on quantum channels implies a conservation law and show that this relates to physically impossible transformations in quantum theory, such as time reversal and spin inversion. In this analysis, the convex structure and extremal points of the set of quantum channels symmetric under the action of a Lie group becomes essential. It allows us to derive bounds on the deviation from conservation laws under any symmetric quantum channel in terms of the deviation from closed dynamics as measured by the unitarity of the channel . In particular, we investigate in detail the U(1) and SU(2) symmetries related to energy and angular momentum conservation laws. In the latter case, we provide fundamental limits on how much a spin- system can be used to polarize a larger spin- system, and on how much one can invert spin polarization using a rotationally symmetric operation. Finally, we also establish novel links between unitarity, complementary channels, and purity that are of independent interest.
The detrimental effect of noise accumulates as quantum computers grow in size. In the case where devices are too small or noisy to perform error correction, error mitigation may be used. Error mitigation does not increase the fidelity of quantum states, but instead aims to reduce the approximation error in quantities of concern, such as expectation values of observables. However, it is as yet unclear which circuit types, and devices of which characteristics, benefit most from the use of error mitigation. Here we develop a methodology to assess the performance of quantum error mitigation techniques. Our benchmarks are volumetric in design, and are performed on different superconducting hardware devices. Extensive classical simulations are also used for comparison. We use these benchmarks to identify disconnects between the predicted and practical performance of error mitigation protocols, and to identify the situations in which their use is beneficial. To perform these experiments, and for the benefit of the wider community, we introduce– an open source python package for quantum error mitigation. Qermit supports a wide range of error mitigation methods, is easily extensible and has a modular graph-based software design that facilitates composition of error mitigation protocols and subroutines.
Incompatibility is a feature of quantum theory that sets it apart from classical theory, and the inability to clone an unknown quantum state is one of the most fundamental instances. The no-hiding theorem is another such instance that arises in the context of the black-hole information paradox, and can be viewed as being dual to no-cloning. Here, we formulate both of these fundamental features of quantum theory in a single form that is amenable to efficient verification, and that is robust to errors arising in state preparation and measurements. We extend the notion of unitarity—an average figure of merit that for quantum theory captures the coherence of a quantum channel—to general physical theories. Then, we introduce the notion of compatible unitarity pair (CUP) sets, that correspond to the allowed values of unitarities for compatible channels in the theory. We show that a CUP set constitutes a simple “fingerprint” of a physical theory, and that incompatibility can be studied through them. We derive information-disturbance constraints on quantum CUP sets that encode both the no-cloning/broadcasting and no-hiding theorems of quantum theory. We then develop randomized benchmarking protocols that efficiently estimate quantum CUP sets and provide simulations using IBMQ of the simplest instance. Finally, we discuss ways in which CUP sets and quantum no-go theorems could provide additional information to benchmark quantum devices. Published by the American Physical Society 2024