analysis of quantum entanglement in quantum programs
play

Analysis of Quantum Entanglement in Quantum Programs using - PowerPoint PPT Presentation

Jan 26, 2024 •21 likes •1.25k views

Analysis of Quantum Entanglement in Quantum Programs using Stabilizer Formalism The University of Tokyo Kentaro Honda Purpose Analyse how separated the output of a program are. q0 := | 0 i ; q1 := | 0 i ; q2 := | 0 i ; q3 := | 1 i ; H q3; H

  1. J · K \ Abstract Semantics q0 := | 1 i ; q1 := | 0 i ; | 100 i q2 := | 0 i ; H q2; T q1; H q0; q0 q1 q2 T q2; CX q1, q2; q0 Z CX q2, q0; CX q0, q1; q1 Z q2 Z

  2. J · K \ Abstract Semantics q0 := | 1 i ; q1 := | 0 i ; | 10+ i q2 := | 0 i ; H q2; T q1; H q0; q0 q1 q2 T q2; CX q1, q2; q0 Z CX q2, q0; CX q0, q1; q1 Z q2 X

  3. J · K \ Abstract Semantics q0 := | 1 i ; q1 := | 0 i ; | 10+ i q2 := | 0 i ; H q2; T q1; H q0; q0 q1 q2 T q2; CX q1, q2; q0 Z CX q2, q0; CX q0, q1; q1 Z q2 X

  4. J · K \ Abstract Semantics q0 := | 1 i ; q1 := | 0 i ; | � 0+ i q2 := | 0 i ; H q2; T q1; H q0; q0 q1 q2 T q2; CX q1, q2; q0 X CX q2, q0; CX q0, q1; q1 Z q2 X

  5. J · K \ Abstract Semantics q0 := | 1 i ; q1 := | 0 i ; 1 2 | � 0 i ( | 0 i + e i π 4 | 1 i ) p q2 := | 0 i ; H q2; T q1; H q0; q0 q1 q2 T q2; CX q1, q2; q0 X CX q2, q0; CX q0, q1; q1 Z q2 >

  6. J · K \ Abstract Semantics q0 := | 1 i ; q1 := | 0 i ; 1 2 | � 0 i ( | 0 i + e i π 4 | 1 i ) p q2 := | 0 i ; H q2; T q1; H q0; q0 q1 q2 T q2; CX q1, q2; q0 X CX q2, q0; CX q0, q1; q1 Z q2 >

  7. J · K \ Abstract Semantics q0 := | 1 i ; q1 := | 0 i ; 1 2 | � 0 i ( | 0 i � e i π 4 | 1 i ) p q2 := | 0 i ; H q2; T q1; H q0; q0 q1 q2 T q2; CX q1, q2; q0 X CX q2, q0; CX q0, q1; q1 Z q2 >

  8. J · K \ Abstract Semantics q0 := | 1 i ; q1 := | 0 i ; 1 2( | 00 i � | 11 i )( | 0 i � e i π 4 | 1 i ) q2 := | 0 i ; H q2; T q1; H q0; q0 q1 q2 T q2; CX q1, q2; q0 > CX q2, q0; CX q0, q1; q1 > q2 >

  9. Soundness [Perdrix08] ∀ ρ : quantum state ∀ ( π , b ) ∈ A Q ∀ C : program ( π , b ) ✏ ρ ⇒ J C K \ ( π , b ) ✏ J C K ( ρ )

  10. Soundness [Perdrix08] ∀ ρ : quantum state ∀ ( π , b ) ∈ A Q ∀ C : program ( π , b ) ✏ ρ ⇒ J C K \ ( π , b ) ✏ J C K ( ρ ) valid approximation valid approximation

  11. J · K \ Abstract Semantics q0 := | 1 i ; q1 := | 0 i ; 1 2( | 00 i � | 11 i )( | 0 i � e i π 4 | 1 i ) q2 := | 0 i ; H q2; T q1; H q0; q0 q1 q2 T q2; CX q1, q2; q0 > CX q2, q0; CX q0, q1; q1 > q2 >

  12. J · K \ Abstract Semantics q0 := | 1 i ; q1 := | 0 i ; 1 2( | 00 i � | 11 i )( | 0 i � e i π 4 | 1 i ) q2 := | 0 i ; H q2; T q1; H q0; q0 q1 q2 T q2; CX q1, q2; q0 > CX q2, q0; CX q0, q1; q1 > CX q1, q0; q2 > CX q1, q2;

  13. Previous work • Measured qubit is separated from the others [Perdrix07] • Multi-qubit gate may entangle qubits [Perdrix07] • Restriction to CX gate [Perdrix08][Prost&Zerrari09] • C-qubit / preserves separability [Perdrix08][Prost&Zerrari09] | 0 i | 1 i • T-qubit preserves separability [Perdrix08] |± i • Type system, Abstract interpretation, Hoare-like logic [Perdrix07] [Perdrix08] [Prost&Zerrari09]

  14. J · K \ Abstract Semantics q0 := | 1 i ; q1 := | 0 i ; 1 2( | 00 i � | 11 i )( | 0 i � e i π 4 | 1 i ) q2 := | 0 i ; H q2; T q1; H q0; q0 q1 q2 T q2; CX q1, q2; q0 > CX q2, q0; CX q0, q1; q1 > CX q1, q0; q2 > CX q1, q2;

  15. J · K \ Abstract Semantics q0 := | 1 i ; q1 := | 0 i ; 1 2 | 0 �i ( | 0 i � e i π 4 | 1 i ) p q2 := | 0 i ; H q2; T q1; H q0; q0 q1 q2 T q2; CX q1, q2; q0 > CX q2, q0; CX q0, q1; q1 > CX q1, q0; q2 > CX q1, q2;

  16. J · K \ Abstract Semantics q0 := | 1 i ; 1 q1 := | 0 i ; 2 | 0 i ( | 00 i � e i π 4 | 01 i q2 := | 0 i ; + e i π 4 | 10 i � | 11 i ) H q2; T q1; H q0; q0 q1 q2 T q2; CX q1, q2; q0 > CX q2, q0; CX q0, q1; q1 > CX q1, q0; q2 > CX q1, q2;

  17. Previous work • Measured qubit is separated from the others [Perdrix07] • Multi-qubit gate may entangle qubits [Perdrix07] • Restriction to CX gate [Perdrix08][Prost&Zerrari09] • C-qubit / preserves separability [Perdrix08][Prost&Zerrari09] | 0 i | 1 i • T-qubit preserves separability [Perdrix08] |± i • Type system, Abstract interpretation, Hoare-like logic [Perdrix07] [Perdrix08] [Prost&Zerrari09]

  18. Previous work • Measured qubit is separated from the others [Perdrix07] • Multi-qubit gate may entangle qubits [Perdrix07] disentangle • Restriction to CX gate [Perdrix08][Prost&Zerrari09] • C-qubit / preserves separability [Perdrix08][Prost&Zerrari09] | 0 i | 1 i • T-qubit preserves separability [Perdrix08] |± i • Type system, Abstract interpretation, Hoare-like logic [Perdrix07] [Perdrix08] [Prost&Zerrari09]

  19. J · K \ Abstract Semantics q0 := | + i ; ρ q1 := | 0 i ; q2 := | 0 i ; CX q0, q1; q0 q1 q2 CX q1, q2; q0 − q1 − q2 −

  20. J · K \ Abstract Semantics q0 := | + i ; | +00 i q1 := | 0 i ; q2 := | 0 i ; CX q0, q1; q0 q1 q2 CX q1, q2; q0 X q1 Z q2 Z

  21. J · K \ Abstract Semantics 1 q0 := | + i ; p 2( | 00 i + | 11 i ) | 0 i q1 := | 0 i ; q2 := | 0 i ; CX q0, q1; q0 q1 q2 CX q1, q2; q0 > q1 > q2 Z

  22. J · K \ Abstract Semantics 1 q0 := | + i ; p 2( | 000 i + | 111 i ) q1 := | 0 i ; q2 := | 0 i ; CX q0, q1; q0 q1 q2 CX q1, q2; q0 > q1 > q2 >

  23. J · K \ Abstract Semantics 1 q0 := | + i ; p 2( | 000 i + | 111 i ) q1 := | 0 i ; q2 := | 0 i ; CX q0, q1; q0 q1 q2 CX q1, q2; meas q0; q0 > q1 > q2 >

  24. Previous work • Measured qubit is separated from the others [Perdrix07] • Multi-qubit gate may entangle qubits [Perdrix07] • Restriction to CX gate [Perdrix08][Prost&Zerrari09] • C-qubit / preserves separability [Perdrix08][Prost&Zerrari09] | 0 i | 1 i • T-qubit preserves separability [Perdrix08] |± i • Type system, Abstract interpretation, Hoare-like logic [Perdrix07] [Perdrix08] [Prost&Zerrari09]

  25. J · K \ Abstract Semantics 1 q0 := | + i ; p 2( | 000 i + | 111 i ) q1 := | 0 i ; q2 := | 0 i ; CX q0, q1; q0 q1 q2 CX q1, q2; meas q0; q0 > q1 > q2 >

  26. J · K \ Abstract Semantics 1 q0 := | + i ; 2( | 000 i h 000 | + | 111 i h 111 | ) q1 := | 0 i ; q2 := | 0 i ; CX q0, q1; q0 q1 q2 CX q1, q2; meas q0; q0 Z q1 > q2 >

  27. Previous work • Measured qubit is separated from the others [Perdrix07] • Multi-qubit gate may entangle qubits [Perdrix07] • Restriction to CX gate [Perdrix08][Prost&Zerrari09] • C-qubit / preserves separability [Perdrix08][Prost&Zerrari09] | 0 i | 1 i • T-qubit preserves separability [Perdrix08] |± i • Type system, Abstract interpretation, Hoare-like logic [Perdrix07] [Perdrix08] [Prost&Zerrari09]

  28. Previous work • Measured qubit is separated from the others [Perdrix07] Measurement may affect unmeasured qubits • Multi-qubit gate may entangle qubits [Perdrix07] • Restriction to CX gate [Perdrix08][Prost&Zerrari09] • C-qubit / preserves separability [Perdrix08][Prost&Zerrari09] | 0 i | 1 i • T-qubit preserves separability [Perdrix08] |± i • Type system, Abstract interpretation, Hoare-like logic [Perdrix07] [Perdrix08] [Prost&Zerrari09]

  29. Observation • Multi-qubit gate may undo entangled qubits • Measurement may destroy multipartite entanglement

  30. Observation • Multi-qubit gate may undo entangled qubits • Measurement may destroy multipartite entanglement • Information about entangled qubits is needed • Semantics should be easily computable

  31. Observation • Multi-qubit gate may undo entangled qubits • Measurement may destroy multipartite entanglement • Information about entangled qubits is needed • Semantics should be easily computable Stabilizer Formalism

  32. Stabilizer Formalism standard stabilizer { P | P : Pauli matrix | ψ i = α 0 ··· 00 | 0 · · · 00 i s.t. P | ψ i = | ψ i } + · · · + α 1 ··· 11 | 1 · · · 11 i e.g. { III , XXX , − ZZI , − IZZ , 1 p 2( | 010 i + | 101 i ) ZIZ , YYX , − YXY , XYY }

  33. Stabilizer Formalism standard stabilizer { P | P : Pauli matrix | ψ i = α 0 ··· 00 | 0 · · · 00 i s.t. P | ψ i = | ψ i } + · · · + α 1 ··· 11 | 1 · · · 11 i e.g. { III , XXX , − ZZI , − IZZ , 1 p 2( | 010 i + | 101 i ) ZIZ , YYX , − YXY , XYY }   X X X + Z Z I −   Z I Z +

  34. Stabilizer Formalism standard stabilizer { P | P : Pauli matrix | ψ i = α 0 ··· 00 | 0 · · · 00 i s.t. P | ψ i = | ψ i } + · · · + α 1 ··· 11 | 1 · · · 11 i e.g. { III , XXX , − ZZI , − IZZ , 1 p 2( | 010 i + | 101 i ) ZIZ , YYX , − YXY , XYY }   X X X + Z Z I −   Z I Z +

  35. Stabilizer Formalism standard stabilizer { P | P : Pauli matrix | ψ i = α 0 ··· 00 | 0 · · · 00 i s.t. P | ψ i = | ψ i } + · · · + α 1 ··· 11 | 1 · · · 11 i e.g. { III , XXX , − ZZI , − IZZ , 1 p 2( | 010 i + | 101 i ) ZIZ , YYX , − YXY , XYY }   X X X + X | ψ a i h ψ a | ⌦ ρ a ρ = Z Z I −   a Z I Z +

  36. Stabilizer Formalism standard stabilizer { P | P : Pauli matrix | ψ i = α 0 ··· 00 | 0 · · · 00 i s.t. P | ψ i = | ψ i } + · · · + α 1 ··· 11 | 1 · · · 11 i e.g. { III , XXX , − ZZI , − IZZ , 1 p 2( | 010 i + | 101 i ) ZIZ , YYX , − YXY , XYY }   h GHZ | σ 0 ρ = p 0 | GHZ i X X X + Z Z I h GHZ | (IIX) σ 1 + p 1 (IIX) | GHZ i −   Z I Z + + · · ·

  37. Our Abstract Domain C Q Partition with stabilizers

  38. Our Abstract Domain C Q Partition with stabilizers q0 q1 q2

  39. Our Abstract Domain C Q Partition with stabilizers q0 q1 q2  X � [Z] X Z Z

  40. Our Abstract Domain C Q Partition with stabilizers q0 q1 q2  X � X ⌅ Z Z

  41. Our Abstract Domain C Q Partition with stabilizers q0 q1 q2  X � X ⌅ Z Z may be a non-stabilizer state

  42. Our Abstract Domain C Q Partition with stabilizers q0 q1 q2  X � X ⌅ Z Z

  43. Our Abstract Domain C Q Partition with stabilizers q0 q1 q2 ⌅ ⌅

  44. Our Abstract Domain C Q Partition with stabilizers q0 q1 q2 ⌅ ⌅ J C K C : C Q → C Q

  45. Abstract Semantics J · K C q0 := | 1 i ; q1 := | 0 i ; | 100 i q2 := | 0 i ; H q2; T q1; H q0; q0 q1 q2 T q2; CX q1, q2; CX q2, q0; [Z] [Z] [Z] CX q0, q1; CX q1, q0; CX q1, q2;

  46. Abstract Semantics J · K C q0 := | 1 i ; q1 := | 0 i ; | 10+ i q2 := | 0 i ; H q2; T q1; H q0; q0 q1 q2 T q2; CX q1, q2; CX q2, q0; [Z] [Z] [X] CX q0, q1; CX q1, q0; CX q1, q2;

  47. Abstract Semantics J · K C q0 := | 1 i ; q1 := | 0 i ; | 10+ i q2 := | 0 i ; H q2; T q1; H q0; q0 q1 q2 T q2; CX q1, q2; CX q2, q0; [Z] [Z] [X] CX q0, q1; CX q1, q0; CX q1, q2;

  48. Abstract Semantics J · K C q0 := | 1 i ; q1 := | 0 i ; | � 0+ i q2 := | 0 i ; H q2; T q1; H q0; q0 q1 q2 T q2; CX q1, q2; CX q2, q0; [X] [Z] [X] CX q0, q1; CX q1, q0; CX q1, q2;

  49. Abstract Semantics J · K C q0 := | 1 i ; q1 := | 0 i ; 1 2 | � 0 i ( | 0 i + e i π 4 | 1 i ) p q2 := | 0 i ; H q2; T q1; H q0; q0 q1 q2 T q2; CX q1, q2; CX q2, q0; [X] [Z] ⌅ CX q0, q1; CX q1, q0; CX q1, q2;

  50. Abstract Semantics J · K C q0 := | 1 i ; q1 := | 0 i ; 1 2 | � 0 i ( | 0 i + e i π 4 | 1 i ) p q2 := | 0 i ; H q2; T q1; H q0; q0 q1 q2 T q2; CX q1, q2; CX q2, q0; [X] [Z] ⌅ CX q0, q1; CX q1, q0; CX q1, q2;

  51. Abstract Semantics J · K C q0 := | 1 i ; q1 := | 0 i ; 1 2 | � 0 i ( | 0 i � e i π 4 | 1 i ) p q2 := | 0 i ; H q2; T q1; H q0; q0 q1 q2 T q2; CX q1, q2; CX q2, q0; [X] [Z] ⌅ CX q0, q1; CX q1, q0; CX q1, q2;

  52. Abstract Semantics J · K C q0 := | 1 i ; q1 := | 0 i ; 1 2( | 00 i � | 11 i )( | 0 i � e i π 4 | 1 i ) q2 := | 0 i ; H q2; T q1; H q0; q0 q1 q2 T q2; CX q1, q2;  X CX q2, q0; � X ⌅ CX q0, q1; Z Z CX q1, q0; CX q1, q2;

  53. Abstract Semantics J · K C q0 := | 1 i ; q1 := | 0 i ; 1 2 | 0 �i ( | 0 i � e i π 4 | 1 i ) p q2 := | 0 i ; H q2; T q1; H q0; q0 q1 q2 T q2; CX q1, q2;  I CX q2, q0; � X ⌅ CX q0, q1; Z I CX q1, q0; CX q1, q2;

  54. Abstract Semantics J · K C q0 := | 1 i ; q1 := | 0 i ; 1 2 | 0 �i ( | 0 i � e i π 4 | 1 i ) p q2 := | 0 i ; H q2; T q1; H q0; q0 q1 q2 T q2; CX q1, q2; CX q2, q0; [Z] [X] ⌅ CX q0, q1; CX q1, q0; CX q1, q2;

  55. Abstract Semantics J · K C q0 := | 1 i ; 1 q1 := | 0 i ; 2 | 0 i ( | 00 i � e i π 4 | 01 i q2 := | 0 i ; + e i π 4 | 10 i � | 11 i ) H q2; T q1; H q0; q0 q1 q2 T q2; CX q1, q2; CX q2, q0; [Z] ⌅ CX q0, q1; CX q1, q0; CX q1, q2;

  56. J · K C Abstract Semantics q0 := | + i ; | +00 i q1 := | 0 i ; q2 := | 0 i ; CX q0, q1; q0 q1 q2 CX q1, q2; meas q0; [X] [Z] [Z]

  57. J · K C Abstract Semantics 1 q0 := | + i ; p 2( | 00 i + | 11 i ) | 0 i q1 := | 0 i ; q2 := | 0 i ; CX q0, q1; q0 q1 q2 CX q1, q2; meas q0;  X � [Z] X Z Z

  58. J · K C Abstract Semantics 1 q0 := | + i ; p 2( | 000 i + | 111 i ) q1 := | 0 i ; q2 := | 0 i ; CX q0, q1; q0 q1 q2 CX q1, q2; meas q0;   X X X Z Z I   I Z Z

  59. J · K C Abstract Semantics 1 q0 := | + i ; 2( | 000 i h 000 | + | 111 i h 111 | ) q1 := | 0 i ; q2 := | 0 i ; CX q0, q1; q0 q1 q2 CX q1, q2; meas q0;   Z I I Z Z I   I Z Z

  60. J · K C Abstract Semantics 1 q0 := | + i ; 2( | 000 i h 000 | + | 111 i h 111 | ) q1 := | 0 i ; q2 := | 0 i ; CX q0, q1; q0 q1 q2 CX q1, q2; meas q0;   Z I I I Z I   I I Z

  61. J · K C Abstract Semantics 1 q0 := | + i ; 2( | 000 i h 000 | + | 111 i h 111 | ) q1 := | 0 i ; q2 := | 0 i ; CX q0, q1; q0 q1 q2 CX q1, q2; meas q0; [Z] [Z] [Z]

  62. Soundness ∀ ρ : quantum state ∀ α ∈ C Q ∀ C : program α ✏ ρ ⇒ J C K C ( α ) ✏ J C K ( ρ )

  63. For better approximation

  64. Abstract Semantics J · K C 1 q0 := | + i ; p 2( | 000 i + | 111 i ) q1 := | 0 i ; q2 := | 0 i ; CX q0, q1; CX q1, q2; q0 q1 q2 T q1; meas q0;   X X X Z Z I   I Z Z

  65. Abstract Semantics J · K C 1 q0 := | + i ; 2( | 000 i + e i π 4 | 111 i ) p q1 := | 0 i ; q2 := | 0 i ; CX q0, q1; CX q1, q2; q0 q1 q2 T q1; meas q0; ⌅

  66. Abstract Semantics J · K C 1 q0 := | + i ; 2( | 000 i h 000 | + | 111 i h 111 | ) q1 := | 0 i ; q2 := | 0 i ; CX q0, q1; CX q1, q2; q0 q1 q2 T q1; meas q0; ⌅ [Z]

  67. 0 J · K Abstract Semantics C 1 q0 := | + i ; p 2( | 000 i + | 111 i ) q1 := | 0 i ; q2 := | 0 i ; CX q0, q1; CX q1, q2; q0 q1 q2 T q1; meas q0;   X X X Z Z I   I Z Z

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Quantum tunneling: Applications in Quantum Information OUTLINE: One- and two-particle:

