Exploring Quantum Control with Quantum Information Processors
|
|
- Constance Young
- 5 years ago
- Views:
Transcription
1 Exploring Quantum Control with Quantum Information Processors David Poulin Institute for Quantum Computing Perimeter Institute for Theoretical Physics IBM, March 2004 p.1
2 Two aspects of quantum information Practical Build a quantum computer. Design new quantum algorithms. Invent useful quantum protocols. Design quantum error corrections techniques. IBM, March 2004 p.2
3 Two aspects of quantum information Practical Build a quantum computer. Design new quantum algorithms. Invent useful quantum protocols. Design quantum error corrections techniques. Fundamental Use the byproducts to study fundamental physics. IBM, March 2004 p.2
4 Two aspects of quantum information Practical Build a quantum computer. Design new quantum algorithms. Invent useful quantum protocols. Design quantum error corrections techniques. Fundamental Use the byproducts to study fundamental physics. Foundation of quantum mechanics: what gives quantum mechanics extra computational power? IBM, March 2004 p.2
5 Two aspects of quantum information Practical Build a quantum computer. Design new quantum algorithms. Invent useful quantum protocols. Design quantum error corrections techniques. Fundamental Use the byproducts to study fundamental physics. Foundation of quantum mechanics: what gives quantum mechanics extra computational power? Explain renormalization groups as error correction. IBM, March 2004 p.2
6 Two aspects of quantum information Practical Build a quantum computer. Design new quantum algorithms. Invent useful quantum protocols. Design quantum error corrections techniques. Fundamental Use the byproducts to study fundamental physics. Foundation of quantum mechanics: what gives quantum mechanics extra computational power? Explain renormalization groups as error correction. Study the "holographic principle" in information theoretic language. IBM, March 2004 p.2
7 Two aspects of quantum information Practical Build a quantum computer. Design new quantum algorithms. Invent useful quantum protocols. Design quantum error corrections techniques. Fundamental Use the byproducts to study fundamental physics. Foundation of quantum mechanics: what gives quantum mechanics extra computational power? Explain renormalization groups as error correction. Study the "holographic principle" in information theoretic language. Black hole formation = quantum data compression? IBM, March 2004 p.2
8 Concrete example Design useful task for a present days quantum information processors: Can we do something useful in DQC1? Is entanglement responsible for quantum computational speed up? Set milestones for the construction of a quantum computer. IBM, March 2004 p.3
9 Concrete example Design useful task for a present days quantum information processors: Can we do something useful in DQC1? Is entanglement responsible for quantum computational speed up? Set milestones for the construction of a quantum computer. How can we improve our control over quantum systems? (QECC, NSS, bang-bang) New tools to understand the role of symmetries of quantum systems. Relation between dynamical stability and symmetries. IBM, March 2004 p.3
10 Concrete example Design useful task for a present days quantum information processors: Can we do something useful in DQC1? Is entanglement responsible for quantum computational speed up? Set milestones for the construction of a quantum computer. How can we improve our control over quantum systems? (QECC, NSS, bang-bang) New tools to understand the role of symmetries of quantum systems. Relation between dynamical stability and symmetries. Identify good candidates for QIP. Quantum algorithm to find symmetries of a quantum system? Relation between dynamical stability and decoherence. Relation between decoherence and entanglement. IBM, March 2004 p.3
11 Outline Simulating quantum systems: the readout problem. The QDC1 model of computation. The elementary scattering circuit. Looking for symmetries in complex quantum systems. Random matrix conjecture. Estimating the form factors. Hypersensitivity to perturbations: fidelity decay. DQC1 algorithm. Quantum information processors as quantum probes. Decoherence and dynamical instability. Entanglement, decoherence and quantum-computational speed-up. Conclusion. IBM, March 2004 p.4
12 Readout problem In a physical experiment, a system evolves from its initial state and is finally measured in some basis. IBM, March 2004 p.5
13 Readout problem In a physical experiment, a system evolves from its initial state and is finally measured in some basis. We know that quantum computer can be use to simulate the evolution of some quantum systems (Zalka, Lloyd,...). U(t) = U n... U 2 U 1 }{{} Universal set IBM, March 2004 p.5
14 Readout problem In a physical experiment, a system evolves from its initial state and is finally measured in some basis. We know that quantum computer can be use to simulate the evolution of some quantum systems (Zalka, Lloyd,...). U(t) = U n... U 2 U 1 }{{} Universal set Do we need to prepare a special initial state? Low temperature transport properties ψ 0 e i(h 0+V ) ψ k. IBM, March 2004 p.5
15 Readout problem In a physical experiment, a system evolves from its initial state and is finally measured in some basis. We know that quantum computer can be use to simulate the evolution of some quantum systems (Zalka, Lloyd,...). U(t) = U n... U 2 U 1 }{{} Universal set Do we need to prepare a special initial state? Low temperature transport properties ψ 0 e i(h 0+V ) ψ k. Do we need to know the spectral projectors of the measured quantity? IBM, March 2004 p.5
16 Readout problem In a physical experiment, a system evolves from its initial state and is finally measured in some basis. We know that quantum computer can be use to simulate the evolution of some quantum systems (Zalka, Lloyd,...). U(t) = U n... U 2 U 1 }{{} Universal set Do we need to prepare a special initial state? Low temperature transport properties ψ 0 e i(h 0+V ) ψ k. Do we need to know the spectral projectors of the measured quantity? The ability to efficiently simulate the dynamics U(t) alone can be used to extract interesting physical quantities. IBM, March 2004 p.5
17 DQC1 Liquid state NMR QIP The initial state is thermal ρ = 1 Z e βh. IBM, March 2004 p.6
18 DQC1 Liquid state NMR QIP The initial state is thermal ρ = 1 Z e βh. H i µ i B + i j J ij µ i µ j, ω J and β 1, so ( ρ 1 1l β ) ω i σ zi Z i IBM, March 2004 p.6
19 DQC1 Liquid state NMR QIP The initial state is thermal ρ = 1 Z e βh. H i µ i B + i j J ij µ i µ j, ω J and β 1, so ( ρ 1 1l β ) ω i σ zi Z i Apply an inhomogeneous magnetic field to induce a random phase: ρ 1 ( 1l + βωn ) Z 2n IBM, March 2004 p.6
20 DQC1 Liquid state NMR QIP The initial state is thermal ρ = 1 Z e βh. H i µ i B + i j J ij µ i µ j, ω J and β 1, so ( ρ 1 1l β ) ω i σ zi Z i Apply an inhomogeneous magnetic field to induce a random phase: ρ 1 ( 1l + βωn ) Z 2n Pseudo pure state, the identity part does not contribute to the computation. D.G. Cory, A.F. Fahmy, and T.F. Havel, 1997, & N.A. Gershenfeld and I.L. Chuang, IBM, March 2004 p.6
21 DQC1 This exponential decay can be avoided using algorithmic cooling, but the overhead is IBM, March 2004 p.7
22 DQC1 This exponential decay can be avoided using algorithmic cooling, but the overhead is Add restrictions to the standard model of quantum computation IBM, March 2004 p.7
23 DQC1 This exponential decay can be avoided using algorithmic cooling, but the overhead is Add restrictions to the standard model of quantum computation 1. Only a single pseudo-pure qubit. ρ = ( 1 ɛ 2 ) 1l + ɛ n 1l IBM, March 2004 p.7
24 DQC1 This exponential decay can be avoided using algorithmic cooling, but the overhead is Add restrictions to the standard model of quantum computation 1. Only a single pseudo-pure qubit. ρ = ( 1 ɛ 2 ) 1l + ɛ n 1l 2. No projective measurement, rather σ z within finite accuracy µ. IBM, March 2004 p.7
25 DQC1 This exponential decay can be avoided using algorithmic cooling, but the overhead is Add restrictions to the standard model of quantum computation 1. Only a single pseudo-pure qubit. ρ = ( 1 ɛ 2 ) 1l + ɛ n 1l 2. No projective measurement, rather σ z within finite accuracy µ. Can we do something non trivial with this? E. Knill and R. Laflamme, 1998 IBM, March 2004 p.7
26 DQC1 Remarks: 1. Not robust against noise. Nowhere to dump the entropy! IBM, March 2004 p.8
27 DQC1 Remarks: 1. Not robust against noise. Nowhere to dump the entropy! 2. Measurement accuracy µ δ: cost (µ/δ) 2. IBM, March 2004 p.8
28 DQC1 Remarks: 1. Not robust against noise. Nowhere to dump the entropy! 2. Measurement accuracy µ δ: cost (µ/δ) Pseudo-pure state pure state ρ = n 1l: cost 1/ɛ 2. IBM, March 2004 p.8
29 DQC1 Remarks: 1. Not robust against noise. Nowhere to dump the entropy! 2. Measurement accuracy µ δ: cost (µ/δ) Pseudo-pure state pure state ρ = n 1l: cost 1/ɛ One pure qubit log(n) pure qubits: cost poly(n). From a computational complexity point of view: }{{} 2 n 1l ln n IBM, March 2004 p.8
30 Scattering circuit 0 0 ρ H H σ k U γ = T r{uρ} IBM, March 2004 p.9
31 Scattering circuit 0 0 ρ H H σ k U γ = T r{uρ} ( 1 + Re{γ} iim{γ} ) ρ 1 = 1 2 iim{γ} 1 Re{γ} IBM, March 2004 p.9
32 Scattering circuit 0 0 ρ H H σ k U γ = T r{uρ} ( 1 + Re{γ} iim{γ} ) ρ 1 = 1 2 iim{γ} 1 Re{γ} k = z k = y : σ z = T r{ρ 1σ z } = Re{γ} = Re [T r{ρu}] : σ y = T r{ρ 1σ y } = Im{γ} = Im [T r{ρu}] IBM, March 2004 p.9
33 Scattering circuit 0 0 ρ H H σ k U γ = T r{uρ} ( 1 + Re{γ} iim{γ} ) ρ 1 = 1 2 iim{γ} 1 Re{γ} k = z k = y : σ z = T r{ρ 1σ z } = Re{γ} = Re [T r{ρu}] : σ y = T r{ρ 1σ y } = Im{γ} = Im [T r{ρu}] If U can be implemented efficiently and ρ prepared efficiently, we can evaluate T r{ρu} within accuracy δ in time poly(n)/δ 2. IBM, March 2004 p.9
34 Scattering circuit We can evaluate T r{ρu} IBM, March 2004 p.10
35 Scattering circuit We can evaluate T r{ρu} Control U and learn about ρ: quantum state tomography. IBM, March 2004 p.10
36 Scattering circuit We can evaluate T r{ρu} Control U and learn about ρ: quantum state tomography. Control ρ and learn about U: quantum process tomography. C.Miquel, J.P.Paz, M.Saraceno, E. Knill, R. Laflamme, and C.Negrevergne, 2002 IBM, March 2004 p.10
37 Scattering circuit We can evaluate T r{ρu} Control U and learn about ρ: quantum state tomography. Control ρ and learn about U: quantum process tomography. C.Miquel, J.P.Paz, M.Saraceno, E. Knill, R. Laflamme, and C.Negrevergne, 2002 These algorithms require an exponential repetition of the scattering circuit. IBM, March 2004 p.10
38 Scattering circuit We can evaluate T r{ρu} Control U and learn about ρ: quantum state tomography. Control ρ and learn about U: quantum process tomography. C.Miquel, J.P.Paz, M.Saraceno, E. Knill, R. Laflamme, and C.Negrevergne, 2002 These algorithms require an exponential repetition of the scattering circuit. Can we get useful partial information about U? IBM, March 2004 p.10
39 Scattering circuit We can evaluate T r{ρu} Control U and learn about ρ: quantum state tomography. Control ρ and learn about U: quantum process tomography. C.Miquel, J.P.Paz, M.Saraceno, E. Knill, R. Laflamme, and C.Negrevergne, 2002 These algorithms require an exponential repetition of the scattering circuit. Can we get useful partial information about U? DQC1 imposes restrictions on ρ. We will focus on ρ 1l. γ = 1 N T r{u} = 1 N j λ j IBM, March 2004 p.10
40 Quantum control Quantum information processing is the art of manipulating complex quantum systems. IBM, March 2004 p.11
41 Quantum control Quantum information processing is the art of manipulating complex quantum systems. Control a quantum system = exploit its symmetries (QECC, NSS, bang-bang) IBM, March 2004 p.11
42 Quantum control Quantum information processing is the art of manipulating complex quantum systems. Control a quantum system = exploit its symmetries (QECC, NSS, bang-bang) Does my system possess any symmetries? IBM, March 2004 p.11
43 Quantum control Quantum information processing is the art of manipulating complex quantum systems. Control a quantum system = exploit its symmetries (QECC, NSS, bang-bang) Does my system possess any symmetries? Systems with as many symmetries as degrees of freedom are integrable. These are good candidates for quantum information processors. IBM, March 2004 p.11
44 Quantum control Quantum information processing is the art of manipulating complex quantum systems. Control a quantum system = exploit its symmetries (QECC, NSS, bang-bang) Does my system possess any symmetries? Systems with as many symmetries as degrees of freedom are integrable. These are good candidates for quantum information processors. Chaotic systems possess no or very few symmetries. They are hard to control. They are dynamically unstable (sensitive to perturbations). IBM, March 2004 p.11
45 Looking for symmetries Resonances of Thorium 232 Garg et al., Phys. Rev. 134, B85, IBM, March 2004 p.12
46 Looking for symmetries List of resonances Level spacing IBM, March 2004 p.13
47 Looking for symmetries Wigner s intuition: The main characteristics of the spectrum of can be reproduced by random matrices which possess the same symmetries as the system. IBM, March 2004 p.14
48 Looking for symmetries Wigner s intuition: The main characteristics of the spectrum of can be reproduced by random matrices which possess the same symmetries as the system. f(u) f(v )P (V )dv. P (V ) 0 only for those V with the same symmetries as U. P (V ) is determined with the maximum entropy principle given the above constraint. IBM, March 2004 p.14
49 Looking for symmetries Wigner s intuition: The main characteristics of the spectrum of can be reproduced by random matrices which possess the same symmetries as the system. f(u) f(v )P (V )dv. P (V ) 0 only for those V with the same symmetries as U. P (V ) is determined with the maximum entropy principle given the above constraint. No symmetry = Level repulsion IBM, March 2004 p.14
50 Looking for symmetries Wigner s intuition: The main characteristics of the spectrum of can be reproduced by random matrices which possess the same symmetries as the system. f(u) f(v )P (V )dv. P (V ) 0 only for those V with the same symmetries as U. P (V ) is determined with the maximum entropy principle given the above constraint. No symmetry = Level repulsion d U P r(d) d IBM, March 2004 p.14
51 Looking for symmetries Symmetries = Block diagonal { } iht U = exp h = U 1 U 2... U d IBM, March 2004 p.15
52 Looking for symmetries Symmetries = Block diagonal { } iht U = exp h = U 1 U 2... U d d U 1 + U = U P r(d) Mixture of i.i.d variables Poisson distribution. d IBM, March 2004 p.15
53 Looking for symmetries 1 N T r{u} = 1 N = 1 N j eiφ j j v j IBM, March 2004 p.16
54 Looking for symmetries 1 N T r{u} = 1 N = 1 N j eiφ j j v j IBM, March 2004 p.16
55 Looking for symmetries 1 N T r{u} = 1 N = 1 N j eiφ j j v j IBM, March 2004 p.16
56 Looking for symmetries 1 N T r{u} = 1 N = 1 N j eiφ j j v j IBM, March 2004 p.16
57 Looking for symmetries 1 N T r{u} = 1 N = 1 N j eiφ j j v j IBM, March 2004 p.16
58 Looking for symmetries 1 N T r{u} = 1 N = 1 N j eiφ j j v j IBM, March 2004 p.16
59 Looking for symmetries 1 N T r{u} = 1 N = 1 N j eiφ j j v j With symmetries (regular): N T r{u} = 1 N N = 1 N IBM, March 2004 p.16
60 Looking for symmetries 1 N T r{u} = 1 N = 1 N j eiφ j j v j With symmetries (regular): N T r{u} = 1 N N = 1 N No symmetries (chaotic): 1 N T r{u} = 1 N O(1) = 1 N IBM, March 2004 p.16
61 Looking for symmetries 1 N T r{u} = 1 N = 1 N j eiφ j j v j With symmetries (regular): N T r{u} = 1 N N = 1 N No symmetries (chaotic): 1 N T r{u} = 1 N O(1) = 1 N Requires accuracy 1 N so overhead is N: square-root improvement over brute force classical computation. D. Poulin, R.Laflamme, G.J. Milburn, and J.P. Paz, PRA 68, (2003). IBM, March 2004 p.16
62 Fidelity decay Quantum map U, e.g. U = exp{ iht}. How sensitive is U to perturbation? IBM, March 2004 p.17
63 Fidelity decay Quantum map U, e.g. U = exp{ iht}. How sensitive is U to perturbation? Perturbed quantum map U p, e.g. U p = U exp{ iδv } }{{} K IBM, March 2004 p.17
64 Fidelity decay Quantum map U, e.g. U = exp{ iht}. How sensitive is U to perturbation? Perturbed quantum map U p, e.g. U p = U exp{ iδv } }{{} K Fidelity after n steps (Lodschmidt echo): F n (ψ) = ψ (U n ) U n p ψ 2 IBM, March 2004 p.17
65 Fidelity decay Quantum map U, e.g. U = exp{ iht}. How sensitive is U to perturbation? Perturbed quantum map U p, e.g. U p = U exp{ iδv } }{{} K Fidelity after n steps (Lodschmidt echo): F n (ψ) = ψ (U n ) U n p ψ 2 State independent signature (average over ψ): F n = F n (ψ)dψ = T r{(u n ) U n p } 2 + N N 2 + N IBM, March 2004 p.17
66 Fidelity decay Peres conjecture: F n (ψ) is a signature of quantum chaos (dynamical instability). Chaotic systems have an exponential decay exp( Γn). Regular systems have a polynomial decay 1/poly(n). IBM, March 2004 p.18
67 Fidelity decay Peres conjecture: F n (ψ) is a signature of quantum chaos (dynamical instability). Chaotic systems have an exponential decay exp( Γn). Regular systems have a polynomial decay 1/poly(n). Fidelity decay measures the relative randomness of U and K. Universal response to perturbation. Simple perturbation produce good signature of quantum chaos. IBM, March 2004 p.18
68 Fidelity decay Peres conjecture: F n (ψ) is a signature of quantum chaos (dynamical instability). Chaotic systems have an exponential decay exp( Γn). Regular systems have a polynomial decay 1/poly(n). Fidelity decay measures the relative randomness of U and K. Universal response to perturbation. Simple perturbation produce good signature of quantum chaos. J. Emerson, Y.S. Weinstein, S. Lloyd, and D.G. Cory, 2002 IBM, March 2004 p.18
69 Trace circuit D. Poulin, R. Blume-Kohout, R. Laflamme, and H. Ollivier, l 2 n H H σ k U k = y : σ y = 1 N Im [T r{u}] k = z : σ z = 1 Re [T r{u}] N T r{(u n ) Up n } 2 + N F n = N 2, U p = UK + N IBM, March 2004 p.19
70 Trace circuit D. Poulin, R. Blume-Kohout, R. Laflamme, and H. Ollivier, l 2 n H H σ k U k = y : σ y = 1 N Im [T r{u}] k = z : σ z = 1 Re [T r{u}] N T r{(u n ) Up n } 2 + N F n = N 2, U p = UK + N All we have to do it replace U in the above circuit by (U n ) (UK) n. IBM, March 2004 p.19
71 Quantum circuit 0 H σ k 1l N U K U K... U K U U... U } {{ } n } {{ } n IBM, March 2004 p.20
72 Quantum circuit 0 1l N H U K U K... U K U U... U } {{ } n } {{ } n σ k Since the U s and U s annihilate each others when the K s are absent. IBM, March 2004 p.20
73 Quantum circuit 0 1l N H U K U K... U K } {{ } n σ k Since the U s and U s annihilate each others when the K s are absent. Since the U are made after the final measurement. IBM, March 2004 p.20
74 Quantum circuit 0 1l N H U K U K... U K } {{ } n σ k Since the U s and U s annihilate each others when the K s are absent. Since the U are made after the final measurement. Measure F n within accuracy ɛ with error probability p in time ( ) log(1/p) no T ɛ 2 IBM, March 2004 p.20
75 Quantum probe ρ 0 1l N U K U K... U K IBM, March 2004 p.21
76 Quantum probe ρ 0 1l N U K U K... U K Use a QIP to simulate a system with Hamiltonian H. IBM, March 2004 p.21
77 Quantum probe ρ 0 1l N U K U K... U K Use a QIP to simulate a system with Hamiltonian H. Use a quantum probe to investigate the dynamical stability of a system whose Hamiltonian is unknown. IBM, March 2004 p.21
78 Quantum probe ρ 0 1l N U K U K... U K Use a QIP to simulate a system with Hamiltonian H. Use a quantum probe to investigate the dynamical stability of a system whose Hamiltonian is unknown. H = j>1 J 1j Z 1 Z j + Unknown U {}}{ H(i, j 1) }{{} perturbation IBM, March 2004 p.21
79 Quantum probe ρ 0 1l N U K U K... U K Use a QIP to simulate a system with Hamiltonian H. Use a quantum probe to investigate the dynamical stability of a system whose Hamiltonian is unknown. H = j>1 J 1j Z 1 Z j + Unknown U {}}{ H(i, j 1) }{{} perturbation Small QIP can be use to perform experimental measurements which were unconceivable before (POVM). IBM, March 2004 p.21
80 Decoherence We use the circuit to model a system interacting with an environment, the system is initially in a pure state α 0 + β 1 : ρ 0 ρ n 1l N U K U K... U K IBM, March 2004 p.22
81 Decoherence We use the circuit to model a system interacting with an environment, the system is initially in a pure state α 0 + β 1 : ρ 0 ρ n 1l N U K U K... U K ρ 0 = ( α 2 αβ α β β 2 ) ρ n = ( α 2 αβ γ(n) α βγ(n) β 2 ) IBM, March 2004 p.22
82 Decoherence We use the circuit to model a system interacting with an environment, the system is initially in a pure state α 0 + β 1 : ρ 0 ρ n 1l N U K U K... U K ρ 0 = ( α 2 αβ α β β 2 ) ρ n = ( α 2 αβ γ(n) α βγ(n) β 2 ) γ(n) = { F n } 1/2: The decoherence rate is governed by the average fidelity decay rate of the environment! IBM, March 2004 p.22
83 Decoherence We use the circuit to model a system interacting with an environment, the system is initially in a pure state α 0 + β 1 : ρ 0 ρ n 1l N U K U K... U K ρ 0 = ( α 2 αβ α β β 2 ) ρ n = ( α 2 αβ γ(n) α βγ(n) β 2 ) γ(n) = { F n } 1/2: The decoherence rate is governed by the average fidelity decay rate of the environment! The decoherence rate depends on the strength of the coupling to the environment but also on the dynamics of the environment. IBM, March 2004 p.22
84 Entanglement α 0 + β 1 1l N U 1 K 1 U 2 K 2... U k K k IBM, March 2004 p.23
85 Entanglement α 0 + β 1 1l N U 1 K 1 U 2 K 2... U k K k Using the "phase kick-back", we see that the final state is ρ k = 1 N α j α j φ j φ j j where α j = α 0 + βe is j 1 and the e is j S = U k P k... U 2 P 2 U 1 P 1 U 1 U 2... U k. are the eigenvalues of IBM, March 2004 p.23
86 Entanglement α 0 + β 1 1l N U 1 K 1 U 2 K 2... U k K k Using the "phase kick-back", we see that the final state is ρ k = 1 N α j α j φ j φ j j where α j = α 0 + βe is j 1 and the e is j S = U k P k... U 2 P 2 U 1 P 1 U 1 U 2... U k. are the eigenvalues of This circuit does not produce any entanglement between the probe qubit and the rest, throughout the computation IBM, March 2004 p.23
87 Entanglement Decoherence does not require entanglement between the system and its environment: classical correlations are enough. IBM, March 2004 p.24
88 Entanglement Decoherence does not require entanglement between the system and its environment: classical correlations are enough. Is entanglement necessary for quantum computational speed-up? (If speed-up there is.) Pure states: YES. Mixed states:? This is an argument in favor of no... but not a proof. IBM, March 2004 p.24
89 Entanglement Decoherence does not require entanglement between the system and its environment: classical correlations are enough. Is entanglement necessary for quantum computational speed-up? (If speed-up there is.) Pure states: YES. Mixed states:? This is an argument in favor of no... but not a proof. Is there entanglement between other parts of the information processor? (Depends on the system of interest, i.e. U.) IBM, March 2004 p.24
90 Entanglement Decoherence does not require entanglement between the system and its environment: classical correlations are enough. Is entanglement necessary for quantum computational speed-up? (If speed-up there is.) Pure states: YES. Mixed states:? This is an argument in favor of no... but not a proof. Is there entanglement between other parts of the information processor? (Depends on the system of interest, i.e. U.) If no, is there a classical dynamics which can provide the sequence of "classical" states? IBM, March 2004 p.24
91 Conclusion DQC1 is interesting. Measure the form factors to learn about symmetries. Measure fidelity decay to learn about dynamical stability. Simple quantum information processors can help to perform experiments. Decoherence rate is influenced by the dynamical properties of the environment. Decoherence does not require entenglement. Entenglement is not the key ingredient to quantum computational speed-up. We can learn about fundamental physics by working on quantum computation, and vice versa. IBM, March 2004 p.25
Exploring Quantum Control with Quantum Information Processors
Exploring Quantum Control with Quantum Information Processors David Poulin Institute for Quantum Computing Perimeter Institute for Theoretical Physics Stanford University, April 2004 p.1 Outline Simulating
More informationExploring Quantum Chaos with Quantum Computers
Exploring Quantum Chaos with Quantum Computers Part II: Measuring signatures of quantum chaos on a quantum computer David Poulin Institute for Quantum Computing Perimeter Institute for Theoretical Physics
More informationTheory Component of the Quantum Computing Roadmap
3.2.4 Quantum simulation Quantum simulation represents, along with Shor s and Grover s algorithms, one of the three main experimental applications of quantum computers. Of the three, quantum simulation
More informationIt from Qubit Summer School
It from Qubit Summer School July 27 th, 2016 Tensor Networks Guifre Vidal NSERC Wednesday 27 th 9AM ecture Tensor Networks 2:30PM Problem session 5PM Focus ecture MARKUS HAURU MERA: a tensor network for
More informationThe quantum state tomography on an NMR system
Physics Letters A 305 (2002 349 353 www.elsevier.com/locate/pla The quantum state tomography on an NMR system Jae-Seung Lee Department of Physics, Korea Advanced Institute of Science and Technology, 373-1
More informationWigner function description of a qubit-oscillator system
Low Temperature Physics/Fizika Nizkikh Temperatur, 013, v. 39, No. 3, pp. 37 377 James Allen and A.M. Zagoskin Loughborough University, Loughborough, Leics LE11 3TU, UK E-mail: A.Zagoskin@eboro.ac.uk Received
More informationExperimental implementation of the quantum random-walk algorithm
PHYSICAL REVIEW A 67, 04216 200 Experimental implementation of the quantum random-walk algorithm Jiangfeng Du, 1,2, * Hui Li, 1 Xiaodong Xu, Mingjun Shi, 1 Jihui Wu, 4 Xianyi Zhou, 1 and Rongdian Han 1
More informationb) (5 points) Give a simple quantum circuit that transforms the state
C/CS/Phy191 Midterm Quiz Solutions October 0, 009 1 (5 points) Short answer questions: a) (5 points) Let f be a function from n bits to 1 bit You have a quantum circuit U f for computing f If you wish
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 informationUniversity of New Mexico
Quantum State Reconstruction via Continuous Measurement Ivan H. Deutsch, Andrew Silberfarb University of New Mexico Poul Jessen, Greg Smith University of Arizona Information Physics Group http://info.phys.unm.edu
More informationSuperconducting Qubits Lecture 4
Superconducting Qubits Lecture 4 Non-Resonant Coupling for Qubit Readout A. Blais, R.-S. Huang, A. Wallraff, S. M. Girvin, and R. J. Schoelkopf, PRA 69, 062320 (2004) Measurement Technique Dispersive Shift
More informationReversible and Quantum computing. Fisica dell Energia - a.a. 2015/2016
Reversible and Quantum computing Fisica dell Energia - a.a. 2015/2016 Reversible computing A process is said to be logically reversible if the transition function that maps old computational states to
More informationQUANTUM CHAOS IN NUCLEAR PHYSICS
QUANTUM CHAOS IN NUCLEAR PHYSICS Investigation of quantum chaos in nuclear physics is strongly hampered by the absence of even the definition of quantum chaos, not to mention the numerical criterion of
More informationObservations of Quantum Dynamics by Solution-State NMR Spectroscopy
arxiv:quant-ph/9905061v1 0 May 1999 Observations of Quantum Dynamics by Solution-State NMR Spectroscopy Marco Pravia, Evan Fortunato, Yaakov Weinstein, Mark D. Price, Grum Teklemariam, Richard J. Nelson,
More informationarxiv:quant-ph/ v2 24 Dec 2003
Quantum Entanglement in Heisenberg Antiferromagnets V. Subrahmanyam Department of Physics, Indian Institute of Technology, Kanpur, India. arxiv:quant-ph/0309004 v2 24 Dec 2003 Entanglement sharing among
More informationAn Inverse Mass Expansion for Entanglement Entropy. Free Massive Scalar Field Theory
in Free Massive Scalar Field Theory NCSR Demokritos National Technical University of Athens based on arxiv:1711.02618 [hep-th] in collaboration with Dimitris Katsinis March 28 2018 Entanglement and Entanglement
More informationINTRODUCTION TO NMR and NMR QIP
Books (NMR): Spin dynamics: basics of nuclear magnetic resonance, M. H. Levitt, Wiley, 2001. The principles of nuclear magnetism, A. Abragam, Oxford, 1961. Principles of magnetic resonance, C. P. Slichter,
More informationChapter 29. Quantum Chaos
Chapter 29 Quantum Chaos What happens to a Hamiltonian system that for classical mechanics is chaotic when we include a nonzero h? There is no problem in principle to answering this question: given a classical
More informationExperimental Realization of Shor s Quantum Factoring Algorithm
Experimental Realization of Shor s Quantum Factoring Algorithm M. Steffen1,2,3, L.M.K. Vandersypen1,2, G. Breyta1, C.S. Yannoni1, M. Sherwood1, I.L.Chuang1,3 1 IBM Almaden Research Center, San Jose, CA
More informationQuantum Many Body Systems and Tensor Networks
Quantum Many Body Systems and Tensor Networks Aditya Jain International Institute of Information Technology, Hyderabad aditya.jain@research.iiit.ac.in July 30, 2015 Aditya Jain (IIIT-H) Quantum Hamiltonian
More informationThe quantum way to diagonalize hermitean matrices
Fortschr. Phys. 51, No. 2 3, 249 254 (2003) / DOI 10.1002/prop.200310035 The quantum way to diagonalize hermitean matrices Stefan Weigert HuMP Hull Mathematical Physics, Department of Mathematics University
More informationNMR Quantum Information Processing and Entanglement
Quantum Information and Computation, Vol. 1, No. 0 (2001) 000 000 c Rinton Press NMR Quantum Information Processing and Entanglement Raymond Laflamme Department of Physics, University of Waterloo, Waterloo,
More informationIBM quantum experience: Experimental implementations, scope, and limitations
IBM quantum experience: Experimental implementations, scope, and limitations Plan of the talk IBM Quantum Experience Introduction IBM GUI Building blocks for IBM quantum computing Implementations of various
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 informationPhysics 4022 Notes on Density Matrices
Physics 40 Notes on Density Matrices Definition: For a system in a definite normalized state ψ > the density matrix ρ is ρ = ψ >< ψ 1) From Eq 1 it is obvious that in the basis defined by ψ > and other
More informationarxiv:quant-ph/ v5 6 Apr 2005
Nonunitary quantum circuit Hiroaki Terashima 1, and Masahito Ueda 1, arxiv:quant-ph/3461v5 6 Apr 5 1 Department of Physics, Tokyo Institute of Technology, Tokyo 15-8551, Japan CREST, Japan Science and
More informationENSEMBLE QUANTUM COMPUTING BY LIQUID-STATE NMR SPECTROSCOPY FINAL PROGRESS REPORT TIMOTHY F. HAVEL DAVID G. CORY OCTOBER 21, 2003
ENSEMBLE QUANTUM COMPUTING BY LIQUID-STATE NMR SPECTROSCOPY FINAL PROGRESS REPORT TIMOTHY F. HAVEL DAVID G. CORY OCTOBER 21, 2003 U.S. ARMY RESEARCH OFFICE DAAD19-01-1-0678 MASSACHUSETTS INSTITUTE OF TECHNOLOGY
More informationM. Grassl, Grundlagen der Quantenfehlerkorrektur, Universität Innsbruck, WS 2007/ , Folie 127
M Grassl, Grundlagen der Quantenfehlerkorrektur, Universität Innsbruck, WS 2007/2008 2008-01-11, Folie 127 M Grassl, Grundlagen der Quantenfehlerkorrektur, Universität Innsbruck, WS 2007/2008 2008-01-11,
More informationTime-dependent DMRG:
The time-dependent DMRG and its applications Adrian Feiguin Time-dependent DMRG: ^ ^ ih Ψ( t) = 0 t t [ H ( t) E ] Ψ( )... In a truncated basis: t=3 τ t=4 τ t=5τ t=2 τ t= τ t=0 Hilbert space S.R.White
More informationQuantum Hamiltonian Complexity. Itai Arad
1 18 / Quantum Hamiltonian Complexity Itai Arad Centre of Quantum Technologies National University of Singapore QIP 2015 2 18 / Quantum Hamiltonian Complexity condensed matter physics QHC complexity theory
More informationExperimental Methods for Quantum Control in Nuclear Spin Systems
Tim Havel and David Cory Dept. of Nuclear Engineering Massachusetts Institute of Technology Experimental Methods for Quantum Control in Nuclear Spin Systems Together with: Jonathan Baugh, Hyang Joon Cho,
More informationMany-Body Fermion Density Matrix: Operator-Based Truncation Scheme
Many-Body Fermion Density Matrix: Operator-Based Truncation Scheme SIEW-ANN CHEONG and C. L. HENLEY, LASSP, Cornell U March 25, 2004 Support: NSF grants DMR-9981744, DMR-0079992 The Big Picture GOAL Ground
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 informationQuantum Computation. Michael A. Nielsen. University of Queensland
Quantum Computation Michael A. Nielsen University of Queensland Goals: 1. To eplain the quantum circuit model of computation. 2. To eplain Deutsch s algorithm. 3. To eplain an alternate model of quantum
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 informationClassical and quantum simulation of dissipative quantum many-body systems
0 20 32 0 20 32 0 20 32 0 20 32 0 20 32 0 20 32 0 20 32 0 20 32 0 20 32 0 20 32 0 20 32 0 20 32 0 20 32 0 20 32 0 20 32 0 20 32 Classical and quantum simulation of dissipative quantum many-body systems
More informationComplexity and Spacetime
Complexity and Spacetime 1612.05439, 1706.03788 + to appear, with Alan Reynolds Simon Ross Centre for Particle Theory, Durham University 13 September 2017 Simon Ross (Durham) Complexity and Spacetime McGill
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 informationNuclear Magnetic Resonance Quantum Computing Using Liquid Crystal Solvents
Nuclear Magnetic Resonance Quantum Computing Using Liquid Crystal Solvents Costantino S. Yannoni, Mark H. Sherwood, Dolores C. Miller, and Isaac L. Chuang IBM Almaden Research Center, San Jose, CA 952
More informationQuantum Networks with Atomic Ensembles
Quantum Networks with Atomic Ensembles Daniel Felinto* dfelinto@df.ufpe.br C.W. Chou, H. Deng, K.S. Choi, H. de Riedmatten, J. Laurat, S. van Enk, H.J. Kimble Caltech Quantum Optics *Presently at Departamento
More informationFractal Fidelity as a signature of Quantum Chaos
Fractal Fidelity as a signature of Quantum Chaos Franco Pellegrini and Simone Montangero,2 NEST-CNR-INFM & Scuola Normale Superiore, Piazza dei Cavalieri 7, I-5626 Pisa, Italy 2 Institut für Theoretische
More informationDetecting and using Majorana fermions in superconductors
Detecting and using Majorana fermions in superconductors Anton Akhmerov with Carlo Beenakker, Jan Dahlhaus, Fabian Hassler, and Michael Wimmer New J. Phys. 13, 053016 (2011) and arxiv:1105.0315 Superconductor
More informationLandau s Fermi Liquid Theory
Thors Hans Hansson Stockholm University Outline 1 Fermi Liquids Why, What, and How? Why Fermi liquids? What is a Fermi liquids? Fermi Liquids How? 2 Landau s Phenomenological Approach The free Fermi gas
More informationSome Introductory Notes on Quantum Computing
Some Introductory Notes on Quantum Computing Markus G. Kuhn http://www.cl.cam.ac.uk/~mgk25/ Computer Laboratory University of Cambridge 2000-04-07 1 Quantum Computing Notation Quantum Computing is best
More informationRedundant Information and the Quantum-Classical Transition
University of California, Santa Barbara 22 August 2012 Redundant Information and the Quantum-Classical Transition C. Jess Riedel Acting advisor: Wojciech H. Zurek Theoretical Division Los Alamos National
More informationOptimal quantum driving of a thermal machine
Optimal quantum driving of a thermal machine Andrea Mari Vasco Cavina Vittorio Giovannetti Alberto Carlini Workshop on Quantum Science and Quantum Technologies ICTP, Trieste, 12-09-2017 Outline 1. Slow
More informationHolographic Geometries from Tensor Network States
Holographic Geometries from Tensor Network States J. Molina-Vilaplana 1 1 Universidad Politécnica de Cartagena Perspectives on Quantum Many-Body Entanglement, Mainz, Sep 2013 1 Introduction & Motivation
More informationRequirements for scaleable QIP
p. 1/25 Requirements for scaleable QIP These requirements were presented in a very influential paper by David Divincenzo, and are widely used to determine if a particular physical system could potentially
More informationQuantum computing and quantum information KAIS GROUP
Quantum computing and quantum information KAIS GROUP Main themes Quantum algorithms. In particular for quantum chemistry arxiv:1004.2242 [cs.ne] arxiv:1009.5625 [quant-ph] arxiv:1307.7220 [quant-ph] arxiv:1302.1946
More informationThreshold theorem for quantum supremacy arxiv:
2017.1.16-20 QIP2017 Seattle, USA Threshold theorem for quantum supremacy arxiv:1610.03632 Keisuke Fujii Photon Science Center, The University of Tokyo /PRESTO, JST 2017.1.16-20 QIP2017 Seattle, USA Threshold
More informationDNP in Quantum Computing Eisuke Abe Spintronics Research Center, Keio University
DNP in Quantum Computing Eisuke Abe Spintronics Research Center, Keio University 207.08.25 Future of Hyper-Polarized Nuclear Spins @IPR, Osaka DNP in quantum computing Molecule Pseudo-pure state Algorithmic
More informationQuantum Chaos and Nonunitary Dynamics
Quantum Chaos and Nonunitary Dynamics Karol Życzkowski in collaboration with W. Bruzda, V. Cappellini, H.-J. Sommers, M. Smaczyński Phys. Lett. A 373, 320 (2009) Institute of Physics, Jagiellonian University,
More informationDecoherence and Thermalization of Quantum Spin Systems
Copyright 2011 American Scientific Publishers All rights reserved Printed in the United States of America Journal of Computational and Theoretical Nanoscience Vol. 8, 1 23, 2011 Decoherence and Thermalization
More informationThe Postulates of Quantum Mechanics
p. 1/23 The Postulates of Quantum Mechanics We have reviewed the mathematics (complex linear algebra) necessary to understand quantum mechanics. We will now see how the physics of quantum mechanics fits
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 informationThermalization in Quantum Systems
Thermalization in Quantum Systems Jonas Larson Stockholm University and Universität zu Köln Dresden 18/4-2014 Motivation Long time evolution of closed quantum systems not fully understood. Cold atom system
More informationRobust Characterization of Quantum Processes
Robust Characterization of Quantum Processes Shelby Kimmel Center for Theoretical Physics, MIT Marcus da Silva, Colm Ryan, Blake Johnson, Tom Ohki Raytheon BBN Technologies JQI Monday Dec. 16 Why don t
More informationarxiv: v2 [quant-ph] 22 Aug 2017
Implementation of Multiparty quantum clock synchronization Xiangyu Kong, 1 Tao Xin, 1 ShiJie Wei, 1 Bixue Wang, 1 Yunzhao Wang, 1 Keren Li, 1 and GuiLu Long 1, 1 State Key Laboratory of Low-Dimensional
More informationINTRODUCTION TO NMR and NMR QIP
Books (NMR): Spin dynamics: basics of nuclear magneac resonance, M. H. LeviF, Wiley, 200. The principles of nuclear magneasm, A. Abragam, Oxford, 96. Principles of magneac resonance, C. P. Slichter, Springer,
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 informationSplitting of a Cooper pair by a pair of Majorana bound states
Chapter 7 Splitting of a Cooper pair by a pair of Majorana bound states 7.1 Introduction Majorana bound states are coherent superpositions of electron and hole excitations of zero energy, trapped in the
More informationTime Evolving Block Decimation Algorithm
Time Evolving Block Decimation Algorithm Application to bosons on a lattice Jakub Zakrzewski Marian Smoluchowski Institute of Physics and Mark Kac Complex Systems Research Center, Jagiellonian University,
More informationEmergence of objective properties from subjective quantum states: Environment as a witness
Emergence of objective properties from subjective quantum states: Environment as a witness David Poulin Institute for Quantum Computing Perimeter Institute for Theoretical Physics Quantum Computing-Quantum
More informationQuantum control of dissipative systems. 1 Density operators and mixed quantum states
Quantum control of dissipative systems S. G. Schirmer and A. I. Solomon Quantum Processes Group, The Open University Milton Keynes, MK7 6AA, United Kingdom S.G.Schirmer@open.ac.uk, A.I.Solomon@open.ac.uk
More informationError Classification and Reduction in Solid State Qubits
Southern Illinois University Carbondale OpenSIUC Honors Theses University Honors Program 5-15 Error Classification and Reduction in Solid State Qubits Karthik R. Chinni Southern Illinois University Carbondale,
More informationSmall bits of cold, dense matter
Small bits of cold, dense matter Alessandro Roggero (LANL) with: S.Gandolfi & J.Carlson (LANL), J.Lynn (TUD) and S.Reddy (INT) ArXiv:1712.10236 Nuclear ab initio Theories and Neutrino Physics INT - Seattle
More informationPHYSICAL REVIEW A, 66,
PHYSICAL REVIEW A, 66, 022313 2002 Quantum-information processing by nuclear magnetic resonance: Experimental implementation of half-adder and subtractor operations using an oriented spin-7õ2 system K.
More informationSupplementary Information for
Supplementary Information for Ultrafast Universal Quantum Control of a Quantum Dot Charge Qubit Using Landau-Zener-Stückelberg Interference Gang Cao, Hai-Ou Li, Tao Tu, Li Wang, Cheng Zhou, Ming Xiao,
More informationNMR quantum information processing
NMR quantum information processing Dawei Lu 1, Aharon Brodutch 1, Jihyun Park 1, Hemant Katiyar 1, Tomas Jochym-O'Connor 1 1, 2, 3, and Raymond Laflamme 1 Institute for Quantum Computing and Department
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 Fields, Gravity, and Complexity. Brian Swingle UMD WIP w/ Isaac Kim, IBM
Quantum Fields, Gravity, and Complexity Brian Swingle UMD WIP w/ Isaac Kim, IBM Influence of quantum information Easy Hard (at present) Easy Hard (at present)!! QI-inspired classical, e.g. tensor networks
More informationQuantum error correction for continuously detected errors
Quantum error correction for continuously detected errors Charlene Ahn, Toyon Research Corporation Howard Wiseman, Griffith University Gerard Milburn, University of Queensland Quantum Information and Quantum
More informationUniversal quantum logic from Zeeman and anisotropic exchange interactions
Universal quantum logic from Zeeman and anisotropic exchange interactions Lian-Ao Wu and Daniel A. Lidar Chemical Physics Theory Group, Chemistry Department, University of Toronto, 80 St. George Street,
More informationarxiv: v1 [quant-ph] 4 Jul 2008
Efficiency of Producing Random Unitary Matrices with Quantum Circuits Ludovic Arnaud and Daniel Braun Laboratoire de Physique Théorique IRSAMC, UPS and CNRS, Université de Toulouse, F-3162 Toulouse, FRANCE
More informationThe detectability lemma and quantum gap amplification
The detectability lemma and quantum gap amplification Dorit Aharonov 1, Itai Arad 1, Zeph Landau 2 and Umesh Vazirani 2 1 School of Computer Science and Engineering, The Hebrew University, Jerusalem, Israel
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 informationEntanglement creation and characterization in a trapped-ion quantum simulator
Time Entanglement creation and characterization in a trapped-ion quantum simulator Christian Roos Institute for Quantum Optics and Quantum Information Innsbruck, Austria Outline: Highly entangled state
More informationQuantum Error Correction Codes - From Qubit to Qudit
Quantum Error Correction Codes - From Qubit to Qudit Xiaoyi Tang Paul McGuirk December 7, 005 1 Introduction Quantum computation (QC), with inherent parallelism from the superposition principle of quantum
More informationPARAMAGNETIC MATERIALS AND PRACTICAL ALGORITHMIC COOLING FOR NMR QUANTUM COMPUTING
st Reading International Journal of Quantum Information Vol., No. (2) c World Scientific Publishing Company PARAMAGNETIC MATERIALS AND PRACTICAL ALGORITHMIC COOLING FOR NMR QUANTUM COMPUTING JOSÉ M. FERNANDEZ
More informationA scheme for protecting one-qubit information against erasure. error. Abstract
A scheme for protecting one-qubit information against erasure error Chui-Ping Yang 1, Shih-I Chu 1, and Siyuan Han 1 Department of Chemistry, University of Kansas, and Kansas Center for Advanced Scientific
More informationNoise-resilient quantum circuits
Noise-resilient quantum circuits Isaac H. Kim IBM T. J. Watson Research Center Yorktown Heights, NY Oct 10th, 2017 arxiv:1703.02093, arxiv:1703.00032, arxiv:17??.?????(w. Brian Swingle) Why don t we have
More informationThe arrow of time, black holes, and quantum mixing of large N Yang-Mills theories
The arrow of time, black holes, and quantum mixing of large N Yang-Mills theories Hong Liu Massachusetts Institute of Technology based on Guido Festuccia, HL, to appear The arrow of time and space-like
More informationShared Purity of Multipartite Quantum States
Shared Purity of Multipartite Quantum States Anindya Biswas Harish-Chandra Research Institute December 3, 2013 Anindya Biswas (HRI) Shared Purity December 3, 2013 1 / 38 Outline of the talk 1 Motivation
More informationQuantum Mechanics C (130C) Winter 2014 Assignment 7
University of California at San Diego Department of Physics Prof. John McGreevy Quantum Mechanics C (130C) Winter 014 Assignment 7 Posted March 3, 014 Due 11am Thursday March 13, 014 This is the last problem
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 informationSUPPLEMENTARY INFORMATION
Superconducting qubit oscillator circuit beyond the ultrastrong-coupling regime S1. FLUX BIAS DEPENDENCE OF THE COUPLER S CRITICAL CURRENT The circuit diagram of the coupler in circuit I is shown as the
More informationLikewise, any operator, including the most generic Hamiltonian, can be written in this basis as H11 H
Finite Dimensional systems/ilbert space Finite dimensional systems form an important sub-class of degrees of freedom in the physical world To begin with, they describe angular momenta with fixed modulus
More informationStatistics and Quantum Computing
Statistics and Quantum Computing Yazhen Wang Department of Statistics University of Wisconsin-Madison http://www.stat.wisc.edu/ yzwang Workshop on Quantum Computing and Its Application George Washington
More informationError tolerance in an NMR Implementation of Grover s Fixed-Point Quantum Search Algorithm
Error tolerance in an NMR Implementation of Grover s Fixed-Point Quantum Search Algorithm Li Xiao and Jonathan A. Jones Centre for Quantum Computation, Clarendon Laboratory, University of Oxford, Parks
More informationQuantum Information Science (QIS)
Quantum Information Science (QIS) combination of three different fields: Quantum Physics QIS Computer Science Information Theory Lecture 1 - Outline 1. Quantum Mechanics 2. Computer Science History 3.
More informationROBUST DYNAMICAL DECOUPLING: FEEDBACK-FREE ERROR CORRECTION*
\fr International Journal of Quantum Information»»»», ui M C *'f Vol. 3, Supplement (2005) 41-52 _,, _,, m ' ^^ \ i wfr www.worlasctentifig.com World Scientific Publishing Company ROBUST DYNAMICAL DECOUPLING:
More informationQuantum 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 informationSupplementary information for Quantum delayed-choice experiment with a beam splitter in a quantum superposition
Supplementary information for Quantum delayed-choice experiment with a beam splitter in a quantum superposition Shi-Biao Zheng 1, You-Peng Zhong 2, Kai Xu 2, Qi-Jue Wang 2, H. Wang 2, Li-Tuo Shen 1, Chui-Ping
More informationBipartite and Tripartite Entanglement in a Three-Qubit Heisenberg Model
Commun. Theor. Phys. (Beijing, China) 46 (006) pp. 969 974 c International Academic Publishers Vol. 46, No. 6, December 5, 006 Bipartite and Tripartite Entanglement in a Three-Qubit Heisenberg Model REN
More informationQuantum Marginal Problems
Quantum Marginal Problems David Gross (Colgone) Joint with: Christandl, Doran, Lopes, Schilling, Walter Outline Overview: Marginal problems Overview: Entanglement Main Theme: Entanglement Polytopes Shortly:
More informationQuantum process tomography of a controlled-not gate
Quantum process tomography of a controlled-not gate J. L. O Brien,,, G. J. Pryde,,, A. Gilchrist, D. F. V. James, 3 N. K. Langford,, T. C. Ralph, and A. G. White, These authors contributed equally to this
More informationThe Entanglement Frontier
The Entanglement Frontier John Preskill, Caltech QuEST, 28 March 2011 HEP: What underlying theory explains the observed elementary particles and their interactions, including gravity? QIS: Can we control
More informationQMA(2) workshop Tutorial 1. Bill Fefferman (QuICS)
QMA(2) workshop Tutorial 1 Bill Fefferman (QuICS) Agenda I. Basics II. Known results III. Open questions/next tutorial overview I. Basics I.1 Classical Complexity Theory P Class of problems efficiently
More informationMagnetic Resonance in Quantum Information
Magnetic Resonance in Quantum Information Christian Degen Spin Physics and Imaging group Laboratory for Solid State Physics www.spin.ethz.ch Content Features of (nuclear) magnetic resonance Brief History
More informationTHE INTERFEROMETRIC POWER OF QUANTUM STATES GERARDO ADESSO
THE INTERFEROMETRIC POWER OF QUANTUM STATES GERARDO ADESSO IDENTIFYING AND EXPLORING THE QUANTUM-CLASSICAL BORDER Quantum Classical FOCUSING ON CORRELATIONS AMONG COMPOSITE SYSTEMS OUTLINE Quantum correlations
More information