Pith. sign in

REVIEW 2 cited by

Adaptive Quantum Computation, Constant Depth Quantum Circuits and Arthur-Merlin Games

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv quant-ph/0205133 v6 pith:MT7N2VAP submitted 2002-05-21 quant-ph cs.CC

Barbara M. Terhal , David P. DiVincenzo This is my paper · ORCID
classification quant-phcs.CC
keywords quantumcircuitsclassicallyconstantdepthaccuracyadaptivearthur-merlin
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We present evidence that there exist quantum computations that can be carried out in constant depth, using 2-qubit gates, that cannot be simulated classically with high accuracy. We prove that if one can simulate these circuits classically efficiently then the complexity class BQP is contained in AM.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Unlocking the power of global quantum gates with machine learning

    quant-ph 2025-02 conditional novelty 6.0 of 10

    Finite-depth circuits made of global CZ/CX gates and single-qubit rotations can approximate ground states of Heisenberg and toric code Hamiltonians in variational training.

  2. Double categories for adaptive quantum computation

    quant-ph 2025-10 conditional novelty 5.0 of 10

    The paper unifies circuit, MBQC, magic-state, and Pauli measurement models as double categories, with quantum information horizontal and classical control vertical, and recasts the contextual-fraction bound on computi...

Pith tools