Image de couverture de livre

Limits to black-box amplification in QMA

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Aaronson, Scott, Harris, Phillip, Witteveen, Freek
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

${\sf QMA}={\sf QMA}_1$ with an infinite counter
par: Jeffery, Stacey, et autres
Publié: (2025)

A random purification channel for arbitrary symmetries with applications to fermions and bosons
par: Walter, Michael, et autres
Publié: (2025)

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

Approximate QCAs in one dimension using approximate algebras
par: Ranard, Daniel, et autres
Publié: (2026)

Computational complexity of injective projected entangled pair states
par: Harley, Dylan, et autres
Publié: (2025)

Fun with replicas: tripartitions in tensor networks and gravity
par: Penington, Geoff, et autres
Publié: (2022)

Randomized truncation of quantum states
par: Harrow, Aram W., et autres
Publié: (2025)

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

Adiabatic preparation of many-body quantum states: getting the beginning and ending right
par: Pedersen, Emil T. M., et autres
Publié: (2025)

Quantum 2-SAT on low dimensional systems is $\mathsf{QMA}_1$-complete: Direct embeddings and black-box simulation
par: Rudolph, Dorian, et autres
Publié: (2024)

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

The resource theory of tensor networks
par: Christandl, Matthias, et autres
Publié: (2023)

Random tensor networks with nontrivial links
par: Cheng, Newton, et autres
Publié: (2022)

Gapped Clique Homology on weighted graphs is $\text{QMA}_1$-hard and contained in $\text{QMA}$
par: King, Robbie, et autres
Publié: (2023)

Phase estimation with partially randomized time evolution
par: Günther, Jakob, et autres
Publié: (2025)

Clique Homology is QMA1-hard
par: Crichigno, Marcos, et autres
Publié: (2022)

QMA vs. QCMA and Pseudorandomness
par: Liu, Jiahui, et autres
Publié: (2024)

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

Two bases suffice for QMA1-completeness
par: Ma, Henry, et autres
Publié: (2025)

Superposition detection and QMA with non-collapsing measurements
par: Bassirian, Roozbeh, et autres
Publié: (2024)

Oracle separation of QMA and QCMA with bounded adaptivity
par: Ben-David, Shalev, et autres
Publié: (2024)

A distribution testing oracle separation between QMA and QCMA
par: Natarajan, Anand, et autres
Publié: (2022)

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

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

Is it Gaussian? Testing bosonic quantum states
par: Girardi, Filippo, et autres
Publié: (2025)

Towards a universal gateset for $\mathsf{QMA}_1$
par: Rudolph, Dorian
Publié: (2024)

phase2: Full-State Vector Simulation of Quantum Time Evolution at Scale
par: Miller, Marek, et autres
Publié: (2025)

A Relativizing MIP for BQP
par: Aaronson, Scott, et autres
Publié: (2026)

The rotation-invariant Hamiltonian problem is QMA$_{\rm EXP}$-complete
par: Nelson, Jon, et autres
Publié: (2025)

Fermionic Independent Set and Laplacian of an independence complex are QMA-hard
par: Rayudu, Chaithanya
Publié: (2024)

Toward Separating QMA from QCMA with a Classical Oracle
par: Zhandry, Mark
Publié: (2024)

Public-Key Quantum Authentication and Digital Signature Schemes Based on the QMA-Complete Problem
par: Liu, Le-Ran, et autres
Publié: (2025)

Testing the presence of balanced and bipartite components in a sparse graph is QMA1-hard
par: Incudini, Massimiliano, et autres
Publié: (2024)

Separating QMA from QCMA with a classical oracle
par: Bostanci, John, et autres
Publié: (2025)

SyQMA: A memory-efficient, symbolic and exact universal simulator for quantum error correction
par: Umbrarescu, George, et autres
Publié: (2026)

QMA Complete Quantum-Enhanced Kyber: Provable Security Through CHSH Nonlocality
par: Cherkaoui, Ilias, et autres
Publié: (2025)

En Route to a Standard QMA1 vs. QCMA Oracle Separation
par: Miloschewsky, David, et autres
Publié: (2026)

Succinct arguments for QMA from standard assumptions via compiled nonlocal games
par: Metger, Tony, et autres
Publié: (2024)

Genuine certifiable randomness from a black-box
par: McGuinness, Liam P.
Publié: (2026)

Limits of privacy amplification against non-signalling memory attacks
par: Arnon, Rotem, et autres
Publié: (2012)