Pseudo-Random Circuits from Clifford Plus T-Gates
arXiv:1309.3943 · doi:10.1103/PhysRevA.88.062303
Abstract
We explore the implementation of pseudo-random single-qubit rotations and multi-qubit pseudo-random circuits constructed only from Clifford gates and the T-gate, a phase rotation of pi/4. Such a gate set would be appropriate for computations performed in a fault tolerant setting. For single-qubit rotations the distribution of parameters found for unitaries constructed from Clifford plus T quickly approaches that of random rotations and require significantly fewer gates than the construction of arbitrary single-qubit rotations. For Clifford plus T pseudo-random circuits we find an exponential convergence to a random matrix element distribution and a Gaussian convergence to the higher order moments of the matrix element distribution. These convergence rates are insensitive to the number of qubits.
4 pages, 3 figures
References in corpus (15)
- Robust randomized benchmarking of quantum processes
- Randomizing quantum states: Constructions and applications
- Symmetrised Characterisation of Noisy Quantum Processes
- Superdense coding of quantum states
- Remote preparation of quantum states
- Asymptotically optimal approximation of single qubit unitaries by Clifford and T circuits using a constant number of ancillary qubits
- Emergence of typical entanglement in two-party random processes
- A Depth-Optimal Canonical Form for Single-qubit Quantum Circuits
- A State Distillation Protocol to Implement Arbitrary Single-qubit Rotations
- Optimal two-qubit gate for generation of random bipartite entanglement
- Parameters of Pseudo-Random Quantum Circuits
- Optimising the Solovay-Kitaev algorithm
- Quantum pseudo-randomness from cluster-state quantum computation
- Formation of Multipartite Entanglement Using Random Quantum Gates
- Random circuits by measurements on weighted graph states