output
20192026
most citedInformation Scrambling in Computationally Complex Quantum Circuits

304 citations

Showing quant-phShow all

23 papers · 1 filter

quant-ph2025★ 19 cited

Tensor networks for quantum computing

Aleksandr Berezutskii, Minzhao Liu, Atithi Acharya +25

In the rapidly evolving field of quantum computing, tensor networks serve as an important tool due to their multifaceted utility. In this paper, we review the diverse applications…

quant-ph2024★ 8 cited

Classical Pre-optimization Approach for ADAPT-VQE: Maximizing the Potential of High-Performance Computing Resources to Improve Quantum Simulation of Chemical Applications

J. Wayne Mullinax, Panagiotis G. Anastasiou, Jeffrey Larson +2

The ADAPT-VQE algorithm is a promising method for generating a compact ansatz based on derivatives of the underlying cost function, and it yields accurate predictions of electronic…

quant-ph2024★ 7 cited

Certifying the quantumness of a nuclear spin qudit through its uniform precession

Arjen Vaartjes, Martin Nurizzo, Lin Htoo Zaw +16

Spin precession is a textbook example of dynamics of a quantum system that exactly mimics its classical counterpart. Here we challenge this view by certifying the quantumness of ex…

quant-ph2024★ 2 cited

Benchmarking the performance of a high-Q cavity qudit using random unitaries

Nicholas Bornman, Tanay Roy, Joshua A. Job +4

High-coherence cavity resonators are excellent resources for encoding quantum information in higher-dimensional Hilbert spaces, moving beyond traditional qubit-based platforms. A n…

quant-ph2024★ 17 cited

Assessing and Advancing the Potential of Quantum Computing: A NASA Case Study

Eleanor G. Rieffel, Ata Akbari Asanjan, M. Sohaib Alam +20

Quantum computing is one of the most enticing computational paradigms with the potential to revolutionize diverse areas of future-generation computational systems. While quantum co…

quant-ph2024★ 44 cited

Schrödinger cat states of a nuclear spin qudit in silicon

Xi Yu, Benjamin Wilhelm, Danielle Holmes +17

High-dimensional quantum systems are a valuable resource for quantum information processing. They can be used to encode error-correctable logical qubits, which has been demonstrate…

quant-ph2024★ 5 cited

General protocols for the efficient distillation of indistinguishable photons

Jason Saied, Jeffrey Marshall, Namit Anand +1

We introduce state-of-the-art protocols to distill indistinguishable photons, reducing distinguishability error rates by a factor of , while using a modest amount of resources s…

quant-ph2024★ 2 cited

Dual-unitary shadow tomography

Ahmed A. Akhtar, Namit Anand, Jeffrey Marshall +1

We introduce ``dual-unitary shadow tomography'' (DUST), a classical shadow tomography protocol based on dual-unitary brick-wall circuits. To quantify the performance of DUST, we st…

quant-ph2024★ 2 cited

Advancing Quantum Networking: Some Tools and Protocols for Ideal and Noisy Photonic Systems

Jason Saied, Jeffrey Marshall, Namit Anand +2

Quantum networking at many scales will be critical to future quantum technologies and experiments on quantum systems. Photonic links enable quantum networking. They will connect co…

quant-ph2023★ 5 cited

Generating Hard Ising Instances With Planted Solutions Using Post-Quantum Cryptographic Protocols

Salvatore Mandrà, Humberto Munoz-Bauza, Gianni Mossi +1

In this paper we present a novel method to generate hard instances with planted solutions based on the public-private McEliece post-quantum cryptographic protocol. Unlike other pla…

quant-ph2023★ 47 cited

Effective quantum volume, fidelity and computational cost of noisy quantum processing experiments

K. Kechedzhi, S. V. Isakov, S. Mandrà +4

Today's experimental noisy quantum processors can compete with and surpass all known algorithms on state-of-the-art supercomputers for the computational benchmark task of Random Ci…

quant-ph2023★ 15 cited

Simulation of quantum optics by coherent state decomposition

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 r…

quant-ph2023★ 15 cited

Scrambling and operator entanglement in local non-Hermitian quantum systems

Brian Barch, Namit Anand, Jeffrey Marshall +2

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…

quant-ph2023★ 110 cited

Phase transition in Random Circuit Sampling

A. Morvan, B. Villalonga, X. Mi +182

Undesired coupling to the surrounding environment destroys long-range correlations on quantum processors and hinders the coherent evolution in the nominally available computational…

quant-ph2022★ 18 cited

Lower Bounds on Quantum Annealing Times

Luis Pedro García-Pintos, Lucas T. Brady, Jacob Bringewatt +1

The adiabatic theorem provides sufficient conditions for the time needed to prepare a target ground state. While it is possible to prepare a target state much faster with more gene…

quant-ph2022★ 33 cited

Real-Time Krylov Theory for Quantum Computing Algorithms

Yizhi Shen, Katherine Klymko, James Sud +3

Quantum computers provide new avenues to access ground and excited state properties of systems otherwise difficult to simulate on classical hardware. New approaches using subspaces…

quant-ph2022★ 2 cited

Simultaneous Stoquasticity

Jacob Bringewatt, Lucas T. Brady

Stoquastic Hamiltonians play a role in the computational complexity of the local Hamiltonian problem as well as the study of classical simulability. In particular, stoquastic Hamil…

quant-ph2021★ 6 cited

Lefschetz Thimble Quantum Monte Carlo for Spin Systems

T. C. Mooney, Jacob Bringewatt, Neill C. Warrington +1

Monte Carlo simulations are useful tools for modeling quantum systems, but in some cases they suffer from a sign problem, leading to an exponential slow down in their convergence t…

quant-ph2021★ 88 cited

Real time evolution for ultracompact Hamiltonian eigenstates on quantum hardware

Katherine Klymko, Carlos Mejuto-Zaera, Stephen J. Cotton +9

In this work we present a detailed analysis of variational quantum phase estimation (VQPE), a method based on real-time evolution for ground and excited state estimation on near-te…

quant-ph2021★ 16 cited

Simulation of adiabatic quantum computing for molecular ground states

Vladimir Kremenetski, Carlos Mejuto-Zaera, Stephen J. Cotton +1

Quantum computation promises to provide substantial speedups in many practical applications with a particularly exciting one being the simulation of quantum many-body systems. Adia…

quant-ph2021★ 9 cited

Perils of Embedding for Quantum Sampling

Jeffrey Marshall, Gianni Mossi, Eleanor G. Rieffel

Given quantum hardware that enables sampling from a family of natively implemented Hamiltonians, how well can one use that hardware to sample from a Hamiltonian outside that family…

quant-ph2021★ 304 cited

Information Scrambling in Computationally Complex Quantum Circuits

Xiao Mi, Pedram Roushan, Chris Quintana +90

Interaction in quantum systems can spread initially localized quantum information into the many degrees of freedom of the entire system. Understanding this process, known as quantu…

quant-ph2020★ 64 cited

Classical symmetries and the Quantum Approximate Optimization Algorithm

Ruslan Shaydulin, Stuart Hadfield, Tad Hogg +1

We study the relationship between the Quantum Approximate Optimization Algorithm (QAOA) and the underlying symmetries of the objective function to be optimized. Our approach formal…