REVIEW 7 cited by
Qudit Gate Decomposition Dependence for Lattice Gauge Theories
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
In this work, we investigate the effect of decomposition basis on primitive qudit gates on superconducting radio-frequency cavity-based quantum computers with applications to lattice gauge theory. Three approaches are tested: SNAP & Displacement gates, ECD & single-qubit rotations $R(\theta,\phi)$, and optimal pulse control. For all three decompositions, implementing the necessary sequence of rotations concurrently rather then sequentially can reduce the primitive gate run time. The number of blocks required for the faster ECD & $R_p(\theta)$ is found to scale $\mathcal{O}(d^2)$, while slower SNAP & Displacement set scales at worst $\mathcal{O}(d)$. For qudits with $d<10$, the resulting gate times for the decompositions is similar, but strongly-dependent on experimental design choices. Optimal control can outperforms both decompositions for small $d$ by a factor of 2-12 at the cost of higher classical resources. Lastly, we find that SNAP & Displacement are slightly more robust to a simplified noise model.
Forward citations
Cited by 7 Pith papers
-
Non-Abelian dynamics on a cube: improving quantum compilation through qudit-based simulations
A qudit-based circuit for SU(2) lattice gauge theory on a cube, with improved decompositions for uniformly-controlled rotations and new elementary-gate resource estimates.
-
Noise-Directed Adaptive Remapping for Integer Optimization: from qubits to (encoded) qudits
NDAR, a heuristic that turns device noise into a resource, is generalized to integer-domain optimization; qudit-native encodings are argued to be the best fit because their all-zeros attractor is always feasible and t...
-
Fault-Tolerant Resource Comparison of Qudit and Qubit Encodings for Diagonal Quadratic Operators
The paper derives explicit finite-d break-even synthesis costs for qudit vs. qubit encodings of diagonal quadratic operators in product-formula and LCU simulations, identifying low-d regions where qudits yield savings.
-
Probing Hadron Scattering in Lattice Gauge Theories on Qudit Quantum Computers
Proposed qudit circuits simulate meson-antimeson scattering in a spin-1 U(1) lattice gauge theory and remain accurate under realistic dephasing and depolarization noise.
-
Efficient Qudit Circuit for Quench Dynamics of $2+1$D Quantum Link Electrodynamics
A matter-integrated-out reformulation of 2+1D U(1) quantum link electrodynamics is translated into explicit qudit circuits, with Trotterized simulations matching exact dynamics on small lattices.
-
Ultracoherent superconducting cavity-based multiqudit platform with error-resilient control
Demonstrates a two-mode SRF cavity platform with 20.6 ms and 15.6 ms lifetimes, error-resilient sideband control, Fock state preparation up to n=20 with >95% post-selected fidelity, and a virtual Raman beamsplitter wi...
-
Buildings for Synthesis with Clifford+R
An explicit tree is proposed for the qutrit Clifford+R gate set as a new proof of the known ring characterization, but the tree's degree structure is miscomputed.
Discussion (0). Continue with ORCID to comment.