Quantum tunneling: Applications in Quantum Information OUTLINE: One- and two-particle:

Quantum tunneling: Applications in Quantum Information OUTLINE: One- and two-particle: quantum state transfer & entanglement generation Many-body dynamics in quadratic models Applications: n-QST, quantum batteries, entanglement

585 views • 22 slides
Entanglement branes, Modular fl ow, and Extended quantum fi eld theory Based on collaboration with

Entanglement branes, Modular fl ow, and Extended quantum fi eld theory Based on collaboration with

Entanglement branes, Modular fl ow, and Extended quantum fi eld theory Based on collaboration with William Donnelly: hep-th 1811.10785 Quantum Entanglement is a non local feature of Quantum Mechanics Unentangled Add some pictures Singlet example

471 views • 28 slides
Optical systems, entanglement and quantum quenches A. Imamoglu Quantum Photonics Group,

Optical systems, entanglement and quantum quenches A. Imamoglu Quantum Photonics Group,

Optical systems, entanglement and quantum quenches A. Imamoglu Quantum Photonics Group, Department of Physics ETH-Zrich Part II: Quantum quench of Kondo correlations Thanks to Christian Latta Florian Haupt Wolf Wster, Parisa

473 views • 19 slides
Quantum Cryptography 1. Fake Quantum Theory. 2. Simple Quantum Protocols. 3. More Fake Quantum

