Corpus ID: 237491734

Constructing Approximately Diagonal Unitary Gates

@inproceedings{Griffin2021ConstructingAD,
  title={Constructing Approximately Diagonal Unitary Gates},
  author={Colton Griffin and Shawn X. Cui},
  year={2021}
}
  • Colton Griffin, Shawn X. Cui
  • Published 10 September 2021
  • Physics, Mathematics
Abstract. We study a method of producing approximately diagonal 1-qubit gates. For each positive integer, the method provides a sequence of gates that are defined iteratively from a fixed diagonal gate and an arbitrary gate. These sequences are conjectured to converge to diagonal gates doubly exponentially fast and are verified for small integers. We systemically study this conjecture and prove several important partial results. Some techniques are developed to pave the way for a final… Expand

References

SHOWING 1-10 OF 13 REFERENCES
Asymptotically Optimal Topological Quantum Compiling
TLDR
The problem of compiling quantum operations into braid representations for non-Abelian quasiparticles described by the Fibonacci anyon model is addressed and a probabilistically polynomial algorithm is developed that approximates any given single-qubit unitary to a desired precision by an asymptotically depth-optimal braid pattern. Expand
Systematically generated two-qubit anyon braids
Fibonacci anyons are non-Abelian particles for which braiding is universal for quantum computation. Reichardt has shown how to systematically generate nontrivial braids for three Fibonacci anyonsExpand
The Solovay-Kitaev algorithm
TLDR
The algorithm can be used to compile Shor's algorithm into an efficient fault-tolerant form using only Hadamard, controlled-not, and π/8 gates, and is generalized to apply to multi-qubit gates and togates from SU(d). Expand
A Modular Functor Which is Universal¶for Quantum Computation
Abstract:We show that the topological modular functor from Witten–Chern–Simons theory is universal for quantum computation in the sense that a quantum circuit computation can be efficientlyExpand
Quantum algorithm for approximating partition functions
We achieve a quantum speed-up of fully polynomial randomized approximation schemes (FPRAS) for estimating partition functions that combine simulated annealing with the Monte-Carlo Markov Chain methodExpand
Fixed-point quantum search.
  • Lov K. Grover
  • Computer Science, Medicine
  • Physical review letters
  • 2005
TLDR
By replacing the selective inversions by selective phase shifts of pi/3, the algorithm preferentially converges to the target state irrespective of the step size or number of iterations, this feature leads to robust search algorithms and also to new schemes for quantum control and error correction. Expand
Systematic distillation of composite Fibonacci anyons using one mobile quasiparticle
  • B. Reichardt
  • Physics, Computer Science
  • Quantum Inf. Comput.
  • 2012
TLDR
It is shown how to simulate universal quantum computation by braiding one quasiparticle and with only one measurement, to read out the result. Expand
Quantum error correction of systematic errors using a quantum search framework
Composite pulses are a quantum control technique for canceling out systematic control errors. We present a different composite pulse sequence inspired by quantum search. Our technique can correct aExpand
The Search For Leakage-free Entangling Fibonacci Braiding Gates
It is an open question if there are leakage-free entangling Fibonacci braiding gates. We provide evidence to the conjecture for the negative in this paper. We also found a much simpler protocol toExpand
An Algebraic Identity Leading to Wilson Theorem
In most text books on number theory Wilson Theorem is proved by applying Lagrange theorem concerning polynomial congruences.Hardy and Wright also give a proof using cuadratic residues. In thisExpand
...
1
2
...