:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Aaronson, Scott, Harris, Phillip, Witteveen, Freek
Format:	Preprint
Published:	2025
Subjects:	Quantum Physics
Online Access:	https://arxiv.org/abs/2509.21131
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

${\sf QMA}={\sf QMA}_1$ with an infinite counter
by: Jeffery, Stacey, et al.
Published: (2025)

A random purification channel for arbitrary symmetries with applications to fermions and bosons
by: Walter, Michael, et al.
Published: (2025)

PDQMA = DQMA = NEXP: QMA With Hidden Variables and Non-collapsing Measurements
by: Aaronson, Scott, et al.
Published: (2024)

Approximate QCAs in one dimension using approximate algebras
by: Ranard, Daniel, et al.
Published: (2026)

Computational complexity of injective projected entangled pair states
by: Harley, Dylan, et al.
Published: (2025)

Fun with replicas: tripartitions in tensor networks and gravity
by: Penington, Geoff, et al.
Published: (2022)

Randomized truncation of quantum states
by: Harrow, Aram W., et al.
Published: (2025)

Why Philosophers Should Care About Computational Complexity
by: Aaronson, Scott
Published: (2011)

Adiabatic preparation of many-body quantum states: getting the beginning and ending right
by: Pedersen, Emil T. M., et al.
Published: (2025)

On verifiable quantum advantage with peaked circuit sampling
by: Aaronson, Scott, et al.
Published: (2024)

Quantum 2-SAT on low dimensional systems is $\mathsf{QMA}_1$-complete: Direct embeddings and black-box simulation
by: Rudolph, Dorian, et al.
Published: (2024)

The resource theory of tensor networks
by: Christandl, Matthias, et al.
Published: (2023)

Random tensor networks with nontrivial links
by: Cheng, Newton, et al.
Published: (2022)

Phase estimation with partially randomized time evolution
by: Günther, Jakob, et al.
Published: (2025)

Gapped Clique Homology on weighted graphs is $\text{QMA}_1$-hard and contained in $\text{QMA}$
by: King, Robbie, et al.
Published: (2023)

Clique Homology is QMA1-hard
by: Crichigno, Marcos, et al.
Published: (2022)

QMA vs. QCMA and Pseudorandomness
by: Liu, Jiahui, et al.
Published: (2024)

A Qubit, a Coin, and an Advice String Walk Into a Relational Problem
by: Aaronson, Scott, et al.
Published: (2023)

The Acrobatics of BQP
by: Aaronson, Scott, et al.
Published: (2021)

Improved separation between quantum and classical computers for sampling and functional tasks
by: Marshall, Simon C., et al.
Published: (2024)

Is it Gaussian? Testing bosonic quantum states
by: Girardi, Filippo, et al.
Published: (2025)

phase2: Full-State Vector Simulation of Quantum Time Evolution at Scale
by: Miller, Marek, et al.
Published: (2025)

Two bases suffice for QMA1-completeness
by: Ma, Henry, et al.
Published: (2025)

Superposition detection and QMA with non-collapsing measurements
by: Bassirian, Roozbeh, et al.
Published: (2024)

Oracle separation of QMA and QCMA with bounded adaptivity
by: Ben-David, Shalev, et al.
Published: (2024)

A Relativizing MIP for BQP
by: Aaronson, Scott, et al.
Published: (2026)

A distribution testing oracle separation between QMA and QCMA
by: Natarajan, Anand, et al.
Published: (2022)

Towards a universal gateset for $\mathsf{QMA}_1$
by: Rudolph, Dorian
Published: (2024)

The minimal canonical form of a tensor network
by: Acuaviva, Arturo, et al.
Published: (2022)

The rotation-invariant Hamiltonian problem is QMA$_{\rm EXP}$-complete
by: Nelson, Jon, et al.
Published: (2025)

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

Toward Separating QMA from QCMA with a Classical Oracle
by: Zhandry, Mark
Published: (2024)

Separating QMA from QCMA with a classical oracle
by: Bostanci, John, et al.
Published: (2025)

High ground state overlap via quantum embedding methods
by: Erakovic, Mihael, et al.
Published: (2024)

Public-Key Quantum Authentication and Digital Signature Schemes Based on the QMA-Complete Problem
by: Liu, Le-Ran, et al.
Published: (2025)

Testing the presence of balanced and bipartite components in a sparse graph is QMA1-hard
by: Incudini, Massimiliano, et al.
Published: (2024)

QMA Complete Quantum-Enhanced Kyber: Provable Security Through CHSH Nonlocality
by: Cherkaoui, Ilias, et al.
Published: (2025)

En Route to a Standard QMA1 vs. QCMA Oracle Separation
by: Miloschewsky, David, et al.
Published: (2026)

Succinct arguments for QMA from standard assumptions via compiled nonlocal games
by: Metger, Tony, et al.
Published: (2024)

SyQMA: A memory-efficient, symbolic and exact universal simulator for quantum error correction
by: Umbrarescu, George, et al.
Published: (2026)