REVIEW 9 cited by
A Simple Proof that Toffoli and Hadamard are Quantum Universal
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
read the original abstract
Recently Shi proved that Toffoli and Hadamard are universal for quantum computation. This is perhaps the simplest universal set of gates that one can hope for, conceptually; It shows that one only needs to add the Hadamard gate to make a 'classical' set of gates quantum universal. In this note we give a few lines proof of this fact relying on Kitaev's universal set of gates, and discuss the meaning of the result.
Forward citations
Cited by 9 Pith papers
-
On the Complexity of the Circuit Width Problem
Deciding circuit width w(f) ≤ k for degree-3 polynomials with no constant term is NP-complete, with 49/48-ε inapproximability, ETH lower bounds, and FPT algorithms.
-
A sharp interaction-degree threshold for simulating QAOA
There is a sharp threshold at interaction degree 3 where classical sampling from depth-1 QAOA becomes hard enough to collapse the polynomial hierarchy, contrasting with efficient simulation at degree 2 for logarithmic depth.
-
Ancilla-Error-Transparent Controlled Beam Splitter Gate
Proposal for an ancilla-error-transparent controlled beam splitter gate implemented via Kerr-cat qubits in circuit QED.
-
Realified tensor networks: quantum circuit simulation on real-valued matrix accelerators
A graph rewrite maps complex tensor networks to real ones with proven arithmetic overhead at most 3x and measured speedups on real-only NPUs.
-
From Pauli Strings to Quantum Dynamics: A Unified Characterization
Develops an invariant-based framework connecting Pauli Lie algebras to transvection-generated Clifford subgroups for quantum reachability and dynamics analysis.
-
No-Go Theorem on Fault Tolerant Gadgets for Multiple Logical Qubits
No stabilizer code can implement the full logical Clifford group on multiple logical qubits using transversal gates, fold-transversal gates beyond two qubits, or code automorphisms.
-
Engineering long-range and multi-body interactions via global kinetic constraints
A driven Bose-Hubbard model with global density-density interactions induces tunable global kinetic constraints for efficient implementation of multi-body gates and entangled states.
-
AutoQ 2.0: From Verification of Quantum Circuits to Verification of Quantum Programs (Technical Report)
AutoQ 2.0 verifies quantum programs with classical control flow and successfully checks RUS algorithms instantly plus weak-measurement Grover search on 100 qubits in about 20 minutes.
-
Practical Fidelity Limits of Toffoli Gates in Superconducting Quantum Processors
Benchmarking a decomposed Toffoli gate on IBM quantum hardware yields 56-64% state fidelities, but the claimed state-dependent error pattern is confounded by using different devices.
Discussion (0). Sign in to comment.