Universal resources for quantum computing

Cites Work

Title not available (Why is that?)
Quantum entanglement
Universal Quantum Simulators
Exponential algorithmic speedup by a quantum walk
Title not available (Why is that?)
Proposed Experiment to Test Local Hidden-Variable Theories
Efficient quantum algorithms for simulating sparse Hamiltonians
Completely positive linear maps on complex matrices
The role of the ℓ₁-norm in quantum information theory and two types of the Yang–Baxter equation
Quantum algorithms revisited
Quantum Complexity Theory
Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
Title not available (Why is that?)
On the role of entanglement in quantum-computational speed-up
Universal Blind Quantum Computation
Limit on Nonlocality in Any World in Which Communication Complexity Is Not Trivial
Finitely correlated states on quantum spin chains
Duality quantum computer and the efficient quantum simulations
Universal quantum computation with ideal Clifford gates and noisy ancillas
Title not available (Why is that?)
Duality quantum computing and duality quantum information processing
Quantum circuits cannot control unknown operations
Non-abelian anyons and topological quantum computation
The density-matrix renormalization group in the age of matrix product states
The sheaf-theoretic structure of non-locality and contextuality
Quantum computational capability of a 2D valence bond solid phase
Linear transformations which preserve trace and positive semidefiniteness of operators
Universal Computation by Multiparticle Quantum Walk
Negativity and Contextuality are Equivalent Notions of Nonclassicality
Matrix product state representations
On complexity of the quantum Ising model
Quantum advantage with shallow circuits
PEPS as ground states: degeneracy and topology
Hudson’s theorem for finite-dimensional quantum systems
Complexity classification of local Hamiltonian problems
The resource theory of stabilizer quantum computation
Negative quasi-probability as a resource for quantum computation
A quantum computer only needs one universe
Fast universal quantum computation with railroad-switch local Hamiltonians
Revisiting the simulation of quantum Turing machines by quantum circuits
Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
Time independent universal computing with spin chains: quantum plinko machine
Translationally invariant universal quantum Hamiltonians in 1D
Universal quantum Hamiltonians
Bounds on Instantaneous Nonlocal Quantum Computation
No nonlocal box is universal
An overview of quantum cellular automata
Coherence makes quantum systems ‘magical’
Title not available (Why is that?)
Universal quantum computation by scattering in the Fermi–Hubbard model
A prototype of quantum von Neumann architecture
Quantum plug n' play: modular computation in the quantum regime

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)