The following pages link to (Q2736498):
Displaying 50 items.
- A separable, dynamically local ontological model of quantum mechanics (Q262338) (← links)
- What is quantum information? (Q341587) (← links)
- Dual-code quantum computation model (Q496911) (← links)
- A new protocol for constructing nonlocal \(n\)-qubit controlled-\(U\) gates (Q552874) (← links)
- A scheme for realizing a distant two-qubit controlled-U gate with nearest qubit-qubit interaction (Q637717) (← links)
- Unifying typical entanglement and coin tossing: on randomization in probabilistic theories (Q694995) (← links)
- A quantum computer only needs one universe (Q720555) (← links)
- Correlation measures and the entanglement wedge cross-section after quantum quenches in two-dimensional conformal field theories (Q780723) (← links)
- Nonlocality and information flow: the approach of Deutsch and Hayden (Q816122) (← links)
- A one-way quantum amplifier for long-distance quantum communication (Q1679287) (← links)
- Efficient classical simulation of the Deutsch-Jozsa and Simon's algorithms (Q1700378) (← links)
- Clifford gates in the Holant framework (Q1786604) (← links)
- Secure multiparty quantum secret sharing with the collective eavesdropping-check character (Q1937247) (← links)
- Time-space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2 (Q1993901) (← links)
- Knots, links, and long-range magic (Q2032516) (← links)
- Schur-Weyl duality for the Clifford group with applications: property testing, a robust Hudson theorem, and de Finetti representations (Q2041634) (← links)
- Quantum statistical mechanics of encryption: reaching the speed limit of classical block ciphers (Q2092793) (← links)
- Dynamics of atomic magic in the Jaynes-Cummings model (Q2110993) (← links)
- Classical simulation of quantum circuits by half Gauss sums (Q2113488) (← links)
- Detecting magic states via characteristic functions (Q2113994) (← links)
- Constructions for quantum indistinguishability obfuscation (Q2146070) (← links)
- The discrete center-of-mass tomogram (Q2197042) (← links)
- The decomposition of an arbitrary \(2^w \times 2^w\) unitary matrix into signed permutation matrices (Q2199344) (← links)
- On the satisfiability of quantum circuits of small treewidth (Q2411047) (← links)
- Exponential decay of correlations implies area law (Q2514213) (← links)
- A Fully Fault-Tolerant Representation of Quantum Circuits (Q2822503) (← links)
- How to efficiently select an arbitrary Clifford group element (Q2939214) (← links)
- Can a Quantum Computer Run the von Neumann Architecture? (Q3000932) (← links)
- On the Satisfiability of Quantum Circuits of Small Treewidth (Q3194714) (← links)
- Irreversibility and entanglement spectrum statistics in quantum circuits (Q3301832) (← links)
- Topological quantum error correction in the Kitaev honeycomb model (Q3303154) (← links)
- (Q3385629) (← links)
- Transforming graph states using single-qubit operations (Q4561771) (← links)
- Topological quantum memory (Q4832736) (← links)
- From the Bloch Sphere to Phase-Space Representations with the Gottesman–Kitaev–Preskill Encoding (Q4964356) (← links)
- (Q5014779) (← links)
- (Q5089155) (← links)
- A Full Dichotomy for $\hol^{c}$, Inspired by Quantum Computation (Q5096443) (← links)
- (Q5121909) (← links)
- Quantum Fault Tolerance in Systems with Restricted Control (Q5170188) (← links)
- (Q5856401) (← links)
- Quantum chaos and circuit parameter optimization (Q5878228) (← links)
- Mathematical etudes on quantum computation (Q6049765) (← links)
- Quantum computation of phase transition in interacting scalar quantum field theory (Q6089520) (← links)
- Lattice surgery translation for quantum computation (Q6100236) (← links)
- Two-round quantum homomorphic encryption scheme based on matrix decomposition (Q6176968) (← links)
- The quantum density matrix and its many uses. From quantum structure to quantum chaos and noisy simulators (Q6190112) (← links)
- Graphical CSS Code Transformation Using ZX Calculus (Q6200518) (← links)
- Complexity of quantum circuits via sensitivity, magic, and coherence (Q6564161) (← links)
- Complexity growth and the Krylov-Wigner function (Q6568267) (← links)
