JMJeffrey Marshall

Jeffrey Marshall

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

Jeffrey Marshall has a total of 254 co-authors. Here are the top co-authors by number of shared publications:

  • Eleanor Rieffel

    Quantum Artificial Intelligence Laboratory (QuAIL), NASA Ames Research Center, Moffett Field, California 94035, USA

    6 shared publications
  • Paolo Zanardi

    Department of Physics and Astronomy, and Center for Quantum Information Science and Technology, University of Southern California, Los Angeles, California 90089-0484, USA

    5 shared publications
  • Andre Petukhov

    4 shared publications
  • Eleanor G. Rieffel

    QuAIL, NASA Ames Research Center, Moffett Field, California 94035, USA

    4 shared publications
  • Lorenzo Campos Venuti

    Department of Physics and Astronomy and Center for Quantum Information Science and Technology, University of Southern California, Los Angeles, California 90089-0484, USA

    4 shared publications
  • Chris Quintana

    Google Quantum AI, Santa Barbara, California 93101, USA

    3 shared publications

Latest Publications

  • Open Access

    Simulation of quantum optics by coherent state decomposition

    by Jeffrey Marshall, Namit Anand

    We introduce a framework for simulating quantum optics by decomposing the system into a finite rank (number of terms) superposition of coherent states. This allows us to define a resource theory, where linear optical operations are 'free' (i.e., do not increase the rank), and the simulation complexity for an $m$-mode system scales quadratically in $m$, in stark contrast to the Hilbert space dimension. We outline this approach explicitly in the Fock basis, relevant in particular for Boson sampling, where the simulation time (space) complexity for computing output amplitudes, to arbitrary accuracy, scales as $O(m^2 2^n)$ ($O(m2^n)$), for $n$ photons distributed amongst $m$ modes. We additionally demonstrate that linear optical simulations with the $n$ photons initially in the same mode scales efficiently, as $O(m^2 n)$. This paradigm provides a practical notion of 'non-classicality', i.e., the classical resources required for simulation. Moreover, by making connections to the stellar rank formalism, we show this comes from two independent contributions, the number of single-photon additions, and the amount of squeezing.

  • Simulation of quantum optics by coherent state decomposition

    by Jeffrey Marshall, Namit Anand

    We introduce a framework for simulating quantum optics by decomposing the system into a finite rank (number of terms) superposition of coherent states. This allows us to define a resource theory, where linear optical operations are “free” (i.e., do not increase the rank), and the simulation complexity for an m-mode system scales quadratically in m, in stark contrast to the Hilbert space dimension. We outline this approach explicitly in the Fock basis, relevant in particular for Boson sampling, where the simulation time (space) complexity for computing output amplitudes, to arbitrary accuracy, scales as O(m2 2 n ) [O(m2 n )] for n photons distributed among m modes. We additionally demonstrate that linear optical simulations with the n photons initially in the same mode scales efficiently, as O(m2 n). This paradigm provides a practical notion of “non-classicality,” i.e., the classical resources required for simulation. Moreover, by making connections to the stellar rank formalism, we show this comes from two independent contributions, the number of single-photon additions and the amount of squeezing.


  • Scrambling and operator entanglement in local non-Hermitian quantum systems

    by Brian Barch, Namit Anand, Jeffrey Marshall, Eleanor Rieffel, Paolo Zanardi

    The breakdown of Lieb-Robinson bounds in local, non-Hermitian quantum systems opens up the possibility for a rich landscape of quantum many-body phenomenology. We elucidate this by studying information scrambling and quantum chaos in non-Hermitian variants of paradigmatic local quantum spin-chain models. We utilize a mixture of exact diagonalization and tensor network techniques for our numerical results and focus on three dynamical quantities: (i) out-of-time-ordered correlators (OTOCs), (ii) operator entanglement of the dynamics, and (iii) entanglement growth following a quench from product initial states. We show that while OTOCs fail to capture information scrambling in a simple, local, non-Hermitian transverse-field Ising model, the closely related operator entanglement is a robust measure of dynamical properties of interest. Moreover, we show that the short-time growth of operator entanglement can generically detect entanglement phase transitions in these systems while its long-time average is shown to be a reliable indicator of quantum chaos and entanglement phases. This allows us to extend operator entanglement-based diagnostics from previous works on closed and open quantum systems, to the new arena of monitored quantum dynamics. Finally, we remark on the efficacy of these dynamical quantities in detecting integrability/chaos in the presence of continuous monitoring.


  • Learning noise via dynamical decoupling of entangled qubits

    by Trevor McCourt, Charles Neill, Kenny Lee, Chris Quintana, Yu Chen, Julian Kelly, Jeffrey Marshall, V. N. Smelyanskiy, M. I. Dykman, Alexander Korotkov, et al.

    Understanding noise in entangled systems is a prerequisite for developing scalable quantum computers. Here, we propose and apply multiqubit dynamical decoupling sequences that characterize noise during two-qubit gates. This noise is qualitatively different from the well-studied noise that leads to single-qubit dephasing; it simultaneously affects the two qubits, inducing fluctuations in their entangling parameter. In our superconducting system, the experimentally observed noise comes from coupler flux fluctuations and is observed to be non-Gaussian, leading to the stepwise decay of signals.


  • Top Cited Papers
    Open Access

    Suppressing quantum errors by scaling a surface code logical qubit

    by Rajeev Acharya, Igor Aleiner, Richard Allen, Trond I. Andersen, Markus Ansmann, Frank Arute, Kunal Arya, Abraham Asfaw, Juan Atalaya, Ryan Babbush, et al.

    Practical quantum computing will require error rates well below those achievable with physical qubits. Quantum error correction1,2 offers a path to algorithmically relevant error rates by encoding logical qubits within many physical qubits, for which increasing the number of physical qubits enhances protection against physical errors. However, introducing more qubits also increases the number of error sources, so the density of errors must be sufficiently low for logical performance to improve with increasing code size. Here we report the measurement of logical qubit performance scaling across several code sizes, and demonstrate that our system of superconducting qubits has sufficient performance to overcome the additional errors from increasing qubit number. We find that our distance-5 surface code logical qubit modestly outperforms an ensemble of distance-3 logical qubits on average, in terms of both logical error probability over 25 cycles and logical error per cycle ((2.914 ± 0.016)% compared to (3.028 ± 0.023)%). To investigate damaging, low-probability error sources, we run a distance-25 repetition code and observe a 1.7 × 10−6 logical error per cycle floor set by a single high-energy event (1.6 × 10−7 excluding this event). We accurately model our experiment, extracting error budgets that highlight the biggest challenges for future systems. These results mark an experimental demonstration in which quantum error correction begins to improve performance with increasing qubit number, illuminating the path to reaching the logical error rates required for computation.


  • Master equation emulation and coherence preservation with classical control of a superconducting qubit

    by Evangelos Vlachos, Haimeng Zhang, Vivek Maurya, Jeffrey Marshall, Tameem Albash, E. M. Levenson-Falk

    Open quantum systems are a topic of intense theoretical research. The use of master equations to model a system's evolution subject to an interaction with an external environment is one of the most successful theoretical paradigms. General experimental tools to study different open system realizations have been limited, and so it is highly desirable to develop experimental tools which emulate diverse master equation dynamics and give a way to test open systems theories. In this paper we demonstrate a systematic method for engineering specific system-environment interactions and emulating master equations of a particular form using classical stochastic noise in a superconducting transmon qubit. We also demonstrate that non-Markovian noise can be used as a resource to extend the coherence of a quantum system and counteract the adversarial effects of Markovian environments.


  • Open Access

    Distillation of Indistinguishable Photons

    by Jeffrey Marshall

    A reliable source of identical (indistinguishable) photons is a prerequisite for exploiting interference effects, which is a necessary component for linear optical based quantum computing, and applications thereof such as Boson sampling. Generally speaking, the degree of distinguishability will determine the efficacy of the particular approach, for example by limiting the fidelity of constructed resource states, or reducing the complexity of an optical circuits output distribution. It is therefore of great practical relevance to engineer heralded sources of highly pure and indistinguishable photons. Inspired by magic state distillation, we present a protocol using standard linear optics which can be used to increase the indistinguishability of a photon source, to arbitrary accuracy. In particular, in the asymptotic limit of small error $\epsilon$, to reduce the error to $\epsilon' < \epsilon$ requires $O((\epsilon/\epsilon')^2)$ photons. We demonstrate the scheme is robust to detection and control errors in the optical components, and discuss the effect of other error sources.

  • Advantage of Pausing: Parameter Setting for Quantum Annealers

    by Zoe Gonzalez Izquierdo, Shon Grabbe, Husni Idris, Zhihui Wang, Jeffrey Marshall, Eleanor Rieffel

    Prior work showed the efficacy of pausing midanneal: such a pause improved the probability of success by orders of magnitude in a class of native problem instances and improved the time to solution in a class of embedded problem instances. A physics-based picture provides qualitative suggestions for where pausing midanneal is effective, for the interplay between annealing schedule parameters and other annealing properties and parameters such as embedding size and strength of the ferromagnetic coupling |JF|, and for the conditions under which pausing can improve the time to solution. Here, through demonstrations on an updated annealing architecture that has higher connectivity than previous annealers, and on multiple embedded problem classes, we are able to confirm various aspects of this picture. We demonstrate the robustness of the optimal pause parameters across platforms and problem classes, explore how to set |JF| to optimize performance in different scenarios, and provide empirical evidence that short pauses trump longer overall annealing times in time to solution. We also identify the number of different coefficients in a problem as a predictor of problem hardness, and explore its interplay with the optimal |JF| and embedding size. Based on these results we are able to present qualitative guidelines for parameter setting in quantum annealers.