Quantum Cryptography 1. Fake Quantum Theory. 2. Simple Quantum Protocols. 3. More Fake Quantum

Contents: Quantum Cryptography 1. Fake Quantum Theory. 2. Simple Quantum Protocols. 3. More Fake Quantum Theory: Fake Tensor Products, Entanglement. 4. A Glance at Genuine Quantum Theory. 5. Quantum Computing, Shors

559 views • 8 slides
Quantum Complexity and Entanglement Ariadna Venegas Li June 2, 2016 Motivation Context Quantum

Quantum Complexity and Entanglement Ariadna Venegas Li June 2, 2016 Motivation Context Quantum

Quantum Complexity and Entanglement Ariadna Venegas Li June 2, 2016 Motivation Context Quantum Advantages The Two Biased Coins Entanglement Measurements of entanglement Examples Biased Coins Even Golden Mean Towards Interpretation

261 views • 25 slides
Quantum entanglement can be simulated without communication Nicolas J. Cerf Centre for Quantum

Quantum entanglement can be simulated without communication Nicolas J. Cerf Centre for Quantum

Quantum entanglement can be simulated without communication Nicolas J. Cerf Centre for Quantum Information and Communication Universit Libre de Bruxelles (joint work with Nicolas Gisin, Serge Massar, and Sandu Popescu) Physical Review

124 views • 11 slides
13/02/12 Role of complementarity on Entanglement detection Ryo Namiki Quantum optics group,

13/02/12 Role of complementarity on Entanglement detection Ryo Namiki Quantum optics group,

13/02/12 Role of complementarity on Entanglement detection Ryo Namiki Quantum optics group, Kyoto University Quantum entanglement A B Inseparability (entangled state) Form of density operators AB i p i Ai

176 views • 16 slides
Optical systems, entanglement and quantum quenches A. Imamoglu Quantum Photonics Group,

Optical systems, entanglement and quantum quenches A. Imamoglu Quantum Photonics Group,

Optical systems, entanglement and quantum quenches A. Imamoglu Quantum Photonics Group, Department of Physics ETH-Zrich Outline Lecture 1: Optical systems in mesoscopic physics: - overview of quantum dots - elementary optical measurements

647 views • 42 slides
Quantum decoupling via efficient classical operations and the entanglement cost of one-shot

Quantum decoupling via efficient classical operations and the entanglement cost of one-shot

Review of some classical tasks Quantum tasks Efficient decoupling and entanglement optimization Quantum decoupling via efficient classical operations and the entanglement cost of one-shot quantum protocols Anurag Anshu (joint work with

707 views • 67 slides
Entanglement Entropy, Quantum Field Theory, and Holography Matthew Headrick Brandeis University

Entanglement Entropy, Quantum Field Theory, and Holography Matthew Headrick Brandeis University

Entanglement Entropy, Quantum Field Theory, and Holography Matthew Headrick Brandeis University August 6, 2014 YITP Workshop on Quantum Information Physics Contents 0 Intro & disclaimer 2 1 1 Basic definitions 2 2 Entanglement

312 views • 10 slides
Quantum quantum information and thermodynamics with ions Introduction to ion trapping and

Quantum quantum information and thermodynamics with ions Introduction to ion trapping and

Quantum quantum information and thermodynamics with ions Introduction to ion trapping and cooling Trapped ions as qubits for quantum computing and simulation Qubit architectures for scalable entanglement Quantum thermodynamics

1.18k views • 56 slides
Quantum entanglement, its entropy, and why we calculate it Piotr Witkowski Max Planck

Quantum entanglement, its entropy, and why we calculate it Piotr Witkowski Max Planck

Quantum entanglement, its entropy, and why we calculate it Piotr Witkowski Max Planck Institute for Physics 14.7 2016 Munich 1 What is entanglement ? 2 Quantifying entanglement the entropy 3 The (very) many body systems, and how we treat

319 views • 19 slides
Multipartite entanglement certification in quantum many-body systems using quench dynamics

Multipartite entanglement certification in quantum many-body systems using quench dynamics

Background in Quantum Metrology Multipartite Entanglement Certification Quench Dynamics 1D Fermi-Hubbard Model Multipartite entanglement certification in quantum many-body systems using quench dynamics Ricardo Costa de Almeida Institute for

823 views • 42 slides
Quantum channel entanglement producing and distance of the channel matrix from the tensor

Quantum channel entanglement producing and distance of the channel matrix from the tensor

Quantum channel entanglement producing and distance of the channel matrix from the tensor product Igor Popov, Maria Faleeva ITMO University St. Petersburg, Russia Report plan 1. Introduction. Quantum computing motivation. 2. Matrix problem.

461 views • 31 slides
Quantum Entanglement Kevin Zielnicki Advisor : Paul G. Kwiat Physics 403 talk : April 17, 2012

Quantum Entanglement Kevin Zielnicki Advisor : Paul G. Kwiat Physics 403 talk : April 17, 2012

Quantum Entanglement Kevin Zielnicki Advisor : Paul G. Kwiat Physics 403 talk : April 17, 2012 This talk has three sections: I'll start with a basic introduction to entanglement Introduction How to make entanglement Quantum

617 views • 10 slides
Quantum BCH and Reed-Solomon Entanglement-Assisted Codes Francisco R. F. Pereira Joint work with

Quantum BCH and Reed-Solomon Entanglement-Assisted Codes Francisco R. F. Pereira Joint work with

Quantum BCH and Reed-Solomon Entanglement-Assisted Codes Francisco R. F. Pereira Joint work with Ruud Pellikaan TU/e, the Netherlands 40th WIC SITB, Belgium May 28, 2019 1/27 Content Introduction Super Dense Coding Quantum Error

746 views • 39 slides
Thermal stability in universal adiabatic computation Elizabeth Crosson Joint work with Tomas

Thermal stability in universal adiabatic computation Elizabeth Crosson Joint work with Tomas

International Congress of Mathematical Physics July 23 rd , 2018 in Montr eal, Qu ebec Thermal stability in universal adiabatic computation Elizabeth Crosson Joint work with Tomas Jochym-OConnor and John Preskill Quantum Physics and

322 views • 20 slides
Good approximate QLDPC codes from spacetime Hamiltonians Chinmay Nirkhe joint work with Thom

Good approximate QLDPC codes from spacetime Hamiltonians Chinmay Nirkhe joint work with Thom

Good approximate QLDPC codes from spacetime Hamiltonians Chinmay Nirkhe joint work with Thom Bohdanowicz Elizabeth Crosson Henry Yuen Caltech University of New Mexico University of Toronto arXiv:1811.00277 QIP 2019 nirkhe@cs.berkeley.edu

772 views • 34 slides
PXIE RFQ Progress John Staples, LBNL 10-12 April 2012 Collaboration Meeting, LBNL Summary LBNL

PXIE RFQ Progress John Staples, LBNL 10-12 April 2012 Collaboration Meeting, LBNL Summary LBNL

PXIE RFQ Progress John Staples, LBNL 10-12 April 2012 Collaboration Meeting, LBNL Summary LBNL is tasked with the design of RFQs for both FNAL (PXIE) and IMP (Lanzhou) These two CW RFQs are very similar The beam dynamics and structure design

763 views • 44 slides
Ch. 18.1: Counting structures with symmetry Prof. Tesler Math 184A Winter 2019 Prof. Tesler

Ch. 18.1: Counting structures with symmetry Prof. Tesler Math 184A Winter 2019 Prof. Tesler

Ch. 18.1: Counting structures with symmetry Prof. Tesler Math 184A Winter 2019 Prof. Tesler Ch. 18.1: Structures with symmetry Math 184A / Winter 2019 1 / 38 Counting circular permutations Put n people 1 , 2 , . . . , n on a Ferris wheel,

676 views • 38 slides
Are we ready for the next recession? Introductory remarks by David Wessel March 21, 2016 Change

Are we ready for the next recession? Introductory remarks by David Wessel March 21, 2016 Change

Are we ready for the next recession? Introductory remarks by David Wessel March 21, 2016 Change in real GDP 1965-2015 Source: U.S. Bureau of Economic Analysis, Federal Reserve Economic Data (FRED) Our question today: What could fiscal and

516 views • 14 slides
A group-theoretical approach to interpenetrated networks Igor Baburin Technische Universitt

A group-theoretical approach to interpenetrated networks Igor Baburin Technische Universitt

A group-theoretical approach to interpenetrated networks Igor Baburin Technische Universitt Dresden, Theoretische Chemie Lancaster, Bond-node structures, 5 th June 2018 Outline Symmetry properties of interpenetrating nets

617 views • 40 slides
Chapter 9: The Government and Fiscal Policy Week 5 Presenter:Zheng Zhang February 16, 2013

Chapter 9: The Government and Fiscal Policy Week 5 Presenter:Zheng Zhang February 16, 2013

Equilibrium with Government Sector Automatic Stabilizer Past Exam Questions PEQ5 Midterm I FAQs Chapter 9: The Government and Fiscal Policy Week 5 Presenter:Zheng Zhang February 16, 2013 Zheng Zhang Chapter 9: The Government and Fiscal

1.08k views • 79 slides
Galois theory, a logical path from Grothendiecks version to the fundamental theorem Johan

Galois theory, a logical path from Grothendiecks version to the fundamental theorem Johan

Galois theory, a logical path from Grothendiecks version to the fundamental theorem Johan Felipe Garc a Vargas Departamento de Matem aticas Universidad de los Andes July 11, 2017 Outline Traditionally Galois theory is seen as a

643 views • 28 slides

More recommend