Skip to main content
Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Code code:"if (foo != bar)"
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Saves in:saves
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with
Search options not deleted user 2152

A computation model which relies on quantum-mechanic phenomena, such as entanglement and superposition. This generalizes the probabilistic model of computation.

4 votes
Accepted

Controlled NOT gate a type of measurement?

A controlled-NOT gate is meant to be a reversible operation which, for ordered pairs of bits $(a,b) \in \{0,1\}^2$, performs the operation $$ \mathrm{CNOT} (a,b)\; = \;(a, b \oplus a)$$ where conventi …
Niel de Beaudrap's user avatar
5 votes
Accepted

Why $\theta/2$ in common qubit representation?

Short diagrammatic answer. Because states which are orthogonal as vectors, are represented as antipodal points on the Bloch sphere — orthogonal states of qubits are as far from each other as possible …
Niel de Beaudrap's user avatar
3 votes

Quantum computing 'amplitudes'

The state of a qubit, or of a collection of qubits, is given by a state vector. However, most people would say that the output of a quantum computer is in fact the result of a measurement, which trans …
Niel de Beaudrap's user avatar
3 votes

The difference between a bit and a Qubit

Here is the crux of the matter. what I don't understand is how it can be anything other then 0 or 1. This is actually a physics question in disguise, but I think that this forum is still a good …
Niel de Beaudrap's user avatar
8 votes
Accepted

Quantum algorithms and quantum computation

This is more-or-less a reasonable description of quantum computation. A few remarks are in order: Regarding "quantum parallelism": Quantum computers can process a massive amount of operations in …
Niel de Beaudrap's user avatar
5 votes
Accepted

Help need to learn Quantum Computation and Information

I haven't watched them myself, but you could probably do worse than Michael Nielsen's videos, Quantum Computing for the Determined. I'd recommend also that you look online for written lecture notes; …
Niel de Beaudrap's user avatar
8 votes
Accepted

Origin of quantum complexity theory

The class BQP (see also Complexity Zoo: BQP) was defined by E. Bernstein and U. Vazirani. Quantum complexity theory. SIAM Journal on Computing 26, pp. 1411-1473 (1997). The class QMA (see also Co …
Niel de Beaudrap's user avatar
10 votes

References on comparison between quantum computers and Turing machines

What is actually the case is that anything a quantum computer can compute, a Turing machine can also compute. (This is without commenting at all on how long it takes the Turing machine to compute the …
Niel de Beaudrap's user avatar
16 votes

What is the difference between quantum TM and nondetermistic TM?

On the meaning of nondeterminism There are two different meanings of 'nondeterminism' at issue here. Quantum mechanics is usually described as being "not deterministic", but the word "nondeterministi …
Niel de Beaudrap's user avatar