output
20192026
most citedInformation Scrambling in Computationally Complex Quantum Circuits

304 citations

Showing 2023Show all

5 papers · 1 filter

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…