REVIEW 3 cited by
Non-Identity Check Remains QMA-Complete for Short Circuits
Not yet reviewed by Pith; the record is open.
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
abstract
The Non-Identity Check problem asks whether a given a quantum circuit is far away from the identity or not. It is well known that this problem is QMA-Complete \cite{JWB05}. In this note, it is shown that the Non-Identity Check problem remains QMA-Complete for circuits of short depth. Specifically, we prove that for constant depth quantum circuit in which each gate is given to at least $\Omega(\log n)$ bits of precision, the Non-Identity Check problem is QMA-Complete. It also follows that the hardness of the problem remains for polylogarithmic depth circuit consisting of only gates from any universal gate set and for logarithmic depth circuit using some specific universal gate set.
Forward citations
Cited by 3 Pith papers
-
Q-Sylvan: A Parallel Decision Diagram Package for Quantum Computing
Q-Sylvan parallelizes edge-valued decision diagrams for quantum circuit simulation and equivalence checking, reaching up to 18x speedup on 64 cores on certain circuit classes.
-
Predicting symmetries of quantum dynamics with optimal samples
Optimal failure probabilities for detecting identity, diagonal, and real symmetries of unknown qubit unitaries are exactly computed and achieved by parallel strategies.
-
Position: Quantum Program Generation Must Prioritize Validity Over Probabilistic Scaling
The paper argues that probabilistic scaling alone cannot fix the validity gap in quantum circuit generation, so quantum code assistants must build verification into generation rather than filter outputs after the fact.
Discussion (0). Continue with ORCID to comment.