Efficient Simulation of Random Quantum States and Operators

Abstract

We investigate the generation of quantum states and unitary operations that are ``random'' in certain respects. We show how to use such states to estimate the average fidelity, an important measure in the study of implementations of quantum algorithms. We re-discover the result that the states of a maximal set of mutually-unbiased bases serve this purpose. An efficient circuit is presented that generates an arbitrary state out of such a set. Later on, we consider unitary operations that can be used to turn any quantum channel into a depolarizing channel. It was known before that the Clifford group serves this and a related purpose, and we show that these are actually the same. We also show that a small subset of the Clifford group is already sufficient to accomplish this. We conclude with an efficient construction of the elements of that subset. This thesis is based on joint work with Richard Cleve, Joseph Emerson, and Etera Livine.

University of Waterloo MMath Thesis, 167 pages, double-sided

References in corpus (1)

• Information-disturbance tradeoff in quantum measurement on the uniform ensemble and on the mutually unbiased bases

Cited by in corpus (27)

• Black holes as mirrors: quantum information in random subsystems
• Characterizing Quantum Gates via Randomized Benchmarking
• Fidelity of quantum operations
• Multiqubit Clifford groups are unitary 3-designs
• Unitary designs and codes
• Random quantum circuits are approximate unitary $t$-designs in depth $O\left(n{t}^{5+o(1)}\right)$
• Asymptotic theory of quantum channel estimation
• Decoupling with unitary approximate two-designs
• Operator fidelity susceptibility: an indicator of quantum criticality
• Entanglement Reactivation in Separable Environments
• Entanglement, quantum randomness, and complexity beyond scrambling
• Permutation Symmetry Determines the Discrete Wigner Function
• Transitions in entanglement complexity in random quantum circuits by measurements
• Quantum authentication with key recycling
• Pauli error estimation via Population Recovery
• Closed-form analytic expressions for shadow estimation with brickwork circuits
• The distribution of quantum fidelities
• Mutually unbiased bases as minimal Clifford covariant 2-designs
• Quantum machine learning with glow for episodic tasks and decision games
• Pseudo-randomness and Learning in Quantum Computation
• Selective and Efficient Quantum Process Tomography in Arbitrary Finite Dimension
• Trade-off between Gradient Measurement Efficiency and Expressivity in Deep Quantum Neural Networks
• On the average-case complexity of learning output distributions of quantum circuits
• On construction of finite averaging sets for $SL(2,\mathbb{C})$ via its Cartan decomposition
• Clifford groups are not always 2-designs
• Approximate Private Quantum Channels
• Fermionic Averaged Circuit Eigenvalue Sampling