Calculable lower bounds on the efficiency of universal sets of quantum gates

DOI10.1088/1751-8121/ACBD24MaRDI QIDQ5880295zbMATH OpenOpenAlexFDO

Authors Oskar Słowik, A. Sawicki

Publication date 7 March 2023

Published in Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2201.11774

zbMATH Keywords

averaging operatorsquantum circuitsquantum computingquantum gatesquantum gates efficiencyspectral gapt-designs

Mathematics Subject Classification ID

Computer science (68-XX) Quantum theory (81-XX)

Recommendations

• Efficient Universal Quantum Circuits
• Deciding universality of quantum gates
• Efficient discrete approximations of quantum gates
• scientific article; zbMATH DE number 5666680
• Upper Bounds on the Noise Threshold for Fault-Tolerant Quantum Computing

Cites work

• A spectral gap theorem in SU(d)
• Efficient discrete approximations of quantum gates
• Epsilon-Nets, Unitary Designs, and Random Quantum Circuits
• Fault-tolerant quantum computation by anyons
• Fault-Tolerant Quantum Computation with Constant Error Rate
• Hecke operators and distributing points on S². II
• Hecke operators and distributing points on the sphere I
• scientific article; zbMATH DE number 1302567 (Why is no real title available?)
• scientific article; zbMATH DE number 1776257 (Why is no real title available?)
• On the spectral gap for finitely-generated subgroups of \(\text{SU}(2)\)
• Practical Approximation of Single-Qubit Unitaries by Single-Qubit Quantum Clifford and T Circuits
• Random walks in compact groups
• Symmetric Random Walks on Groups
• Universality of single-qudit gates

Cited in

(6)

• Universal Sets of Quantum Information Processing Primitives and their optimal use
• Efficient discrete approximations of quantum gates
• The Power of Few Qubits and Collisions – Subset Sum Below Grover’s Bound
• Bounds on Threshold Gate Realizability
• Linear programming with unitary-equivariant constraints
• Fundamental solutions of the heat equation on unitary groups establish an improved relation between -nets and approximate unitary t-designs

This page was built for publication: Calculable lower bounds on the efficiency of universal sets of quantum gates

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5880295)