What is possible to do with noisy quantum computers?
|
|
- Cornelia Barnett
- 5 years ago
- Views:
Transcription
1 What is possible to do with noisy quantum computers? Decoherence, inaccuracy and errors in Quantum Information Processing Sara Felloni and Giuliano Strini Dipartimento di Informatica Sistemistica e Comunicazione Milano Bicocca Sara Felloni and Giuliano Strini, May 28, 27 Noisy Quantum Computation - p. /58
2 Decoherence, Errors and s Quantum Error Models Evolution of a Single-qubit Density Matrix 2 Single-qubit Noise Channels Parameters /5 Parameters 2/5 Parameters 3/5 Parameters 4/5 Parameters 5/5 of a Quantum Simulator for the Schrödinger Equation of a Quantum Entanglement Purification Protocol Sara Felloni and Giuliano Strini, May 28, 27 Noisy Quantum Computation - p. 2/58
3 Decoherence, Errors and s Decoherence, Errors and s Quantum Error Models Evolution of a Single-qubit Density Matrix 2 Single-qubit Noise Channels Parameters /5 Parameters 2/5 Parameters 3/5 Parameters 4/5 Parameters 5/5 of a Quantum Simulator for the Schrödinger Equation of a Quantum Entanglement Purification Protocol Studies of the impact of noise on the stability of quantum computation and communication protocols are of primary importance for practical implementations. Qubits unavoidably interact with the external world (decoherence). Under realistic conditions, in every experimental implementation, quantum operations are unavoidably affected by errors. Noise thresholds for computations on sufficiently small - nonetheless useful - quantum computers will benefit experimental research. Theoretical studies in literature offer very much lower noise thresholds which are necessary for longer quantum simulations. Sara Felloni and Giuliano Strini, May 28, 27 Noisy Quantum Computation - p. 3/58
4 Quantum Error Models Decoherence, Errors and s Quantum Error Models Evolution of a Single-qubit Density Matrix 2 Single-qubit Noise Channels Parameters /5 Parameters 2/5 Parameters 3/5 Parameters 4/5 Parameters 5/5 of a Quantum Simulator for the Schrödinger Equation of a Quantum Entanglement Purification Protocol Single-qubit error models that can be currently found in literature only consider 2 well known parameters: t Decay (displacement along the z axis) t 2 Decoherence (bit flip channel) These 2 parameters are far from being sufficient to give a complete and realistic description of a general experimental situation. The general single-qubit error model presented here provides a description of all physically possible single-qubit errors. This description is based on density matrices and Kraus operators. Its efficiency allows to include all the single-qubit errors, thus describing the quantum systems under experimentally realistic conditions. Sara Felloni and Giuliano Strini, May 28, 27 Noisy Quantum Computation - p. 4/58
5 Evolution of a Single-qubit Density Matrix Decoherence, Errors and s Quantum Error Models Evolution of a Single-qubit Density Matrix 2 Single-qubit Noise Channels Parameters /5 Parameters 2/5 Parameters 3/5 Parameters 4/5 Parameters 5/5 of a Quantum Simulator for the Schrödinger Equation According to the Kraus representation, the most general evolution of a single-qubit density matrix is: F i ρf i F i F i = I ρ = i Density matrices can be expressed by means of Pauli operators σ: ρ [I + λ σ] 2 This leads to an affine transformation: λ = M λ + c i of a Quantum Entanglement Purification Protocol Sara Felloni and Giuliano Strini, May 28, 27 Noisy Quantum Computation - p. 5/58
6 2 Decoherence, Errors and s Quantum Error Models Evolution of a Single-qubit Density Matrix 2 Single-qubit Noise Channels Parameters /5 Parameters 2/5 Parameters 3/5 Parameters 4/5 Parameters 5/5 of a Quantum Simulator for the Schrödinger Equation of a Quantum Entanglement Purification Protocol 2 parameters are needed to characterize a generic quantum noise operation acting on a single qubit. Decomposing M in diagonal and orthogonal matrices: M = O DO T a geometric interpretation of the 2 parameters can be given by associating each parameter to a transformation of the Bloch sphere representing the qubit s state: 3 : Rotations of the Bloch sphere about the axes x, y or z; 3 : Displacements of the Bloch sphere along the same axes; 3 : Deformations of the Bloch sphere into an ellipsoid, with x, y or z as symmetry axes; 3 : Deformations of the Bloch sphere into an ellipsoid with symmetry axis along an arbitrary direction. Sara Felloni and Giuliano Strini, May 28, 27 Noisy Quantum Computation - p. 6/58
7 Measurement of the Error Parameters /5 Decoherence, Errors and s Quantum Error Models Evolution of a Single-qubit Density Matrix 2 Single-qubit Noise Channels Parameters /5 Parameters 2/5 Parameters 3/5 Parameters 4/5 Parameters 5/5 Single-qubit density matrix tranformation: X a a 2 a 3 X Y = a 2 a 22 a 23 Y Z a 3 a 32 a 33 Z + Measurements of the final density matrix with suitable choice of the initial state allow to measure each of the 2 parameters. c c 2 c 3 of a Quantum Simulator for the Schrödinger Equation of a Quantum Entanglement Purification Protocol Sara Felloni and Giuliano Strini, May 28, 27 Noisy Quantum Computation - p. 7/58
8 Measurement of the Error Parameters 2/5 Decoherence, Errors and s Quantum Error Models Evolution of a Single-qubit Density Matrix 2 Single-qubit Noise Channels Parameters /5 Parameters 2/5 Parameters 3/5 Parameters 4/5 Parameters 5/5 of a Quantum Simulator for the Schrödinger Equation of a Quantum Entanglement Purification Protocol Since [ C C ] [ C C the following equations hold: ] = [ C 2 C C C C C 2 C C = 2 (X iy ) C 2 = 2 ( + Z) C 2 = ( Z) 2 The initial state: { C = C = leads to the system of equations: { X = a 3 + c Y = a 23 + c 2 Z = a 33 + c 3 X = Y = Z = ] Sara Felloni and Giuliano Strini, May 28, 27 Noisy Quantum Computation - p. 8/58
9 Measurement of the Error Parameters 3/5 Decoherence, Errors and s Quantum Error Models Evolution of a Single-qubit Density Matrix 2 Single-qubit Noise Channels Parameters /5 Parameters 2/5 Parameters 3/5 Parameters 4/5 Parameters 5/5 of a Quantum Simulator for the Schrödinger Equation A second initial state: { C = C = leads to a different system of equations: { X = a 3 + c Y = a 23 + c 2 Z = a 33 + c 3 X = Y = Z = These 6 equations determine 6 out of the 2 parameters. of a Quantum Entanglement Purification Protocol Sara Felloni and Giuliano Strini, May 28, 27 Noisy Quantum Computation - p. 9/58
10 Measurement of the Error Parameters 4/5 Decoherence, Errors and s Quantum Error Models Evolution of a Single-qubit Density Matrix 2 Single-qubit Noise Channels Parameters /5 Parameters 2/5 Parameters 3/5 Parameters 4/5 Parameters 5/5 of a Quantum Simulator for the Schrödinger Equation A third initial state: C = C = 2 { leads to the system of equations: X = a + c Y = a 2 + c 2 Z = a 3 + c 3 X = Y = Z = and 3 further measurements determine the coefficients a i ; i =, 2, 3. of a Quantum Entanglement Purification Protocol Sara Felloni and Giuliano Strini, May 28, 27 Noisy Quantum Computation - p. /58
11 Measurement of the Error Parameters 5/5 Decoherence, Errors and s Quantum Error Models Evolution of a Single-qubit Density Matrix 2 Single-qubit Noise Channels Parameters /5 Parameters 2/5 Parameters 3/5 Parameters 4/5 Parameters 5/5 of a Quantum Simulator for the Schrödinger Equation Finally, the initial state: { C = 2 C = i 2 leads to the system of equations: X = a 2 + c Y = a 22 + c 2 Z = a 32 + c 3 { Y = X = Z = and 3 further measurements determine the coefficients a i2 ; i =, 2, 3. of a Quantum Entanglement Purification Protocol Thus all the 2 parameters are determined by means of 2 measurements. Sara Felloni and Giuliano Strini, May 28, 27 Noisy Quantum Computation - p. /58
12 Kraus Representation and Quantum Circuits /2 /2 Bit flip: Graphic Phase flip: Graphic Bit-phase flip: Graphic Displacements along +z semi axis Displacements along -z semi axis z Displacements: Graphic Displacements along ± x semi axes x Displacements: Graphic Displacements along ± y semi axes y Displacements: Graphic Sara Felloni and Giuliano Strini, May 28, 27 Noisy Quantum Computation - p. 2/58 Minimum Deformation for Displacement
13 Kraus Representation and Quantum Circuits Kraus Representation and Quantum Circuits /2 /2 Bit flip: Graphic Phase flip: Graphic Bit-phase flip: Graphic Displacements along +z semi axis Displacements along -z semi axis z Displacements: Graphic Displacements along ± x semi axes x Displacements: Graphic Displacements along ± y semi axes y Displacements: Graphic Sara Felloni and Giuliano Strini, May 28, 27 Noisy Quantum Computation - p. 3/58 Minimum Deformation for Displacement For each noise channel it is possible to provide: the Kraus representation the transformation of the Bloch sphere coordinates an equivalent quantum circuit leading to a unitary representation in an extended Hilbert space. A great advantage of these equivalent quantum circuits is that the evolution of the reduced density matrix describing the single-qubit system is automatically guaranteed to be completely positive.
14 Rotations of the Bloch /2 Kraus Representation and Quantum Circuits /2 /2 Bit flip: Graphic Phase flip: Graphic Bit-phase flip: Graphic Displacements along +z semi axis Displacements along -z semi axis z Displacements: Graphic Displacements along ± x semi axes x Displacements: Graphic Displacements along ± y semi axes y Displacements: Graphic Sara Felloni and Giuliano Strini, May 28, 27 Noisy Quantum Computation - p. 4/58 Minimum Deformation for Displacement Rotations through an angle θ about an arbitrary axis directed along the unit vector n are given by the operator: ( R n (θ) = cos θ ) ( I i sin θ ) nσ 2 2 Any generic rotation can be obtained by composing rotations about the axes x, y and z.
15 Rotations of the Bloch Rotations through an angle θ and corresponding transformations of the Bloch sphere coordinates: R x = R y = R z = [ [ [ cos θ 2 isin θ 2 isin θ 2 cos θ 2 cos θ 2 sin θ 2 sin θ 2 cos θ 2 cos θ 2 isin θ 2 cos θ 2 + isin θ 2 ] ] ] x = x y = cosθy sinθz z = sinθy + cos θz x = cosθx sinθz y = y z = sinθx + cosθz x = cosθ x sinθ y y = sinθ x + cosθ y z = z Sara Felloni and Giuliano Strini, May 28, 27 Noisy Quantum Computation - p. 5/58
16 Deformations of the Bloch /2 Kraus Representation and Quantum Circuits /2 /2 Bit flip: Graphic Phase flip: Graphic Bit-phase flip: Graphic Displacements along +z semi axis Displacements along -z semi axis z Displacements: Graphic Displacements along ± x semi axes x Displacements: Graphic Displacements along ± y semi axes y Displacements: Graphic Sara Felloni and Giuliano Strini, May 28, 27 Noisy Quantum Computation - p. 6/58 Minimum Deformation for Displacement The well known bit flip, phase flip and bit-phase flip channels correspond to deformations of the Bloch sphere into an ellipsoid. Bit flip x maps the Bloch sphere Phase flip into an ellipsoid z with symmetry axis Bit-phase flip y A single auxiliary qubit, initially prepared in the state ψ = cos θ 2 + sin θ 2 θ π is sufficient to obtain unitary representations for these noise channels.
17 Deformations of the Bloch Quantum circuits for deformations of the Bloch sphere: Bit flip Bit-phase flip Phase flip Corresponding transformations of the Bloch sphere coordinates: x = x y = cosθy z = cosθz x = cosθx y = y z = cosθz x = cos θx y = cosθy z = z Sara Felloni and Giuliano Strini, May 28, 27 Noisy Quantum Computation - p. 7/58
18 Bit flip: Graphic Action of the bit flip channel: θ = π 4, π Sara Felloni and Giuliano Strini, May 28, 27 Noisy Quantum Computation - p. 8/58
19 Phase flip: Graphic Action of the phase flip channel: θ = π 4, π Sara Felloni and Giuliano Strini, May 28, 27 Noisy Quantum Computation - p. 9/58
20 Bit-phase flip: Graphic Action of the bit-phase flip channel: θ = π 4, π Sara Felloni and Giuliano Strini, May 28, 27 Noisy Quantum Computation - p. 2/58
21 Displacements of the Bloch Kraus Representation and Quantum Circuits /2 /2 Bit flip: Graphic Phase flip: Graphic Bit-phase flip: Graphic Displacements along +z semi axis Displacements along -z semi axis z Displacements: Graphic Displacements along ± x semi axes x Displacements: Graphic Displacements along ± y semi axes y Displacements: Graphic Sara Felloni and Giuliano Strini, May 28, 27 Noisy Quantum Computation - p. 2/58 Minimum Deformation for Displacement A displacement of the center of the Bloch sphere must go with a deformation of the sphere. This is necessary for the resulting ρ to still represent a density matrix: the associated Bloch radius r must be r. This condition can be easily fulfilled by describing displacement channels by means of quantum circuits. Displacements of the center of the Bloch sphere along the +z axis can be seen as representative of zero temperature dissipation. Displacements of the center of the Bloch sphere along the -z axis can be seen as representative of thermal excitations. Displacements of the center of the Bloch sphere along the x,y axes are also considered.
22 Displacements along +z semi axis Kraus Representation and Quantum Circuits /2 /2 Bit flip: Graphic Phase flip: Graphic Bit-phase flip: Graphic Displacements along +z semi axis Displacements along -z semi axis z Displacements: Graphic Displacements along ± x semi axes x Displacements: Graphic Displacements along ± y semi axes y Displacements: Graphic Sara Felloni and Giuliano Strini, May 28, 27 Noisy Quantum Computation - p. 22/58 Minimum Deformation for Displacement This single-qubit quantum operation is also known as the amplitude damping channel. The Kraus operators and the corresponding transformation of the Bloch sphere coordinates are: [ ] [ ] F = cos θ F = sinθ x = cosθx y = cosθy z = sin 2 θ + cos 2 θz
23 Displacements along -z semi axis Kraus Representation and Quantum Circuits /2 /2 Bit flip: Graphic Phase flip: Graphic Bit-phase flip: Graphic Displacements along +z semi axis Displacements along -z semi axis z Displacements: Graphic Displacements along ± x semi axes x Displacements: Graphic Displacements along ± y semi axes y Displacements: Graphic Sara Felloni and Giuliano Strini, May 28, 27 Noisy Quantum Computation - p. 23/58 Minimum Deformation for Displacement The Kraus operators and the corresponding transformation of the Bloch sphere coordinates are: F = [ cosθ ] F = [ sinθ ] x = cosθx y = cosθy z = sin 2 θ + cos 2 θz
24 z Displacements: Graphic Displacement along +z and -z semi axes: θ = π 6, π 4, π Sara Felloni and Giuliano Strini, May 28, 27 Noisy Quantum Computation - p. 24/58
25 Displacements along ± x semi axes [ The unitary transformation U is described by U = 2 ± Kraus operators and transformation of the Bloch sphere coordinates: [ ] [ F = + cosθ ±( cos θ) 2 F = sinθ sin θ 2 ±( cosθ) + cosθ sinθ ± sinθ x = ± sin 2 θ + cos 2 θx y = cosθy z = cosθz ] ] Sara Felloni and Giuliano Strini, May 28, 27 Noisy Quantum Computation - p. 25/58
26 x Displacements: Graphic Displacement along +x and -x semi axes: θ = π 6, π 4, π Sara Felloni and Giuliano Strini, May 28, 27 Noisy Quantum Computation - p. 26/58
27 Displacements along ± y semi axes [ The unitary transformation U is described by U = 2 ±i ±i Kraus operators and transformation of the Bloch sphere coordinates: [ ] [ F = + cosθ ±i( cos θ) 2 F = ±isinθ sin θ 2 i( cosθ) + cosθ sinθ isin θ x = cosθx y = ± sin 2 θ + cos 2 θy z = cosθz ] ] Sara Felloni and Giuliano Strini, May 28, 27 Noisy Quantum Computation - p. 27/58
28 y Displacements: Graphic Displacement along +y and -y semi axes: θ = π 6, π 4, π Sara Felloni and Giuliano Strini, May 28, 27 Noisy Quantum Computation - p. 28/58
29 Minimum Deformation for Displacement Applying a displacement of the center of the Bloch sphere along the +z direction, the new center becomes Kraus Representation and Quantum Circuits /2 /2 Bit flip: Graphic Phase flip: Graphic Bit-phase flip: Graphic Displacements along +z semi axis Displacements along -z semi axis z Displacements: Graphic Displacements along ± x semi axes x Displacements: Graphic Displacements along ± y semi axes y Displacements: Graphic Sara Felloni and Giuliano Strini, May 28, 27 Noisy Quantum Computation - p. 29/58 Minimum Deformation for Displacement (,, b) < b < The Bloch sphere x 2 + y 2 + z 2 = is deformed into an ellipsoid with z as symmetry axis: x 2 + y 2 a 2 + [z ( b)]2 b 2 = Imposing a higher order tangency to the Bloch sphere: b = a 2 and defining a = cosθ ( < θ < π/2), the ellipse becomes: x 2 + y 2 cos 2 θ + (z sin2 θ) 2 cos 4 θ =
30 Minimum Deformation for Displacement Kraus Representation and Quantum Circuits /2 /2 Bit flip: Graphic Phase flip: Graphic Bit-phase flip: Graphic Displacements along +z semi axis Displacements along -z semi axis z Displacements: Graphic Displacements along ± x semi axes x Displacements: Graphic Displacements along ± y semi axes y Displacements: Graphic Sara Felloni and Giuliano Strini, May 28, 27 Noisy Quantum Computation - p. 3/58 Minimum Deformation for Displacement This equation corresponds to the minimum deformation required to the Bloch sphere in order to displace its center along the z-axis by b = sin 2 θ.
31 Error Model Applications A geometric interpretation of 9 out of the 2 parameters describing a generic single-qubit quantum operation has been given. 3 parameters correspond to x, y, z rotations; 3 to x, y, z displacements; 3 to x, y, z deformations of the Bloch sphere into an ellipsoid; the remaining 3 parameters correspond to deformations of the Bloch sphere into an ellipsoid with arbitrary symmetry axis, that can be obtained by combining the 9 previous quantum operations. This single-qubit error model can be applied to study quantum protocols stability under quantum noise effect:. A quantum simulator for the resolution of the Schrödinger equation 2. A quantum iterative entanglement purification protocol Sara Felloni and Giuliano Strini, May 28, 27 Noisy Quantum Computation - p. 3/58
32 of a Quantum Simulator for the Schrödinger Equation A Quantum Simulator Ideal Quantum Harmonic Oscillator and Error Distribution Wave Packet Graphic Representation Some Meaningful Examples /2 /2 /3 2/3 3/3 Conclusions Future Research Thanks! Sara Felloni and Giuliano Strini, May 28, 27 Noisy Quantum Computation - p. 32/58 of a Quantum Simulator for the Schrödinger Equation
33 A Quantum Simulator A quantum simulator for resolution of basic problems of quantum mechanics. of a Quantum Simulator for the Schrödinger Equation A Quantum Simulator Ideal Quantum Harmonic Oscillator and Error Distribution Wave Packet Graphic Representation Some Meaningful Examples /2 /2 /3 2/3 3/3 Conclusions Future Research Thanks! Sara Felloni and Giuliano Strini, May 28, 27 Noisy Quantum Computation - p. 33/58. How many qubits are necessary to simulate interesting dynamics? 2. How does the system work under quantum noise effects? Only 6 qubits are sufficient to build a useful quantum simulator. The exceptionally small number of qubits allows to include the single-qubit decoherence model and to describe the system by means of the density matrix representation. The tolerable noise threshold is much higher in respect to the theoretical noise threshold necessary for much longer quantum simulations in fault-tolerant quantum computation.
34 Ideal Quantum Harmonic Oscillator and Error Distribution Consider the quantum mechanical motion of a particle in one dimension, governed by the Schrödinger equation: of a Quantum Simulator for the Schrödinger Equation A Quantum Simulator Ideal Quantum Harmonic Oscillator and Error Distribution Wave Packet Graphic Representation Some Meaningful Examples /2 /2 /3 2/3 3/3 Conclusions Future Research Thanks! Sara Felloni and Giuliano Strini, May 28, 27 Noisy Quantum Computation - p. 34/58 i d ψ(x, t) = Hψ(x, t) dt where the Hamiltonian H is given by: H = H + V (x) = 2 2m d 2 dx 2 + V (x) Initial condition Gaussian wave packet of given width and center. Error distribution Uniform random distribution with maximum noise strenght fixed by the parameter θ. All kind of errors are applied to every single qubit, one by one.
35 Wave Packet Graphic Representation Horizontal axis: time-steps iterations Vertical axis: 64 states of the 6 qubit quantum simulator Gray shading: probability of the system being in the considered state Sara Felloni and Giuliano Strini, May 28, 27 Noisy Quantum Computation - p. 35/58
36 Some Meaningful Examples of a Quantum Simulator for the Schrödinger Equation A Quantum Simulator Ideal Quantum Harmonic Oscillator and Error Distribution Wave Packet Graphic Representation Some Meaningful Examples /2 /2 /3 2/3 3/3 Conclusions Future Research Thanks! Sara Felloni and Giuliano Strini, May 28, 27 Noisy Quantum Computation - p. 36/58 In order to illustrate the working of the 6 qubits quantum simulator, other significant examples have been considered: Harmonic oscillator A particle in a box Transmission through a barrier Notice that not all these examples are analytically solvable. 6 qubits are sufficient to treat complex and meaningful cases.
37 Rotations of the Bloch /2 Rotations and corresponding fidelities, relative to random errors with maximum noise strenght θ =.5, about: x axis y axis z axis Sara Felloni and Giuliano Strini, May 28, 27 Noisy Quantum Computation - p. 37/58
38 Rotations of the Bloch Table of the final fidelities, relative to random errors with maximum noise strenght θ =.5. Rotation q q q 2 q 3 q 4 q 5 U x U y U z The quality of the simulator s states is measured by the fidelity F : F = ψ ψ ψ ψ = ψ ψ 2 which measures the probability that an imperfect state would pass a test for being in the exact state. Fidelity decays are obtained from simulations of 4 time-step iterations. Notice that even with such high maximum noise strenght, θ =.5, the solution can be clearly detected by the plots. Sara Felloni and Giuliano Strini, May 28, 27 Noisy Quantum Computation - p. 38/58
39 Deformations of the Bloch /2 Deformations and corresponding fidelities, relative to random errors with maximum noise strenght θ: x axis θ =.2 y axis θ =.5 z axis θ =.3 Sara Felloni and Giuliano Strini, May 28, 27 Noisy Quantum Computation - p. 39/58
40 Deformations of the Bloch Table of the final fidelities, relative to random errors with maximum noise strenght θ. of a Quantum Simulator for the Schrödinger Equation A Quantum Simulator Ideal Quantum Harmonic Oscillator and Error Distribution Wave Packet Graphic Representation Some Meaningful Examples /2 /2 /3 2/3 3/3 Conclusions Future Research Thanks! Sara Felloni and Giuliano Strini, May 28, 27 Noisy Quantum Computation - p. 4/58 Deformation θ q q q 2 q 3 q 4 q 5 Bit flip Bit-phase flip Phase flip
41 Displacements of the Bloch /3 Displacements and corresponding fidelities, relative to random errors with maximum noise strenght θ =.2, along: +x semi axis +y semi axis +z semi axis Sara Felloni and Giuliano Strini, May 28, 27 Noisy Quantum Computation - p. 4/58
42 Displacements of the Bloch 2/3 Displacements and corresponding fidelities, relative to random errors with maximum noise strength θ =.2, along: -x semi axis -y semi axis -z semi axis Sara Felloni and Giuliano Strini, May 28, 27 Noisy Quantum Computation - p. 42/58
43 Displacements of the Bloch 3/3 Table of the final fidelities, relative to random errors with maximum noise strenght θ =.2. of a Quantum Simulator for the Schrödinger Equation A Quantum Simulator Ideal Quantum Harmonic Oscillator and Error Distribution Wave Packet Graphic Representation Some Meaningful Examples /2 /2 /3 2/3 3/3 Conclusions Future Research Thanks! Sara Felloni and Giuliano Strini, May 28, 27 Noisy Quantum Computation - p. 43/58 Displacement q q q 2 q 3 q 4 q 5 +x semi axis x semi axis y semi axis y semi axis z semi axis z semi axis
44 Conclusions of a Quantum Simulator for the Schrödinger Equation A Quantum Simulator Ideal Quantum Harmonic Oscillator and Error Distribution Wave Packet Graphic Representation Some Meaningful Examples /2 /2 /3 2/3 3/3 Conclusions Future Research Thanks! Sara Felloni and Giuliano Strini, May 28, 27 Noisy Quantum Computation - p. 44/58 The quantum system can be successfully treated even if affected by strong perturbation. Iterating the system for a longer time-interval causes error to gradually accumulate; but, in order to study periodical behaviors, it is sufficient to consider a few periods. The algorithm used is so efficient to successfully simulate interesting quantum dynamics by means of only 6 qubits. The number of qubits required by the quantum simulator is sufficiently small to successfully simulate all the 2 single-qubit quantum noise channels. The number of gates required by the algorithm is sufficiently small to study quantum noise effects to simulate imperfect gates implementation.
45 Future Research of a Quantum Simulator for the Schrödinger Equation A Quantum Simulator Ideal Quantum Harmonic Oscillator and Error Distribution Wave Packet Graphic Representation Some Meaningful Examples /2 /2 /3 2/3 3/3 Conclusions Future Research Thanks! Sara Felloni and Giuliano Strini, May 28, 27 Noisy Quantum Computation - p. 45/58 Simulations will be extended to more complex systems. Some meaningful two-qubit errors will also be considered. An exhaustive study of a general transformation of a two-qubit density matrix appears hardly feasible, since there are 24 parameters involved. Thus special cases of realistic physical errors in the main experimental implementations will be addressed. The general error model will be applied to study the phenomenon known as sudden de-entanglement (or sudden death of entanglement), to discover which noise channels originates this rapid decay of the initial entangled states.
46 Thanks! of a Quantum Simulator for the Schrödinger Equation A Quantum Simulator Ideal Quantum Harmonic Oscillator and Error Distribution Wave Packet Graphic Representation Some Meaningful Examples /2 /2 /3 2/3 3/3 Conclusions Future Research Thanks! Sara Felloni and Giuliano Strini, May 28, 27 Noisy Quantum Computation - p. 46/58 References [] G. Benenti, G. Casati and G. Strini, Principles of Quantum Computation and Information, Vol. : Basic Concepts (World Scientific, Singapore, 24). [2] G. Benenti, G. Casati and G. Strini, Principles of Quantum Computation and Information, Vol. 2: Basic Tools and Special Topics (World Scientific, Singapore, 27). [3] G. Benenti, S. Felloni and G. Strini, Effects of single-qubit quantum noise on entanglement purification, Eur. Phys. J. D 38, 389 (26); quant-ph/5577. [4] G. Strini, A. Carati, S. Vicari, Algoritmi quantistici per la risoluzione dell equazione di Schroedinger, dipartimento di Matematica, facoltà di Scienze Matematiche, Fisiche e Naturali, Università degli Studi di Milano, a.a. 24/25.
47 of a Quantum Simulator for the Schrödinger Equation of a Quantum Entanglement Purification Protocol Entanglement Purification and Cryptography Entanglement Purification Protocol Ideal Entanglement Purification: Fidelity Ideal Entanglement Purification: Survival Probability Noisy Entanglement Purification Conclusions Fidelity Table Thanks! of a Quantum Entanglement Purification Protocol Sara Felloni and Giuliano Strini, May 28, 27 Noisy Quantum Computation - p. 47/58
48 Entanglement Purification and Cryptography of a Quantum Simulator for the Schrödinger Equation of a Quantum Entanglement Purification Protocol Entanglement Purification and Cryptography Entanglement Purification Protocol Ideal Entanglement Purification: Fidelity Ideal Entanglement Purification: Survival Probability Noisy Entanglement Purification Conclusions Fidelity Table Thanks! Entanglement-based quantum cryptography If a member of a maximally entangled EPR pair is transmitted from a sender (Alice) to a receiver (Bob) through a quantum channel, then noise in the channel, as well as eavesdropping (Eve) can degrade the amount of entanglement of the pair. Quantum privacy amplification (QPA) iterative protocol It eliminates entanglement with an eavesdropper by creating a small number of nearly perfect (pure) EPR states out of a large number of partially entangled states. Sara Felloni and Giuliano Strini, May 28, 27 Noisy Quantum Computation - p. 48/58
49 Entanglement Purification Protocol of a Quantum Simulator for the Schrödinger Equation LOCC local quantum operations (quantum gates and measurements performed by Alice and Bob on their own qubits) supplemented by classical communication. of a Quantum Entanglement Purification Protocol Entanglement Purification and Cryptography Entanglement Purification Protocol Ideal Entanglement Purification: Fidelity Ideal Entanglement Purification: Survival Probability Noisy Entanglement Purification Conclusions Fidelity Table Thanks! Sara Felloni and Giuliano Strini, May 28, 27 Noisy Quantum Computation - p. 49/58
50 Ideal Entanglement Purification: Fidelity of a Quantum Simulator for the Schrödinger Equation Fidelity F measures the quality of the purified EPR pair: F = φ + ρ AB φ + and it measures the probability that the control qubits would pass a test for being in the pure state. of a Quantum Entanglement Purification Protocol Entanglement Purification and Cryptography Entanglement Purification Protocol Ideal Entanglement Purification: Fidelity Ideal Entanglement Purification: Survival Probability Noisy Entanglement Purification Conclusions Fidelity Table Thanks! solid line: weak intrusion (perturbation) dash-line: middle intrusion dot-line: strong intrusion Sara Felloni and Giuliano Strini, May 28, 27 Noisy Quantum Computation - p. 5/58
51 Ideal Entanglement Purification: Survival Probability of a Quantum Simulator for the Schrödinger Equation of a Quantum Entanglement Purification Protocol Entanglement Purification and Cryptography Entanglement Purification Protocol Ideal Entanglement Purification: Fidelity Ideal Entanglement Purification: Survival Probability Noisy Entanglement Purification Conclusions Fidelity Table Thanks! EPR pairs must be discarded when Alice and Bob obtain different measurement outcomes. Survival probability P(n) measures the probability that a n-step QPA protocol is successful: if p i is the probability that Alice and Bob obtain coinciding outcomes at step i, P(n) = n i= p i. Sara Felloni and Giuliano Strini, May 28, 27 Noisy Quantum Computation - p. 5/58
52 Noisy Entanglement Purification of a Quantum Simulator for the Schrödinger Equation of a Quantum Entanglement Purification Protocol Entanglement Purification and Cryptography Entanglement Purification Protocol Ideal Entanglement Purification: Fidelity Ideal Entanglement Purification: Survival Probability Noisy Entanglement Purification Conclusions Fidelity Table Thanks! A systematic numerical study of the impact of all possible single-qubit noise channels on the quantum privacy amplification protocol shows that both:. the qualitative behavior of the fidelity of the purified state as a function of the number of purification steps 2. the maximum level of noise tolerable by the protocol strongly depend on the specific noise channel applied. These results provide valuable information for experimental implementations of this protocol. Sara Felloni and Giuliano Strini, May 28, 27 Noisy Quantum Computation - p. 52/58
53 Rotations of the Bloch Fidelity decays and survival probabilities of rotations relative to random errors with maximum noise strenght θ, about: x axis θ =. y axis θ =. z axis θ =.5 Sara Felloni and Giuliano Strini, May 28, 27 Noisy Quantum Computation - p. 53/58
54 Deformations of the Bloch Fidelity decays and survival probabilities of deformations relative to random errors with maximum noise strenght θ: x axis θ =. y axis θ =.3 z axis θ =. Sara Felloni and Giuliano Strini, May 28, 27 Noisy Quantum Computation - p. 54/58
55 Displacements of the Bloch Fidelity decays and survival probabilities of displacements relative to random errors with maximum noise strenght θ, along: x axis θ =. y axis θ =. z axis θ =.3 Sara Felloni and Giuliano Strini, May 28, 27 Noisy Quantum Computation - p. 55/58
56 Conclusions of a Quantum Simulator for the Schrödinger Equation of a Quantum Entanglement Purification Protocol Entanglement Purification and Cryptography Entanglement Purification Protocol Ideal Entanglement Purification: Fidelity Ideal Entanglement Purification: Survival Probability Noisy Entanglement Purification Conclusions Fidelity Table Thanks! Even though all noise channels degrade the performance of the protocol, the level of noise that can be safely tolerated strongly depends on the specific channel. Two main distinct behaviors are observed:. The fidelity is continuously improved by increasing the number of purification steps (e.g. bit flip) 2. The fidelity saturates to a value F < after a finite number of steps, so that any further iteration is useless (e.g. x displacement) Sara Felloni and Giuliano Strini, May 28, 27 Noisy Quantum Computation - p. 56/58
57 Fidelity Table Noise channel θ max x rotation y rotation z rotation.6 x deformation. y deformation.3 z deformation. x displacement. y displacement. y displacement.3 The QPA protocol is much less sensitive to displacements along z than along x or y. This suggests that the z-axis should be chosen along the direction of noise. The axes x and y should then be chosen to minimize other noise effects. Sara Felloni and Giuliano Strini, May 28, 27 Noisy Quantum Computation - p. 57/58
58 Thanks! of a Quantum Simulator for the Schrödinger Equation of a Quantum Entanglement Purification Protocol Entanglement Purification and Cryptography Entanglement Purification Protocol Ideal Entanglement Purification: Fidelity Ideal Entanglement Purification: Survival Probability Noisy Entanglement Purification Conclusions Fidelity Table Thanks! References [] G. Benenti, G. Casati and G. Strini, Principles of Quantum Computation and Information, Vol. : Basic Concepts (World Scientific, Singapore, 24). [2] G. Benenti, G. Casati and G. Strini, Principles of Quantum Computation and Information, Vol. 2: Basic Tools and Special Topics (World Scientific, Singapore, 27). [3] G. Benenti, S. Felloni and G. Strini, Effects of single-qubit quantum noise on entanglement purification, Eur. Phys. J. D 38, 389 (26); quant-ph/5577. [4] G. Strini, A. Carati, S. Vicari, Algoritmi quantistici per la risoluzione dell equazione di Schroedinger, dipartimento di Matematica, facoltà di Scienze Matematiche, Fisiche e Naturali, Università degli Studi di Milano, a.a. 24/25. Sara Felloni and Giuliano Strini, May 28, 27 Noisy Quantum Computation - p. 58/58
Quantum Information Processing and Diagrams of States
Quantum Information and Diagrams of States September 17th 2009, AFSecurity Sara Felloni sara@unik.no / sara.felloni@iet.ntnu.no Quantum Hacking Group: http://www.iet.ntnu.no/groups/optics/qcr/ UNIK University
More informationQuantum Error Correcting Codes and Quantum Cryptography. Peter Shor M.I.T. Cambridge, MA 02139
Quantum Error Correcting Codes and Quantum Cryptography Peter Shor M.I.T. Cambridge, MA 02139 1 We start out with two processes which are fundamentally quantum: superdense coding and teleportation. Superdense
More informationEntanglement Measures and Monotones
Entanglement Measures and Monotones PHYS 500 - Southern Illinois University March 30, 2017 PHYS 500 - Southern Illinois University Entanglement Measures and Monotones March 30, 2017 1 / 11 Quantifying
More informationPHY305: Notes on Entanglement and the Density Matrix
PHY305: Notes on Entanglement and the Density Matrix Here follows a short summary of the definitions of qubits, EPR states, entanglement, the density matrix, pure states, mixed states, measurement, and
More informationHigh Fidelity to Low Weight. Daniel Gottesman Perimeter Institute
High Fidelity to Low Weight Daniel Gottesman Perimeter Institute A Word From Our Sponsor... Quant-ph/0212066, Security of quantum key distribution with imperfect devices, D.G., H.-K. Lo, N. Lutkenhaus,
More information1 Readings. 2 Unitary Operators. C/CS/Phys C191 Unitaries and Quantum Gates 9/22/09 Fall 2009 Lecture 8
C/CS/Phys C191 Unitaries and Quantum Gates 9//09 Fall 009 Lecture 8 1 Readings Benenti, Casati, and Strini: Classical circuits and computation Ch.1.,.6 Quantum Gates Ch. 3.-3.4 Kaye et al: Ch. 1.1-1.5,
More informationQuantum Computing Lecture 3. Principles of Quantum Mechanics. Anuj Dawar
Quantum Computing Lecture 3 Principles of Quantum Mechanics Anuj Dawar What is Quantum Mechanics? Quantum Mechanics is a framework for the development of physical theories. It is not itself a physical
More informationC/CS/Phys 191 Quantum Gates and Universality 9/22/05 Fall 2005 Lecture 8. a b b d. w. Therefore, U preserves norms and angles (up to sign).
C/CS/Phys 191 Quantum Gates and Universality 9//05 Fall 005 Lecture 8 1 Readings Benenti, Casati, and Strini: Classical circuits and computation Ch.1.,.6 Quantum Gates Ch. 3.-3.4 Universality Ch. 3.5-3.6
More informationLogical error rate in the Pauli twirling approximation
Logical error rate in the Pauli twirling approximation Amara Katabarwa and Michael R. Geller Department of Physics and Astronomy, University of Georgia, Athens, Georgia 30602, USA (Dated: April 10, 2015)
More informationSingle qubit + CNOT gates
Lecture 6 Universal quantum gates Single qubit + CNOT gates Single qubit and CNOT gates together can be used to implement an arbitrary twolevel unitary operation on the state space of n qubits. Suppose
More informationPh 219/CS 219. Exercises Due: Friday 3 November 2006
Ph 9/CS 9 Exercises Due: Friday 3 November 006. Fidelity We saw in Exercise. that the trace norm ρ ρ tr provides a useful measure of the distinguishability of the states ρ and ρ. Another useful measure
More informationTeleportation of Quantum States (1993; Bennett, Brassard, Crepeau, Jozsa, Peres, Wootters)
Teleportation of Quantum States (1993; Bennett, Brassard, Crepeau, Jozsa, Peres, Wootters) Rahul Jain U. Waterloo and Institute for Quantum Computing, rjain@cs.uwaterloo.ca entry editor: Andris Ambainis
More informationThe Bloch Sphere. Ian Glendinning. February 16, QIA Meeting, TechGate 1 Ian Glendinning / February 16, 2005
The Bloch Sphere Ian Glendinning February 16, 2005 QIA Meeting, TechGate 1 Ian Glendinning / February 16, 2005 Outline Introduction Definition of the Bloch sphere Derivation of the Bloch sphere Properties
More informationquantum error-rejection
Lecture Note 7 Decoherence-free sub-space space and quantum error-rejection rejection.06.006 open system dynamics ψ = α 0 + α 0 Decoherence System Environment 0 E 0 U ( t) ( t) 0 E ( t) E U E ( t) U()
More information1. Basic rules of quantum mechanics
1. Basic rules of quantum mechanics How to describe the states of an ideally controlled system? How to describe changes in an ideally controlled system? How to describe measurements on an ideally controlled
More informationNANOSCALE SCIENCE & TECHNOLOGY
. NANOSCALE SCIENCE & TECHNOLOGY V Two-Level Quantum Systems (Qubits) Lecture notes 5 5. Qubit description Quantum bit (qubit) is an elementary unit of a quantum computer. Similar to classical computers,
More informationMP 472 Quantum Information and Computation
MP 472 Quantum Information and Computation http://www.thphys.may.ie/staff/jvala/mp472.htm Outline Open quantum systems The density operator ensemble of quantum states general properties the reduced density
More informationCryptography CS 555. Topic 25: Quantum Crpytography. CS555 Topic 25 1
Cryptography CS 555 Topic 25: Quantum Crpytography CS555 Topic 25 1 Outline and Readings Outline: What is Identity Based Encryption Quantum cryptography Readings: CS555 Topic 25 2 Identity Based Encryption
More informationarxiv: v1 [quant-ph] 1 Mar 2016
A comparative study of protocols for secure quantum communication under noisy environment: single-qubit-based protocols versus entangled-state-based protocols arxiv:1603.00178v1 [quant-ph] 1 Mar 016 Vishal
More informationQuantum Cryptography. Areas for Discussion. Quantum Cryptography. Photons. Photons. Photons. MSc Distributed Systems and Security
Areas for Discussion Joseph Spring Department of Computer Science MSc Distributed Systems and Security Introduction Photons Quantum Key Distribution Protocols BB84 A 4 state QKD Protocol B9 A state QKD
More informationIntroduction to Quantum Information Hermann Kampermann
Introduction to Quantum Information Hermann Kampermann Heinrich-Heine-Universität Düsseldorf Theoretische Physik III Summer school Bleubeuren July 014 Contents 1 Quantum Mechanics...........................
More informationQuantum correlations and decoherence in systems of interest for the quantum information processing
Universita' degli Studi di Milano Physics, Astrophysics and Applied Physics PhD School: 1 st Year-Student Mini-Workshop Quantum correlations and decoherence in systems of interest for the quantum information
More informationQuantum Computing. Quantum Computing. Sushain Cherivirala. Bits and Qubits
Quantum Computing Bits and Qubits Quantum Computing Sushain Cherivirala Quantum Gates Measurement of Qubits More Quantum Gates Universal Computation Entangled States Superdense Coding Measurement Revisited
More informationFidelity of Quantum Teleportation through Noisy Channels
Fidelity of Quantum Teleportation through Noisy Channels Sangchul Oh, Soonchil Lee, and Hai-woong Lee Department of Physics, Korea Advanced Institute of Science and Technology, Daejon, 305-701, Korea (Dated:
More informationQuantum information and quantum computing
Middle East Technical University, Department of Physics January 7, 009 Outline Measurement 1 Measurement 3 Single qubit gates Multiple qubit gates 4 Distinguishability 5 What s measurement? Quantum measurement
More informationQuantum Communication & Computation Using Spin Chains
Quantum Communication & Computation Using Spin Chains Sougato Bose Institute for Quantum Information, Caltech & UCL, London Quantum Computation Part: S. C. Benjamin & S. Bose, quant-ph/02057 (to appear
More informationLecture: Quantum Information
Lecture: Quantum Information Transcribed by: Crystal Noel and Da An (Chi Chi) November 10, 016 1 Final Proect Information Find an issue related to class you are interested in and either: read some papers
More informationHilbert Space, Entanglement, Quantum Gates, Bell States, Superdense Coding.
CS 94- Bell States Bell Inequalities 9//04 Fall 004 Lecture Hilbert Space Entanglement Quantum Gates Bell States Superdense Coding 1 One qubit: Recall that the state of a single qubit can be written as
More informationPHYS 3220 PhET Quantum Tunneling Tutorial
PHYS 3220 PhET Quantum Tunneling Tutorial Part I: Mathematical Introduction Recall that the Schrödinger Equation is i Ψ(x,t) t = ĤΨ(x, t). Usually this is solved by first assuming that Ψ(x, t) = ψ(x)φ(t),
More informationAverage Fidelity of Teleportation in Quantum Noise Channel
Commun. Theor. Phys. (Beijing, China) 45 (006) pp. 80 806 c International Academic Publishers Vol. 45, No. 5, May 15, 006 Average Fidelity of Teleportation in Quantum Noise Channel HAO Xiang, ZHANG Rong,
More informationIntroduction to quantum information processing
Introduction to quantum information processing Measurements and quantum probability Brad Lackey 25 October 2016 MEASUREMENTS AND QUANTUM PROBABILITY 1 of 22 OUTLINE 1 Probability 2 Density Operators 3
More informationDriving Qubit Transitions in J-C Hamiltonian
Qubit Control Driving Qubit Transitions in J-C Hamiltonian Hamiltonian for microwave drive Unitary transform with and Results in dispersive approximation up to 2 nd order in g Drive induces Rabi oscillations
More informationIntroduction to Quantum Information Processing QIC 710 / CS 768 / PH 767 / CO 681 / AM 871
Introduction to Quantum Information Processing QIC 710 / CS 768 / PH 767 / CO 681 / AM 871 Lecture 9 (2017) Jon Yard QNC 3126 jyard@uwaterloo.ca http://math.uwaterloo.ca/~jyard/qic710 1 More state distinguishing
More informationInformation quantique, calcul quantique :
Séminaire LARIS, 8 juillet 2014. Information quantique, calcul quantique : des rudiments à la recherche (en 45min!). François Chapeau-Blondeau LARIS, Université d Angers, France. 1/25 Motivations pour
More informationUnitary evolution: this axiom governs how the state of the quantum system evolves in time.
CS 94- Introduction Axioms Bell Inequalities /7/7 Spring 7 Lecture Why Quantum Computation? Quantum computers are the only model of computation that escape the limitations on computation imposed by the
More informationJian-Wei Pan
Lecture Note 6 11.06.2008 open system dynamics 0 E 0 U ( t) ( t) 0 E ( t) E U 1 E ( t) 1 1 System Environment U() t ( ) 0 + 1 E 0 E ( t) + 1 E ( t) 0 1 0 0 1 1 2 * 0 01 E1 E0 q() t = TrEq+ E = * 2 1 0
More informationQuantum Gates, Circuits & Teleportation
Chapter 3 Quantum Gates, Circuits & Teleportation Unitary Operators The third postulate of quantum physics states that the evolution of a quantum system is necessarily unitary. Geometrically, a unitary
More informationSUPPLEMENTARY INFORMATION
SUPPLEMENTARY INFORMATION doi:1.138/nature1366 I. SUPPLEMENTARY DISCUSSION A. Success criterion We shall derive a success criterion for quantum teleportation applicable to the imperfect, heralded dual-rail
More informationA Genetic Algorithm to Analyze the Security of Quantum Cryptographic Protocols
A Genetic Algorithm to Analyze the Security of Quantum Cryptographic Protocols Walter O. Krawec walter.krawec@gmail.com Iona College Computer Science Department New Rochelle, NY USA IEEE WCCI July, 2016
More informationLecture 6: Quantum error correction and quantum capacity
Lecture 6: Quantum error correction and quantum capacity Mark M. Wilde The quantum capacity theorem is one of the most important theorems in quantum hannon theory. It is a fundamentally quantum theorem
More informationLecture 11 September 30, 2015
PHYS 7895: Quantum Information Theory Fall 015 Lecture 11 September 30, 015 Prof. Mark M. Wilde Scribe: Mark M. Wilde This document is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike
More informationQuantum Information Transfer and Processing Miloslav Dušek
Quantum Information Transfer and Processing Miloslav Dušek Department of Optics, Faculty of Science Palacký University, Olomouc Quantum theory Quantum theory At the beginning of 20 th century about the
More informationSecurity of Quantum Key Distribution with Imperfect Devices
Security of Quantum Key Distribution with Imperfect Devices Hoi-Kwong Lo Dept. of Electrical & Comp. Engineering (ECE); & Dept. of Physics University of Toronto Email:hklo@comm.utoronto.ca URL: http://www.comm.utoronto.ca/~hklo
More informationIntroduction to Quantum Information Processing QIC 710 / CS 768 / PH 767 / CO 681 / AM 871
Introduction to Quantum Information Processing QIC 710 / CS 768 / PH 767 / CO 681 / AM 871 Lecture 1 (2017) Jon Yard QNC 3126 jyard@uwaterloo.ca TAs Nitica Sakharwade nsakharwade@perimeterinstitute.ca
More information2.0 Basic Elements of a Quantum Information Processor. 2.1 Classical information processing The carrier of information
QSIT09.L03 Page 1 2.0 Basic Elements of a Quantum Information Processor 2.1 Classical information processing 2.1.1 The carrier of information - binary representation of information as bits (Binary digits).
More informationPhysics is becoming too difficult for physicists. David Hilbert (mathematician)
Physics is becoming too difficult for physicists. David Hilbert (mathematician) Simple Harmonic Oscillator Credit: R. Nave (HyperPhysics) Particle 2 X 2-Particle wave functions 2 Particles, each moving
More informationTransmitting and Hiding Quantum Information
2018/12/20 @ 4th KIAS WORKSHOP on Quantum Information and Thermodynamics Transmitting and Hiding Quantum Information Seung-Woo Lee Quantum Universe Center Korea Institute for Advanced Study (KIAS) Contents
More informationInstantaneous Nonlocal Measurements
Instantaneous Nonlocal Measurements Li Yu Department of Physics, Carnegie-Mellon University, Pittsburgh, PA July 22, 2010 References Entanglement consumption of instantaneous nonlocal quantum measurements.
More informationQuantum cryptography. Quantum cryptography has a potential to be cryptography of 21 st century. Part XIII
Quantum cryptography Part XIII Quantum cryptography Quantum cryptography has a potential to be cryptography of st century. An important new feature of quantum cryptography is that security of quantum cryptographic
More informationIntroduction to quantum information processing
Introduction to quantum information processing Fidelity and other distance metrics Brad Lackey 3 November 2016 FIDELITY AND OTHER DISTANCE METRICS 1 of 17 OUTLINE 1 Noise channels 2 Fidelity 3 Trace distance
More informationOther Topics in Quantum Information
p. 1/23 Other Topics in Quantum Information In a course like this there is only a limited time, and only a limited number of topics can be covered. Some additional topics will be covered in the class projects.
More informationHomework 3. 1 Coherent Control [22 pts.] 1.1 State vector vs Bloch vector [8 pts.]
Homework 3 Contact: jangi@ethz.ch Due date: December 5, 2014 Nano Optics, Fall Semester 2014 Photonics Laboratory, ETH Zürich www.photonics.ethz.ch 1 Coherent Control [22 pts.] In the first part of this
More informationSemiconductors: Applications in spintronics and quantum computation. Tatiana G. Rappoport Advanced Summer School Cinvestav 2005
Semiconductors: Applications in spintronics and quantum computation Advanced Summer School 1 I. Background II. Spintronics Spin generation (magnetic semiconductors) Spin detection III. Spintronics - electron
More informationAn Introduction to Quantum Information. By Aditya Jain. Under the Guidance of Dr. Guruprasad Kar PAMU, ISI Kolkata
An Introduction to Quantum Information By Aditya Jain Under the Guidance of Dr. Guruprasad Kar PAMU, ISI Kolkata 1. Introduction Quantum information is physical information that is held in the state of
More informationRealization of Single Qubit Operations Using. Coherence Vector Formalism in. Quantum Cellular Automata
Adv. Studies Theor. Phys., Vol. 6, 01, no. 14, 697-70 Realization of Single Qubit Operations Using Coherence Vector Formalism in Quantum Cellular Automata G. Pavan 1, N. Chandrasekar and Narra Sunil Kumar
More informationShort Course in Quantum Information Lecture 2
Short Course in Quantum Information Lecture Formal Structure of Quantum Mechanics Course Info All materials downloadable @ website http://info.phys.unm.edu/~deutschgroup/deutschclasses.html Syllabus Lecture
More informationHomework 3 - Solutions
Homework 3 - Solutions The Transpose an Partial Transpose. 1 Let { 1, 2,, } be an orthonormal basis for C. The transpose map efine with respect to this basis is a superoperator Γ that acts on an operator
More informationarxiv:quant-ph/ v2 17 Sep 2002
Proof of security of quantum key distribution with two-way classical communications arxiv:quant-ph/0105121 v2 17 Sep 2002 Daniel Gottesman EECS: Computer Science Division University of California Berkeley,
More informationarxiv: v7 [quant-ph] 20 Mar 2017
Quantum oblivious transfer and bit commitment protocols based on two non-orthogonal states coding arxiv:1306.5863v7 [quant-ph] 0 Mar 017 Li Yang State Key Laboratory of Information Security, Institute
More informationPrivate quantum subsystems and error correction
Private quantum subsystems and error correction Sarah Plosker Department of Mathematics and Computer Science Brandon University September 26, 2014 Outline 1 Classical Versus Quantum Setting Classical Setting
More informationErrata list, Nielsen & Chuang. rrata/errata.html
Errata list, Nielsen & Chuang http://www.michaelnielsen.org/qcqi/errata/e rrata/errata.html Part II, Nielsen & Chuang Quantum circuits (Ch 4) SK Quantum algorithms (Ch 5 & 6) Göran Johansson Physical realisation
More informationPhysics 239/139 Spring 2018 Assignment 6
University of California at San Diego Department of Physics Prof. John McGreevy Physics 239/139 Spring 2018 Assignment 6 Due 12:30pm Monday, May 14, 2018 1. Brainwarmers on Kraus operators. (a) Check that
More informationIntroduction to Quantum Error Correction
Introduction to Quantum Error Correction Nielsen & Chuang Quantum Information and Quantum Computation, CUP 2000, Ch. 10 Gottesman quant-ph/0004072 Steane quant-ph/0304016 Gottesman quant-ph/9903099 Errors
More informationQuantum Hadamard channels (I)
.... Quantum Hadamard channels (I) Vlad Gheorghiu Department of Physics Carnegie Mellon University Pittsburgh, PA 15213, U.S.A. July 8, 2010 Vlad Gheorghiu (CMU) Quantum Hadamard channels (I) July 8, 2010
More informationUse of dynamical coupling for improved quantum state transfer
Use of dynamical coupling for improved quantum state transfer A. O. Lyakhov and C. Bruder Department of Physics and Astronomy, University of Basel, Klingelbergstr. 82, 45 Basel, Switzerland We propose
More informationQuantum Cryptography
Quantum Cryptography (Notes for Course on Quantum Computation and Information Theory. Sec. 13) Robert B. Griffiths Version of 26 March 2003 References: Gisin = N. Gisin et al., Rev. Mod. Phys. 74, 145
More informationOn the Relation between Quantum Discord and Purified Entanglement
On the Relation between Quantum Discord and Purified Entanglement by Eric Webster A thesis presented to the University of Waterloo in fulfillment of the thesis requirement for the degree of Master of Mathematics
More informationTutorial on Quantum Computing. Vwani P. Roychowdhury. Lecture 1: Introduction
Tutorial on Quantum Computing Vwani P. Roychowdhury Lecture 1: Introduction 1 & ) &! # Fundamentals Qubits A single qubit is a two state system, such as a two level atom we denote two orthogonal states
More information. Here we are using the standard inner-product over C k to define orthogonality. Recall that the inner-product of two vectors φ = i α i.
CS 94- Hilbert Spaces, Tensor Products, Quantum Gates, Bell States 1//07 Spring 007 Lecture 01 Hilbert Spaces Consider a discrete quantum system that has k distinguishable states (eg k distinct energy
More informationBell tests in physical systems
Bell tests in physical systems Seung-Woo Lee St. Hugh s College, Oxford A thesis submitted to the Mathematical and Physical Sciences Division for the degree of Doctor of Philosophy in the University of
More informationAPPLICATIONS. Quantum Communications
SOFT PROCESSING TECHNIQUES FOR QUANTUM KEY DISTRIBUTION APPLICATIONS Marina Mondin January 27, 2012 Quantum Communications In the past decades, the key to improving computer performance has been the reduction
More informationD.5 Quantum error correction
D. QUANTUM ALGORITHMS 157 Figure III.34: E ects of decoherence on a qubit. On the left is a qubit yi that is mostly isoloated from its environment i. Ontheright,aweakinteraction between the qubit and the
More informationQuantum Computer Architecture
Quantum Computer Architecture Scalable and Reliable Quantum Computers Greg Byrd (ECE) CSC 801 - Feb 13, 2018 Overview 1 Sources 2 Key Concepts Quantum Computer 3 Outline 4 Ion Trap Operation The ion can
More informationCS120, Quantum Cryptography, Fall 2016
CS10, Quantum Cryptography, Fall 016 Homework # due: 10:9AM, October 18th, 016 Ground rules: Your homework should be submitted to the marked bins that will be by Annenberg 41. Please format your solutions
More informationUnconditional Security of the Bennett 1992 quantum key-distribution protocol over a lossy and noisy channel
Unconditional Security of the Bennett 1992 quantum key-distribution protocol over a lossy and noisy channel Kiyoshi Tamaki *Perimeter Institute for Theoretical Physics Collaboration with Masato Koashi
More informationQuantum Error Correction and Fault Tolerance. Classical Repetition Code. Quantum Errors. Barriers to Quantum Error Correction
Quantum Error Correction and Fault Tolerance Daniel Gottesman Perimeter Institute The Classical and Quantum Worlds Quantum Errors A general quantum error is a superoperator: ρ ΣA k ρ A k (Σ A k A k = I)
More informationCompression and entanglement, entanglement transformations
PHYSICS 491: Symmetry and Quantum Information April 27, 2017 Compression and entanglement, entanglement transformations Lecture 8 Michael Walter, Stanford University These lecture notes are not proof-read
More informationQuantum Information Types
qitd181 Quantum Information Types Robert B. Griffiths Version of 6 February 2012 References: R. B. Griffiths, Types of Quantum Information, Phys. Rev. A 76 (2007) 062320; arxiv:0707.3752 Contents 1 Introduction
More informationEnergy Level Sets for the Morse Potential
Energy Level Sets for the Morse Potential Fariel Shafee Department of Physics Princeton University Princeton, NJ 08540 Abstract: In continuation of our previous work investigating the possibility of the
More informationQuantum Control of Qubits
Quantum Control of Qubits K. Birgitta Whaley University of California, Berkeley J. Zhang J. Vala S. Sastry M. Mottonen R. desousa Quantum Circuit model input 1> 6> = 1> 0> H S T H S H x x 7 k = 0 e 3 π
More informationC/CS/Phys C191 Quantum Gates, Universality and Solovay-Kitaev 9/25/07 Fall 2007 Lecture 9
C/CS/Phys C191 Quantum Gates, Universality and Solovay-Kitaev 9/25/07 Fall 2007 Lecture 9 1 Readings Benenti, Casati, and Strini: Quantum Gates Ch. 3.2-3.4 Universality Ch. 3.5-3.6 2 Quantum Gates Continuing
More informationDynamically protected cat-qubits: a new paradigm for universal quantum computation
Home Search Collections Journals About Contact us My IOPscience Dynamically protected cat-qubits: a new paradigm for universal quantum computation This content has been downloaded from IOPscience. Please
More informationMagic States. Presented by Nathan Babcock
Magic States Presented by Nathan Babcock Overview I will discuss the following points:. Quantum Error Correction. The Stabilizer Formalism. Clifford Group Quantum Computation 4. Magic States 5. Derivation
More informationUnitary Dynamics and Quantum Circuits
qitd323 Unitary Dynamics and Quantum Circuits Robert B. Griffiths Version of 20 January 2014 Contents 1 Unitary Dynamics 1 1.1 Time development operator T.................................... 1 1.2 Particular
More informationIntroduction to Quantum Computing
Introduction to Quantum Computing Part I Emma Strubell http://cs.umaine.edu/~ema/quantum_tutorial.pdf April 12, 2011 Overview Outline What is quantum computing? Background Caveats Fundamental differences
More informationarxiv:quant-ph/ v1 13 Jan 2003
Deterministic Secure Direct Communication Using Ping-pong protocol without public channel Qing-yu Cai Laboratory of Magentic Resonance and Atom and Molecular Physics, Wuhan Institute of Mathematics, The
More informationDECAY OF SINGLET CONVERSION PROBABILITY IN ONE DIMENSIONAL QUANTUM NETWORKS
DECAY OF SINGLET CONVERSION PROBABILITY IN ONE DIMENSIONAL QUANTUM NETWORKS SCOTT HOTTOVY Abstract. Quantum networks are used to transmit and process information by using the phenomena of quantum mechanics.
More informationGilles Brassard. Université de Montréal
Gilles Brassard Université de Montréal Gilles Brassard Université de Montréal VOLUME 76, NUMBER 5 P H Y S I C A L R E V I E W L E T T E R S 29 JANUARY 1996 Purification of Noisy Entanglement and Faithful
More informationS.K. Saikin May 22, Lecture 13
S.K. Saikin May, 007 13 Decoherence I Lecture 13 A physical qubit is never isolated from its environment completely. As a trivial example, as in the case of a solid state qubit implementation, the physical
More informationQuantum Computation. Alessandra Di Pierro Computational models (Circuits, QTM) Algorithms (QFT, Quantum search)
Quantum Computation Alessandra Di Pierro alessandra.dipierro@univr.it 21 Info + Programme Info: http://profs.sci.univr.it/~dipierro/infquant/ InfQuant1.html Preliminary Programme: Introduction and Background
More informationQuantum Cryptography
Quantum Cryptography Umesh V. Vazirani CS 161/194-1 November 28, 2005 Why Quantum Cryptography? Unconditional security - Quantum computers can solve certain tasks exponentially faster; including quantum
More informationStop Conditions Of BB84 Protocol Via A Depolarizing Channel (Quantum Cryptography)
Journal of Computer Science 3 (6): 44-49, 7 ISSN 549-3636 7 Science Publications Stop Conditions Of BB84 Protocol Via A Depolarizing Channel (Quantum Cryptography) Iyed Ben Slimen, Olfa Trabelsi, Houria
More information9. Distance measures. 9.1 Classical information measures. Head Tail. How similar/close are two probability distributions? Trace distance.
9. Distance measures 9.1 Classical information measures How similar/close are two probability distributions? Trace distance Fidelity Example: Flipping two coins, one fair one biased Head Tail Trace distance
More informationNew schemes for manipulating quantum states using a Kerr cell. Istituto Elettrotecnico Nazionale Galileo Ferraris, Str. delle Cacce 91, I Torino
New schemes for manipulating quantum states using a Kerr cell Marco Genovese and C.Novero Istituto Elettrotecnico Nazionale Galileo Ferraris, Str. delle Cacce 91, I-10135 Torino Recently, Quantum Non Demolition
More informationLecture 4: Postulates of quantum mechanics
Lecture 4: Postulates of quantum mechanics Rajat Mittal IIT Kanpur The postulates of quantum mechanics provide us the mathematical formalism over which the physical theory is developed. For people studying
More informationQuantum state discrimination with post-measurement information!
Quantum state discrimination with post-measurement information! DEEPTHI GOPAL, CALTECH! STEPHANIE WEHNER, NATIONAL UNIVERSITY OF SINGAPORE! Quantum states! A state is a mathematical object describing the
More informationEntanglement Measures and Monotones Pt. 2
Entanglement Measures and Monotones Pt. 2 PHYS 500 - Southern Illinois University April 8, 2017 PHYS 500 - Southern Illinois University Entanglement Measures and Monotones Pt. 2 April 8, 2017 1 / 13 Entanglement
More informationAnswers to exercises. Part I: Quantum information. 1. Quantum bits and quantum gates
Answers to exercises Here we provide answers to all the exercises in the book; in some cases we only provide brief numerical answers, while in other cases we provide more explanation. Part I: Quantum information.
More informationKey distillation from quantum channels using two-way communication protocols
Key distillation from quantum channels using two-way communication protocols Joonwoo Bae and Antonio Acín ICFO-Institut de Ciencies Fotoniques, Mediterranean Technology Park, 08860 Castelldefels, Barcelona,
More informationQuantum Hadamard channels (II)
Quantum Hadamard channels (II) Vlad Gheorghiu Department of Physics Carnegie Mellon University Pittsburgh, PA 15213, USA August 5, 2010 Vlad Gheorghiu (CMU) Quantum Hadamard channels (II) August 5, 2010
More information