quantum computation in nLab
In quantum information theory and quantum computing, by a q-bit (or qubit) one means a quantum state in a 2-dimensional complex Hilbert space of states.
Discussion of quantum measurements in terms of quantum information theory via dagger-compact categories, by Frobenius algebra-structures and the ...
quantum complexity theory in nLab
Ethan Bernstein, Umesh Vazirani, Quantum Complexity Theory, Siam Journal of Computation 26 5 (1997) 1411-1473 [doi:10.1137/S0097539796300921, ...
Quantum Computation on an Arbitrary Topological Space
Quantum computation is usually implemented on finite discrete sets, and the purpose of this study is to extend this to theories on arbitrary ...
1. Idea ... In quantum physics and specifically in quantum information theory, by quantum parallelism one means the property — to the extent that ...
Quantum Information Meets Quantum Matter in nLab
Quantum information meets quantum matter from quantum entanglement to topological phases of many-body systems.
In quantum computing and quantum information theory, the notion of quantum random access memory (QRAM, due to Giovanetti, Lloyd & Maccone 2008) ...
How Quantum Computers Calculate Everything At Once… But Can't ...
Quantum computers are so fast because they can calculate all possible paths at the same time, thus beating out classical computers.
In mathematics, the term quantum topology is used for the low-dimensional topology (such as knot theory) and related algebra (such as quantum ...
quantum error correction in nLab
This makes large scale quantum computation so difficult as to be practically impossible unless error correction methods are used. Indeed, before quantum error ...
quantum information theory via string diagrams -- references in nLab
The observation that a natural language for quantum information theory and quantum computation, specifically for quantum circuit diagrams, is ...
quantum adiabatic theorem in nLab
The adiabatic parameter-action on ground states of (topologically ordered) quantum materials is one model for quantum computation, see at ...
Samson Abramsky, Ross Duncan, A Categorical Quantum Logic, Mathematical Structures in Computer Science, Volume 16, Issue 3 (2006) pp. 469 - 489 ...
Center for Quantum and Topological Systems in nLab
We seek to verify the ZX-calculus, a powerful tool for representing and reasoning about quantum computation. ZX-diagrams are typically represented as adjacency- ...
Samson Abramsky, Bob Coecke, §2 in: A categorical semantics of quantum protocols, Proceedings of the 19th IEEE conference on Logic in Computer ...
Benoît Valiron, A functional programming language for quantum computation with classical control, MSc thesis, University of Ottawa (2004) [doi: ...
superconducting qbits -- references in nLab
On realizing qbits and quantum gates (hence quantum computation) via quantum states of magnetic flux through (Josephson junctions in) ...
Often one is interested in the case that the parameter set B B here is a finite set (explicitly so in applications to quantum information theory ...
nondeterministic computation in nLab
The only difference for quantum computation is that quantum data types are linear types, so that the relevant reader monad here is a linear ...
quantum probability theory in nLab
Quantum probability theory shows that “wave function collapse” is just part of the formula for conditional expectation values in quantum ...