GWGregory A. L. White

Gregory A. L. White

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Gregory A. L. White has a total of 52 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Experimental measurement and a physical interpretation of quantum shadow enumerators

    by Daniel Miller, Kyano Levi, Lukas Postler, Alex Steiner, Lennart Bittel, Gregory A. L. White, Yifan Tang, Eric J. Kuehnke, Antonio A. Mele, Sumeet Khatri, et al.

    Throughout its history, the theory of quantum error correction has heavily benefited from translating classical concepts into the quantum setting. In particular, classical notions of weight enumerators, which relate to the performance of an error-correcting code, and MacWilliams’ identity, which links enumerators of a code to the ones of its dual, have been generalized to the quantum case. In this work, we establish a relationship between the theoretical machinery of quantum weight enumerators and a seemingly unrelated physics experiment: we prove that Rains’ quantum shadow enumerators—a powerful mathematical tool—arise as probabilities of observing fixed numbers of triplets in a two-copy Bell sampling experiment. This insight allows us to develop here a rigorous framework for the direct measurement of quantum weight enumerators, thus enabling experimental and theoretical studies of the entanglement structure of any quantum error-correcting code or quantum state under investigation. On top of that, we derive concrete sample complexity bounds and physically motivated robustness guarantees against unavoidable experimental imperfections. Finally, we demonstrate the feasibility of experimentally learning weight enumerators on a trapped-ion quantum computer. Our experimental findings are in good agreement with theoretical predictions and illuminate how entanglement theory and quantum error correction cross-fertilize each other once two-copy Bell sampling experiments are combined with the theoretical machinery of quantum weight enumerators.


  • Bridging Entanglement and Magic Resources within Operator Space

    by Neil Dowling, Kavan Modi, Gregory A. L. White

    Local-operator entanglement (LOE) dictates the complexity of simulating Heisenberg evolution using tensor network methods, and it bears witness to many-body chaos for local dynamics. We show that LOE is also sensitive to how non-Clifford a unitary is-its magic resources. In particular, we prove that LOE is always upper-bound by three distinct magic monotones: T-count, unitary nullity, and operator-stabilizer Rényi entropy. Moreover, in the average case for large, random circuits, LOE and magic monotones approximately coincide. Our results imply that an operator evolution that is expensive to simulate using tensor network methods must also be inefficient using both stabilizer and Pauli truncation methods. In terms of a previous conjecture on the characteristic scaling of LOE, our results imply that nonintegrable spin chains cannot be simulated classically. Entanglement in operator space therefore measures a unified picture of nonclassical resources, in stark contrast to the Schrödinger picture.


  • Topological signal processing on quantum computers for higher-order network analysis

    by Caesnan M.G. Leditto, Angus Southwell, Behnam Tonekaboni, Gregory A.L. White, Muhammad Usman, Kavan Modi


  • Open Access

    Unifying Non-Markovian Characterization with an Efficient and Self-Consistent Framework

    by G. A. L. White, P. Jurcevic, C. D. Hill, K. Modi

    Noise on quantum devices is much more complex than it is commonly given credit. Far from usual models of decoherence, nearly all quantum devices are plagued by both a continuum of environments and temporal instabilities. These induce noisy quantum and classical correlations at the level of the circuit. The relevant spatiotemporal effects are difficult enough to understand, let alone combat. There is presently a lack of either scalable or complete methods to address the phenomena responsible for scrambling and loss of quantum information. Here, we make deep strides to remedy this problem. We establish a theoretical framework that uniformly incorporates and classifies all non-Markovian phenomena. Our framework is universal, assumes no parameters values, and is written entirely in terms of experimentally accessible circuit-level quantities. We formulate an efficient reconstruction using tensor network learning, allowing also for easy modularization and simplification based on the expected physics of the system. This is then demonstrated through both extensive numerical studies and implementations on IBM Quantum devices, estimating a comprehensive set of spacetime correlations. Finally, we conclude our analysis with applications thereof to the efficacy of control techniques to counteract these effects—including noise-aware circuit compilation and optimized dynamical decoupling. We find significant improvements are possible in the diamond norm and average gate fidelity of arbitrary SU(4) operations, as well as related decoupling improvements in contrast to off-the-shelf schemes. Published by the American Physical Society 2025


  • Open Access

    Capturing Long-Range Memory Structures with Tree-Geometry Process Tensors

    by Neil Dowling, Kavan Modi, Roberto N. Muñoz, Sukhbinder Singh, Gregory A. L. White

    We introduce a class of quantum non-Markovian processes—dubbed process trees—that exhibit polynomially decaying temporal correlations and memory distributed across timescales. This class of processes is described by a tensor network with treelike geometry whose component tensors are (1) causality-preserving maps (superprocesses) and (2) locality-preserving temporal change-of-scale transformations. We show that the long-range correlations in this class of processes tends to originate almost entirely from memory effects and can accommodate genuinely quantum power-law correlations in time. Importantly, this class allows efficient computation of multitime correlation functions. To showcase the potential utility of this model-agnostic class for numerical simulation of physical models, we show how it can efficiently approximate the strong memory dynamics of the paradigmatic spin-boson model, in terms of arbitrary multitime features. In contrast to an equivalently costly matrix-product-operator representation, the ansatz produces a fiducial characterization of the relevant physics. Finally, leveraging 2D tensor-network renormalization-group methods, we detail an algorithm for deriving a process tree from an underlying Hamiltonian via the Feynmann-Vernon influence functional. Our work lays the foundation for the development of more efficient numerical techniques in the field of strongly interacting open quantum systems, as well as the theoretical development of a temporal renormalization-group scheme. Published by the American Physical Society 2024


  • Truncated phase-based quantum arithmetic: Error propagation and resource reduction

    by G. A. L. White, C. D. Hill, L. C. L. Hollenberg

    There are two important, and potentially interconnecting, avenues to the realization of large-scale quantum algorithms: improvement of the hardware, and reduction of resource requirements demanded by algorithm components. In focusing on the latter, one crucial subroutine to many sought-after applications is the quantum adder. A variety of different implementations exist with idiosyncratic pros and cons. One of these, the Draper quantum Fourier adder, offers the lowest qubit count of any adder, but requires a substantial number of gates as well as extremely fine rotations. In this work we present a modification of the Draper adder which eliminates small-angle rotations to highly coarse levels, matched with some strategic corrections. This reduces hardware requirements without sacrificing the qubit saving. We show that the inherited loss of fidelity is directly given by the rate of carry and borrow bits in the computation. We derive formulas to predict this, complemented by complete gate-level matrix product state simulations of the circuit. Moreover, we analytically describe the effects of possible stochastic control error. We present an in-depth analysis of this approach in the context of Shor's algorithm, focusing on the factoring of RSA-2048. Surprisingly, we find that each of the 7×107 quantum Fourier transforms may be truncated down to π/64, with additive rotations left only slightly finer. This result is much more efficient than previously realized. We quantify savings in terms of both logical resources and raw magic states, demonstrating that phase adders can be competitive with Toffoli-based constructions.

  • Open Access

    Noise-robust ground state energy estimates from deep quantum circuits

    by Harish J. Vallury, Michael A. Jones, Gregory A. L. White, Floyd M. Creevey, Charles D. Hill, Lloyd C. L. Hollenberg

    In the lead up to fault tolerance, the utility of quantum computing will be determined by how adequately the effects of noise can be circumvented in quantum algorithms. Hybrid quantum-classical algorithms such as the variational quantum eigensolver (VQE) have been designed for the short-term regime. However, as problems scale, VQE results are generally scrambled by noise on present-day hardware. While error mitigation techniques alleviate these issues to some extent, there is a pressing need to develop algorithmic approaches with higher robustness to noise. Here, we explore the robustness properties of the recently introduced quantum computed moments (QCM) approach to ground state energy problems, and show through an analytic example how the underlying energy estimate explicitly filters out incoherent noise. Motivated by this observation, we implement QCM for a model of quantum magnetism on IBM Quantum hardware to examine the noise-filtering effect with increasing circuit depth. We find that QCM maintains a remarkably high degree of error robustness where VQE completely fails. On instances of the quantum magnetism model up to 20 qubits for ultra-deep trial state circuits of up to 500 CNOTs, QCM is still able to extract reasonable energy estimates. The observation is bolstered by an extensive set of experimental results. To match these results, VQE would need hardware improvement by some 2 orders of magnitude on error rates.


  • Open Access

    Noise-robust ground state energy estimates from deep quantum circuits

    by Harish J. Vallury, Michael A. Jones, Gregory A. L. White, Floyd M. Creevey, Charles D. Hill, Lloyd C. L. Hollenberg

    In the lead up to fault tolerance, the utility of quantum computing will be determined by how adequately the effects of noise can be circumvented in quantum algorithms. Hybrid quantum-classical algorithms such as the variational quantum eigensolver (VQE) have been designed for the short-term regime. However, as problems scale, VQE results are generally scrambled by noise on present-day hardware. While error mitigation techniques alleviate these issues to some extent, there is a pressing need to develop algorithmic approaches with higher robustness to noise. Here, we explore the robustness properties of the recently introduced quantum computed moments (QCM) approach to ground state energy problems, and show through an analytic example how the underlying energy estimate explicitly filters out incoherent noise. Motivated by this observation, we implement QCM for a model of quantum magnetism on IBM Quantum hardware to examine the noise-filtering effect with increasing circuit depth. We find that QCM maintains a remarkably high degree of error robustness where VQE completely fails. On instances of the quantum magnetism model up to 20 qubits for ultra-deep trial state circuits of up to ~500 CNOTs, QCM is still able to extract reasonable energy estimates. The observation is bolstered by an extensive set of experimental results. To match these results, VQE would need hardware improvement by some 2 orders of magnitude on error rates.

  • Filtering Crosstalk from Bath Non-Markovianity via Spacetime Classical Shadows

    by G. A. L. White, K. Modi, C. D. Hill

    From an open system perspective non-Markovian effects due to a nearby bath or neighboring qubits are dynamically equivalent. However, there is a conceptual distinction to account for: neighboring qubits may be controlled. We combine recent advances in non-Markovian quantum process tomography with the framework of classical shadows to characterize spatiotemporal quantum correlations. Observables here constitute operations applied to the system, where the free operation is the maximally depolarizing channel. Using this as a causal break, we systematically erase causal pathways to narrow down the progenitors of temporal correlations. We show that one application of this is to filter out the effects of crosstalk and probe only non-Markovianity from an inaccessible bath. It also provides a lens on spatiotemporally spreading correlated noise throughout a lattice from common environments. We demonstrate both examples on synthetic data. Owing to the scaling of classical shadows, we can erase arbitrarily many neighboring qubits at no extra cost. Our procedure is thus efficient and amenable to systems even with all-to-all interactions.


  • Open Access

    Sampling Complexity of Open Quantum Systems

    by I.A. Aloisio, G.A.L. White, C.D. Hill, K. Modi

    Open quantum systems are ubiquitous in the physical sciences, with widespread applications in the areas of chemistry, condensed-matter physics, material science, optics, and many more. Not surprisingly, there is significant interest in their efficient simulation. However, direct classical simulation quickly becomes intractable with coupling to an environment with an effective dimension that grows exponentially. This raises the question: Can quantum computers help model these complex dynamics? A first step in answering this question requires an understanding of the computational complexity of this task. Here, we map the temporal complexity of a process to the spatial complexity of a many-body state using a computational model known as the process-tensor framework. With this, we are able to explore the simulation complexity of an open quantum system as a dynamic sampling problem: a system coupled to an environment can be probed at successive points in time—accessing multitime correlations. The complexity of multitime sampling, which is an important and interesting problem in its own right, contains the complexity of master equations and stochastic maps as a special case. Our results show how the complexity of the underlying quantum stochastic process corresponds to the complexity of the associated family of master equations for the dynamics. We present both analytical and numerical examples where the multitime sampling of an open quantum system is as complex as sampling from a many-body state that is classically hard. This also implies that the corresponding family of master equations is classically hard. Our results pave the way for studying open quantum systems from a complexity-theoretic perspective, highlighting the role quantum computers will play in our understanding of quantum dynamics.