Cites work
- A prototype of quantum von Neumann architecture
- A quantum computer only needs one universe
- An overview of quantum cellular automata
- Bounds on Instantaneous Nonlocal Quantum Computation
- Coherence makes quantum systems 'magical'
- Completely positive linear maps on complex matrices
- Complexity classification of local Hamiltonian problems
- Duality quantum computer and the efficient quantum simulations
- Duality quantum computing and duality quantum information processing
- Efficient quantum algorithms for simulating sparse Hamiltonians
- Exponential algorithmic speedup by a quantum walk
- Fast universal quantum computation with railroad-switch local Hamiltonians
- Finitely correlated states on quantum spin chains
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 5320183 (Why is no real title available?)
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 1776257 (Why is no real title available?)
- scientific article; zbMATH DE number 6131346 (Why is no real title available?)
- Hudson’s theorem for finite-dimensional quantum systems
- Limit on nonlocality in any world in which communication complexity is not trivial
- Linear transformations which preserve trace and positive semidefiniteness of operators
- Matrix product state representations
- Negative quasi-probability as a resource for quantum computation
- Negativity and Contextuality are Equivalent Notions of Nonclassicality
- No nonlocal box is universal
- Non-abelian anyons and topological quantum computation
- On complexity of the quantum Ising model
- On the role of entanglement in quantum-computational speed-up
- PEPS as ground states: degeneracy and topology
- Proposed experiment to test local hidden-variable theories
- Quantum advantage with shallow circuits
- Quantum algorithms revisited
- Quantum circuits cannot control unknown operations
- Quantum Complexity Theory
- Quantum computational capability of a 2D valence bond solid phase
- Quantum entanglement
- Quantum plug n' play: modular computation in the quantum regime
- Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
- Revisiting the simulation of quantum Turing machines by quantum circuits
- Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
- The density-matrix renormalization group in the age of matrix product states
- The resource theory of stabilizer quantum computation
- The role of the \(\ell_{1}\)-norm in quantum information theory and two types of the Yang-Baxter equation
- The sheaf-theoretic structure of non-locality and contextuality
- Time independent universal computing with spin chains: quantum plinko machine
- Translationally invariant universal quantum Hamiltonians in 1D
- Universal Blind Quantum Computation
- Universal computation by multiparticle quantum walk
- Universal quantum computation by scattering in the Fermi–Hubbard model
- Universal quantum computation with ideal Clifford gates and noisy ancillas
- Universal quantum Hamiltonians
- Universal Quantum Simulators
Cited in
(3)
This page was built for publication: Universal resources for quantum computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6497895)
