Publication:2736498

From MaRDI portal


zbMath0977.81005arXivquant-ph/9807006MaRDI QIDQ2736498

Daniel Gottesman

Publication date: 10 September 2001

Full work available at URL: https://arxiv.org/abs/quant-ph/9807006


81P68: Quantum computation


Related Items

Transforming graph states using single-qubit operations, Topological quantum memory, Unnamed Item, Unnamed Item, From the Bloch Sphere to Phase-Space Representations with the Gottesman–Kitaev–Preskill Encoding, Unnamed Item, A Full Dichotomy for $\hol^{c}$, Inspired by Quantum Computation, Quantum Fault Tolerance in Systems with Restricted Control, Unnamed Item, Quantum chaos and circuit parameter optimization, Mathematical etudes on quantum computation, Quantum computation of phase transition in interacting scalar quantum field theory, Lattice surgery translation for quantum computation, A separable, dynamically local ontological model of quantum mechanics, What is quantum information?, Dual-code quantum computation model, A new protocol for constructing nonlocal \(n\)-qubit controlled-\(U\) gates, A scheme for realizing a distant two-qubit controlled-U gate with nearest qubit-qubit interaction, Unifying typical entanglement and coin tossing: on randomization in probabilistic theories, A quantum computer only needs one universe, Correlation measures and the entanglement wedge cross-section after quantum quenches in two-dimensional conformal field theories, Nonlocality and information flow: the approach of Deutsch and Hayden, A one-way quantum amplifier for long-distance quantum communication, Efficient classical simulation of the Deutsch-Jozsa and Simon's algorithms, Clifford gates in the Holant framework, Secure multiparty quantum secret sharing with the collective eavesdropping-check character, Time-space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2, Knots, links, and long-range magic, Schur-Weyl duality for the Clifford group with applications: property testing, a robust Hudson theorem, and de Finetti representations, Quantum statistical mechanics of encryption: reaching the speed limit of classical block ciphers, Dynamics of atomic magic in the Jaynes-Cummings model, Classical simulation of quantum circuits by half Gauss sums, Detecting magic states via characteristic functions, Constructions for quantum indistinguishability obfuscation, The discrete center-of-mass tomogram, The decomposition of an arbitrary \(2^w \times 2^w\) unitary matrix into signed permutation matrices, On the satisfiability of quantum circuits of small treewidth, Exponential decay of correlations implies area law, A Fully Fault-Tolerant Representation of Quantum Circuits, How to efficiently select an arbitrary Clifford group element, Can a Quantum Computer Run the von Neumann Architecture?, On the Satisfiability of Quantum Circuits of Small Treewidth, Unnamed Item, Irreversibility and entanglement spectrum statistics in quantum circuits, Topological quantum error correction in the Kitaev honeycomb model