REVIEW 6 cited by
Elementary gates for quantum computation
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
We show that a set of gates that consists of all one-bit quantum gates (U(2)) and the two-bit exclusive-or gate (that maps Boolean values $(x,y)$ to $(x,x \oplus y)$) is universal in the sense that all unitary operations on arbitrarily many bits $n$ (U($2^n$)) can be expressed as compositions of these gates. We investigate the number of the above gates required to implement other gates, such as generalized Deutsch-Toffoli gates, that apply a specific U(2) transformation to one input bit if and only if the logical AND of all remaining input bits is satisfied. These gates play a central role in many proposed constructions of quantum computational networks. We derive upper and lower bounds on the exact number of elementary gates required to build up a variety of two-and three-bit quantum gates, the asymptotic number required for $n$-bit Deutsch-Toffoli gates, and make some observations about the number required for arbitrary $n$-bit unitary operations.
Forward citations
Cited by 6 Pith papers
-
PhD thesis: Modes, States, and Symmetries in quantum Optics for quantum Information and Metrology
Modal structure, photon statistics, and bosonic/phase symmetries jointly determine the usable resources for photonic quantum information and metrology, with explicit gains and limits for time-frequency, HOM, and SSR settings.
-
Constraint-Aware Quantum Optimization of Defect Configurations in Doped ZrO2: XY-Mixer QAOA and Grover Adaptive Search
Presents an end-to-end constraint-aware quantum optimization pipeline using XY-mixer QAOA and Grover Adaptive Search for low-energy defect configurations in doped ZrO2, with QAOA validated against exact enumeration on...
-
Quantum Algorithms for Jet Clustering
Thrust can be computed in O(N^2) time with a Grover-based quantum algorithm under a sequential data-loading model, and in O(N^2 log N) time classically with sorting, but the quantum advantage is only formal for very r...
-
Number-Theoretic Characterizations of Some Restricted Clifford+T Circuits
Unitaries over the rings Z[1/2], Z[1/√2], Z[1/i√2], and Z[1/2,i] are exactly the circuits over four Clifford+T-derived gate sets.
-
Quantum simulating multi-particle processes in high energy nuclear physics: dijet production and color (de)coherence
A quantum-circuit framework maps partonic cross-sections for multi-particle QCD processes in media, benchmarked on dipole formation and antenna radiation at leading order.
-
Quantum similarity learning for anomaly detection
A hybrid Transformer-quantum circuit similarity-learning network reaches AUC 96.1% on simulated di-Higgs anomaly detection, slightly above a classical baseline, with clustering mitigating shot noise.
Discussion (0). Continue with ORCID to comment.