Image de couverture de livre

Demonstrating an unconditional separation between quantum and classical information resources

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Kretschmer, William, Grewal, Sabee, DeCross, Matthew, Gerber, Justin A., Gilmore, Kevin, Gresh, Dan, Hunter-Jones, Nicholas, Mayer, Karl, Neyenhuis, Brian, Hayes, David, Aaronson, Scott
Format:	Preprint
Publié:	2025
Sujets:	Quantum Physics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Unentanglement and Post-Measurement Branching in Quantum Interactive Proofs
par: Grewal, Sabee, et autres
Publié: (2025)

The Entangled Quantum Polynomial Hierarchy Collapses
par: Grewal, Sabee, et autres
Publié: (2024)

Probing critical states of matter on a digital quantum computer
par: Haghshenas, Reza, et autres
Publié: (2023)

Improved Stabilizer Estimation via Bell Difference Sampling
par: Grewal, Sabee, et autres
Publié: (2023)

Efficient Learning of Quantum States Prepared With Few Non-Clifford Gates II: Single-Copy Measurements
par: Grewal, Sabee, et autres
Publié: (2023)

Low-Stabilizer-Complexity Quantum States Are Not Pseudorandom
par: Grewal, Sabee, et autres
Publié: (2022)

Efficient Learning of Quantum States Prepared With Few Non-Clifford Gates
par: Grewal, Sabee, et autres
Publié: (2023)

Agnostic Tomography of Stabilizer Product States
par: Grewal, Sabee, et autres
Publié: (2024)

Pseudoentanglement Ain't Cheap
par: Grewal, Sabee, et autres
Publié: (2024)

PDQMA = DQMA = NEXP: QMA With Hidden Variables and Non-collapsing Measurements
par: Aaronson, Scott, et autres
Publié: (2024)

Breaking even with magic: demonstration of a high-fidelity logical non-Clifford gate
par: Dasu, Shival, et autres
Publié: (2025)

Efficient Learning of Structured Quantum Circuits via Pauli Dimensionality and Sparsity
par: Grewal, Sabee, et autres
Publié: (2025)

On the Pure Quantum Polynomial Hierarchy and Quantified Hamiltonian Complexity
par: Grewal, Sabee, et autres
Publié: (2025)

Improved separation between quantum and classical computers for sampling and functional tasks
par: Marshall, Simon C., et autres
Publié: (2024)

A Qubit, a Coin, and an Advice String Walk Into a Relational Problem
par: Aaronson, Scott, et autres
Publié: (2023)

Computability Theory of Closed Timelike Curves
par: Aaronson, Scott, et autres
Publié: (2016)

Improved Circuit Lower Bounds and Quantum-Classical Separations
par: Grewal, Sabee, et autres
Publié: (2024)

The Acrobatics of BQP
par: Aaronson, Scott, et autres
Publié: (2021)

Fault-Tolerant One-Bit Addition with the Smallest Interesting Colour Code
par: Wang, Yang, et autres
Publié: (2023)

Less Quantum, More Advantage: An End-to-End Quantum Algorithm for the Jones Polynomial
par: Laakkonen, Tuomas, et autres
Publié: (2025)

Characterizing a non-equilibrium phase transition on a quantum computer
par: Chertkov, Eli, et autres
Publié: (2022)

Why Philosophers Should Care About Computational Complexity
par: Aaronson, Scott
Publié: (2011)

Topological Order from Measurements and Feed-Forward on a Trapped Ion Quantum Computer
par: Iqbal, Mohsin, et autres
Publié: (2023)

Nearly Time-Optimal Pure State Tomography with Pauli Measurements
par: Grewal, Sabee, et autres
Publié: (2026)

Wide Neural Networks as a Baseline for the Computational No-Coincidence Conjecture
par: Dunbar, John, et autres
Publié: (2025)

Testing GPT-4 with Wolfram Alpha and Code Interpreter plug-ins on math and science problems
par: Davis, Ernest, et autres
Publié: (2023)

On verifiable quantum advantage with peaked circuit sampling
par: Aaronson, Scott, et autres
Publié: (2024)

Benchmarking logical three-qubit quantum Fourier transform encoded in the Steane code on a trapped-ion quantum computer
par: Mayer, Karl, et autres
Publié: (2024)

Evidence of Scaling Advantage for the Quantum Approximate Optimization Algorithm on a Classically Intractable Problem
par: Shaydulin, Ruslan, et autres
Publié: (2023)

100 Claves para comprender Oriente proximo / Alain Gresh y Dominique Vidal con la colaboracion de Emmanuelle Pauly ; traducción de Godofredo Gonz lez
par: Gresh, Alain

Experimental Demonstration of Break-Even for the Compact Fermionic Encoding
par: Nigmatullin, Ramil, et autres
Publié: (2024)

Experiments with the 4D Surface Code on a QCCD Quantum Computer
par: Berthusen, Noah, et autres
Publié: (2024)

Limits to black-box amplification in QMA
par: Aaronson, Scott, et autres
Publié: (2025)

Reconciling Rigor and Reach: The Impact of Hybrid Followership Scholarship
par: Stephanie C. Gresh
Publié: (2026)

Introdução à seção temática: Estratégias e práticas alimentares de famílias agrícolas multilocalizadas e os papéis das políticas públicas
par: Sandrine Fréguin-Gresh
Publié: (2020)

Blended Conditional Gradients: the unconditioning of conditional gradients
par: Braun, Gábor, et autres
Publié: (2018)

Demonstration of quantum computation and error correction with a tesseract code
par: Reichardt, Ben W., et autres
Publié: (2024)

Sparsity and Out-of-Distribution Generalization
par: Aaronson, Scott, et autres
Publié: (2026)

Fully optimised variational simulation of a dynamical quantum phase transition on a trapped-ion quantum computer
par: Gover, Lesley, et autres
Publié: (2025)

Nonlocal Games as Cross-Platform Quantum Benchmarks: Exceeding unconditional classical bounds on trapped-ion processors
par: Than, Anton T., et autres
Publié: (2026)