The global transverse-field Ising model with non-monotonic time-dependent transverse field is polynomially equivalent to the gate model of quantum computation.
Giurgica-Tiron, Efficient universal quantum compilation: An inverse-free Solovay-Kitaev al- gorithm (2021), arXiv:2112.02040 [quant-ph]
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
quant-ph 3representative citing papers
Stochastic Commutator Synthesis integrates sub-cubic Solovay-Kitaev with Gibbs-sampled commutator selection and randomized compilation to cut T-counts by 10-25% and raise fidelity by up to 35% on Forrelation circuits.
Introduces QCO and T-QCO measures and numerically shows that the T gate is non-optimal for completing the Clifford set among order-8 gates.
citing papers explorer
-
Polynomial equivalence of the global transverse-field Ising model and the gate model of quantum computation
The global transverse-field Ising model with non-monotonic time-dependent transverse field is polynomially equivalent to the gate model of quantum computation.
-
Sub-Cubic Quantum Gate Synthesis via Stochastic Commutator Decomposition
Stochastic Commutator Synthesis integrates sub-cubic Solovay-Kitaev with Gibbs-sampled commutator selection and randomized compilation to cut T-counts by 10-25% and raise fidelity by up to 35% on Forrelation circuits.
-
Quantum Circuit Overhead
Introduces QCO and T-QCO measures and numerically shows that the T gate is non-optimal for completing the Clifford set among order-8 gates.