scientific article
From MaRDI portal
Publication:2736498
zbMath0977.81005arXivquant-ph/9807006MaRDI QIDQ2736498
No author found.
Publication date: 10 September 2001
Full work available at URL: https://arxiv.org/abs/quant-ph/9807006
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (48)
Constructions for quantum indistinguishability obfuscation ⋮ What is quantum information? ⋮ On the Satisfiability of Quantum Circuits of Small Treewidth ⋮ Transforming graph states using single-qubit operations ⋮ Topological quantum memory ⋮ How to efficiently select an arbitrary Clifford group element ⋮ On the satisfiability of quantum circuits of small treewidth ⋮ Unnamed Item ⋮ A one-way quantum amplifier for long-distance quantum communication ⋮ A Full Dichotomy for $\hol^{c}$, Inspired by Quantum Computation ⋮ Mathematical etudes on quantum computation ⋮ Quantum computation of phase transition in interacting scalar quantum field theory ⋮ Secure multiparty quantum secret sharing with the collective eavesdropping-check character ⋮ Lattice surgery translation for quantum computation ⋮ The discrete center-of-mass tomogram ⋮ Two-round quantum homomorphic encryption scheme based on matrix decomposition ⋮ The decomposition of an arbitrary \(2^w \times 2^w\) unitary matrix into signed permutation matrices ⋮ The quantum density matrix and its many uses. From quantum structure to quantum chaos and noisy simulators ⋮ Efficient classical simulation of the Deutsch-Jozsa and Simon's algorithms ⋮ Graphical CSS Code Transformation Using ZX Calculus ⋮ A scheme for realizing a distant two-qubit controlled-U gate with nearest qubit-qubit interaction ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Can a Quantum Computer Run the von Neumann Architecture? ⋮ Irreversibility and entanglement spectrum statistics in quantum circuits ⋮ Topological quantum error correction in the Kitaev honeycomb model ⋮ Dual-code quantum computation model ⋮ Time-space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2 ⋮ Unifying typical entanglement and coin tossing: on randomization in probabilistic theories ⋮ Quantum Fault Tolerance in Systems with Restricted Control ⋮ A new protocol for constructing nonlocal \(n\)-qubit controlled-\(U\) gates ⋮ Unnamed Item ⋮ A quantum computer only needs one universe ⋮ Clifford gates in the Holant framework ⋮ Knots, links, and long-range magic ⋮ Exponential decay of correlations implies area law ⋮ Schur-Weyl duality for the Clifford group with applications: property testing, a robust Hudson theorem, and de Finetti representations ⋮ From the Bloch Sphere to Phase-Space Representations with the Gottesman–Kitaev–Preskill Encoding ⋮ Unnamed Item ⋮ A Fully Fault-Tolerant Representation of Quantum Circuits ⋮ Correlation measures and the entanglement wedge cross-section after quantum quenches in two-dimensional conformal field theories ⋮ 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 ⋮ Nonlocality and information flow: the approach of Deutsch and Hayden ⋮ Quantum chaos and circuit parameter optimization ⋮ A separable, dynamically local ontological model of quantum mechanics
This page was built for publication:
