Searcharxiv⌕ Search

arXiv subjects

Joshua Skanes-Norman

Publications and source records attributed to Joshua Skanes-Norman.

4 recordsLinked to original sources

Observable Estimation in the Absence of Classical Verification

The predictive success of quantum mechanics underpins many areas of modern science, even as the exact simulation of large, interacting quantum systems remains beyond the reach of classical computation. This success has been enabled by the remarkable advancement of scalable numerical approximation methods, which often demonstrate practical accuracy despite the absence of formal guarantees. As quantum simulation pushes into regimes where these approximations struggle, a fundamental challenge arises: How can quantum outcomes be trusted when reliable classical benchmarks are unavailable? Here, we establish a framework for the independent validation of quantum estimates in this setting and present evidence that they provide the most credible result among several considered methods, in the absence of an immediately accessible ground-truth solution. We apply our framework to the semi-scrambling dynamics of a physical model that strains several leading classical simulation methods yet remains experimentally accessible, in part through our introduction of the \textit{operator Loschmidt echo}. We systematically design a series of experiments using quantum heuristics that, taken together, test the underlying assumptions and provide strong confidence in the observable estimates obtained from the quantum computer. We then show how this framework can be extended to place accuracy bounds on quantum estimates via careful characterization and manipulation of the device noise, transforming the problem of validating the observable estimation to validating the noise model. These results establish a route towards trusted quantum computation for scientific discovery, independent of classical verification.

quant-ph↗

The Error Reconstruction and Compiled Calibration of Quantum Computing Cycles

Quantum computers are inhibited by physical errors that occur during computation. For this reason, the development of increasingly sophisticated error characterization and error suppression techniques is central to the progress of quantum computing. Error distributions are considerably influenced by the precise gate scheduling across the entire quantum processing unit. To account for this holistic feature, we may ascribe each error profile to a (clock) cycle, which is a scheduled list of instructions over an arbitrarily large fraction of the chip. A celebrated technique known as randomized compiling introduces some randomness within cycles' instructions, which yields effective cycles with simpler, stochastic error profiles. In the present work, we leverage the structure of cycle benchmarking (CB) circuits as well as known Pauli channel estimation techniques to derive a method, which we refer to as cycle error reconstruction (CER), to estimate with multiplicative precision the marginal error distribution associated with any effective cycle of interest. The CER protocol is designed to scale for an arbitrarily large number of qubits. Furthermore, we develop a fast compilation-based calibration method, referred to as stochastic calibration (SC), to identify and suppress local coherent error sources occurring in any effective cycle of interest. We performed both protocols on IBM-Q 5-qubit devices. Via our calibration scheme, we obtained up to a 5-fold improvement of the circuit performance.

quant-ph↗

Designing Stochastic Channels

Stochastic channels are ubiquitous in the field of quantum information because they are simple and easy to analyze. In particular, Pauli channels and depolarizing channels are widely studied because they can be efficiently simulated in many relevant quantum circuits. Despite their wide use, the properties of general stochastic channels have received little attention. In this paper, we prove that the diamond distance of a general stochastic channel from the identity coincides with its process infidelity to the identity. We demonstrate with an explicit example that there exist multi-qubit stochastic channels that are not unital. We then discuss the relationship between unitary 1-designs and stochastic channels. We prove that the twirl of an arbitrary quantum channel by a unitary 1-design is always a stochastic channel. However, unlike with unitary 2-designs, the twirled channel depends upon the choice of unitary 1-design. Moreover, we prove by example that there exist stochastic channels that cannot be obtained by twirling a quantum channel by a unitary 1-design.

quant-ph↗

Clifford groups are not always 2-designs

The Clifford group is the quotient of the normalizer of the Weyl-Heisenberg group in dimension $d$ by its centre. We prove that when $d$ is not prime the Clifford group is not a group unitary $2$-design. Furthermore, we prove that the multipartite Clifford group is not a group unitary 2-design except for the known cases wherein the local Hilbert space dimensions are a constant prime number. We also clarify the structure of projective group unitary $2$-designs. We show that the adjoint action induced by a group unitary $2$-design decomposes into exactly two irreducible components; moreover, a group is a unitary 2-design if and only if the character of its so-called $U\overline{U}$ representation is $\sqrt{2}$.

quant-ph↗