16 citations · 37 across the 23 of their papers we have counts for
20 papers · 1 filter
When are bosonic Gaussian states classical to learn?
Senrui Chen, Antonio Anna Mele, Francesco Anna Mele +1
A fundamental question in physics is: When does classical behavior emerge from quantum systems? Bosonic Gaussian states provide a natural setting to explore this quantum-classical…
Universal equilibrium magic in quantum many-body systems
Soumyadeep Sarma, Tobias Haug, John Preskill +1
Thermalization conventionally describes local properties of isolated many-body systems at equilibrium. Magic, or nonstabilizerness $\unicode{x2013}$ the resource enabling universal…
Near-optimal quantum metrology with few-qubit measurements
Liang Mao, Senrui Chen, Hsin-Yuan Huang +2
Quantum metrology, which addresses parameter estimation in quantum systems, has broad applications across science and technology. Conventional metrology protocols for multi-qubit s…
High-rate qLDPC processors
Aditya Bhardwaj, Muzhou Ma, Nadine Meister +6
Despite significant progress on quantum low-density parity-check (qLDPC) codes, building qLDPC processors that are high-rate, high-throughput, hardware-friendly, and fast-to-decode…
State preparation and detection for quantum simulation of particle collisions
Federica Maria Surace, Sary Bseiso, John Preskill
Simulating the real-time dynamics of particle collisions is a promising application of quantum simulators, because classical methods such as tensor networks struggle to capture the…
Observation of gravity-like signatures in holographic codes on a quantum computer
Debopriyo Biswas, Gong Cheng, Krishnanand Karthikeyan +12
The unification of quantum mechanics and general relativity remains one of the major open problems of theoretical physics. The Anti-de Sitter/Conformal Field Theory (AdS/CFT) corre…
Exponential quantum advantage in processing massive classical data
Haimeng Zhao, Alexander Zlokapa, Hartmut Neven +4
Broadly applicable quantum advantage, particularly in classical data processing and machine learning, has been a fundamental open problem. In this work, we prove that a small quant…
Shor's algorithm is possible with as few as 10,000 reconfigurable atomic qubits
Madelyn Cain, Qian Xu, Robbie King +6
Quantum computers have the potential to perform computational tasks beyond the reach of classical machines. A prominent example is Shor's algorithm for integer factorization and di…
What resources are needed for optimal learning of bosonic Gaussian states?
Senrui Chen, Francesco Anna Mele, Marco Fanizza +5
Continuous-variable systems enable key quantum technologies in computation, communication, and sensing. Bosonic Gaussian states emerge naturally in various such applications, inclu…
Nature is stingy: Universality of Scrooge ensembles in quantum many-body systems
Wai-Keong Mok, Tobias Haug, Wen Wei Ho +1
Recent advances in quantum simulators allow direct experimental access to ensembles of pure states generated by measuring part of an isolated quantum many-body system. These projec…
Batched high-rate logical operations for quantum LDPC codes
Qian Xu, Hengyun Zhou, Dolev Bluvstein +5
High-rate quantum LDPC (qLDPC) codes reduce memory overhead by densely packing many logical qubits into a single block of physical qubits. Here we extend this concept to high-rate…
Mind the gaps: The fraught road to quantum advantage
Jens Eisert, John Preskill
Quantum computing is advancing rapidly, yet substantial gaps separate today's noisy intermediate-scale quantum (NISQ) devices from tomorrow's fault-tolerant application-scale quant…
Transversal dimension jump for product qLDPC codes
Christine Li, John Preskill, Qian Xu
We introduce transversal dimension jump, a code-switching protocol for lifted product (LP) quantum low-density parity-check (qLDPC) codes across different chain-complex dimensions,…
The vast world of quantum advantage
Hsin-Yuan Huang, Soonwon Choi, Jarrod R. McClean +1
The quest to identify quantum advantages lies at the heart of quantum technology. While quantum devices promise extraordinary capabilities, from exponential computational speedups…
Simple and efficient end-to-end quantum thermal and ground state preparation
Zhiyan Ding, Yongtao Zhan, John Preskill +1
Quantum computing algorithms for many-body physics, chemistry and materials science typically require the preparation of thermal or ground states for a given Hamiltonian. We propos…
Digital quantum simulations of scattering in quantum field theories using W states
Roland C. Farrell, Nikita A. Zemlevskiy, Marc Illa +1
High-energy particle collisions can convert energy into matter through the inelastic production of new particles. Quantum computers are an ideal platform for simulating the out-of-…
Rapid quantum ground state preparation via dissipative dynamics
Yongtao Zhan, Zhiyan Ding, Jakob Huhn +4
Inspired by natural cooling processes, dissipation has become a promising approach for preparing low-energy states of quantum systems. However, the potential of dissipative protoco…
Observable and computable entanglement in time
Alexey Milekhin, Zofia Adamska, John Preskill
We propose a novel family of entanglement measures for time-separated subsystems. Our definitions are applicable to any quantum system, continuous or discrete. To illustrate their…
Resilience of the surface code to error bursts
Shi Jie Samuel Tan, Christopher A. Pattison, Matt McEwen +1
Quantum error correction works effectively only if the error rate of gate operations is sufficiently low. However, some rare physical mechanisms can cause a temporary increase in t…
Efficient soft-output decoders for the surface code
Nadine Meister, Christopher A. Pattison, John Preskill
Decoders that provide an estimate of the probability of a logical failure conditioned on the error syndrome ("soft-output decoders") can reduce the overhead cost of fault-tolerant…