Quantum computing Flashcards
What is a T gate?
A pi/4 z rotation
1 0
0 e^-ipi/4
What is a Toffoli gate?
A contolled- controlled not
Why must a balance be acheived in reversible computing?
Reversible computing uses no energy but is infinitely slow.
Quantum parallelism =
when an input state is in a superposition an operator will calculate the output for all parts of the superposition. n bits in the input register means 2^n calculations.
The Divencenzo criteria
- Qubits - must be well defined and scalable
- Initialisation
- Decorehence time - must be long
- Universal logic - must be able to do single and two qubit operations
- Measurement - must be qubit specific
- Convert stationary and flying qubits
- Transmit flying qubits faithmally
Queen Isabelle Doesnt Understand My Cool Thing
Deutch’s problem =
to determine the parity of an unknown function
Sketch Deutch’s algorithm
Sketch networks for the four possible binary functions (lower bit is output)
Find the two qubit hadamard gate
1 1 1 1
1 -1 1 -1
1 1 -1 -1
1 -1 -1 1
Simplify
H -.-H
|
H-X-H
What is Grover’s problem?
Want to find the sole input that returns 1 in the fewest possible queries.
Sketch Grover’s network in the case n=2
Note that the final 3 qubit gate has hollow circle - applies when both qubits are 0, not 1
Why can’t a qubit be driven back to its correct value in the same way as a classical bit can be (3)?
- Qubit can be in superposition - what would you drive it back to?
- Driving process would be dissipative and thus non unitary.
- Can’t measure state without destroying it - must only measure error.
Differnce between error correction and decoherence free subspaces
Error correction works for non correlated errors, DFS for totally correlated errors.
How does a decherence free subspace work?
Choose code-word eigenstates which are unaffected by errors likey to occur
ie to protect against Z errors use psi, to protect aginst X errors use phi bell states
What is the function of the Deutsch-Jozsa algorithm?
Identifies whether a state is balanced or constant (but not mixed) in the fewest possible queries (can do it in one).
Sketch the D-J network for n=2
How are ions trapped in an ion trap quantum computer?
Trap ions using time-varying field (think saddle analogy).
One possible configuration is the linear Pauli trap - use strong fields to confine in X-Y plane and then allow ions to line up according to their mutual electrostatic repulsion.
How are atoms trapped in an atomic quantum computer (3 techniques)
Optical mollasesses - use 6 lasers (2 along each axis) with a frequency below that of a transition. Only atoms travelling towards a laser will absorb the light and thus experience a change in momemtum. This also allows you to cool the atoms.
Dipole forces - treat atoms like prisms which have a refractive index. They will experience a force when a light is shone on them.
Optical eggbox - use standing waves. The wells represent areas of low potential. Wells are shallow -> atoms must be very cold.
How are atoms initialised?
Use lasers to excite electrons away from all states except |0>. This relies on random relaxation. Don’t need to worry about stimulated emission as relaxation is rapid.