Noise-resilient quantum circuits
|
|
|
- Cordelia Mathews
- 5 years ago
- Views:
Transcription
1 Noise-resilient quantum circuits Isaac H. Kim IBM T. J. Watson Research Center Yorktown Heights, NY Oct 10th, 2017 arxiv: , arxiv: , arxiv:17??.?????(w. Brian Swingle)
2 Why don t we have a large-scale quantum computer? Classical Noise rate : Primary source of error : Neutrons from the cosmic rays. Quantum Noise rate : Isaac H. Kim (IBM) Noise-resilient quantum circuits Oct 10th, / 33
3 Fighting noise The theory of fault tolerance comes to a rescue! But... Can you fit millions of qubits in a single dilution fridge? Gate speed problem Too slow : Quantum computer with clock speed of 1Hz? Too fast : Decoding can t keep up. + all the problems that are yet to be discovered. We re not going to have a large scale quantum computer tomorrow, but it is very likely that we will have a noisy quantum computer consisting of say, 100 qubits in near term. What should we do with them? Isaac H. Kim (IBM) Noise-resilient quantum circuits Oct 10th, / 33
4 Focusing on large-depth quantum circuits There seems to be a consensus that large-depth quantum circuits, without error correction, will be useless. 1 Without error correction, error keeps accumulating. 2 In the long run, the effect of error cannot be bounded. 3 Therefore, such circuits will be completely useless without error correction. Not true Isaac H. Kim (IBM) Noise-resilient quantum circuits Oct 10th, / 33
5 Noise resilient circuits Definition A family of circuits {C n } is k-noise-resilient if for every bounded k-local operator O with k = O(1), O 0 O ɛ cɛ. O 0 : E.v. of O, over a state C n ψ O ɛ : E.v. of O when every gate/prep/measurement becomes noisy. (ɛ: noise rate) for every product state ψ, for all n <, for some c = O(1). * There are noise-resilient circuits that are not short depth. Isaac H. Kim (IBM) Noise-resilient quantum circuits Oct 10th, / 33
6 Noise resilient circuits Isaac H. Kim (IBM) Noise-resilient quantum circuits Oct 10th, / 33
7 Noise resilient circuits Isaac H. Kim (IBM) Noise-resilient quantum circuits Oct 10th, / 33
8 Noise resilient circuits Isaac H. Kim (IBM) Noise-resilient quantum circuits Oct 10th, / 33
9 Noise resilient circuits Isaac H. Kim (IBM) Noise-resilient quantum circuits Oct 10th, / 33
10 Noise resilient circuits Isaac H. Kim (IBM) Noise-resilient quantum circuits Oct 10th, / 33
11 Agendas 1 Why noise resilience is important. 2 Intuition behind noise resilience. 3 Abundance of noise-resilient circuits. 4 How to use noise-resilient circuits. Isaac H. Kim (IBM) Noise-resilient quantum circuits Oct 10th, / 33
12 1/poly(n) vs constant error If you can estimate everything down to 1/poly(n) precision, that s great! But not every bit of useful information requires such precision. For instance, look at any averaged observables: N i=1 h i 0 N N i=1 h i ɛ N cɛ max h i. i Energy/site is *the* figure of merit for comparing different numerical methods. For macroscopic observables, e.g., magnetization/site, its poly(n)th digit provides little useful information. Isaac H. Kim (IBM) Noise-resilient quantum circuits Oct 10th, / 33
13 Name of the game In quantum many-body physics, Lower the energy/site is, the better. Differences of energy/site between different method is O(1), not O(1/poly(n)). Question : Can a near-term quantum device participate in this game and win against all classical methods? Isaac H. Kim (IBM) Noise-resilient quantum circuits Oct 10th, / 33
14 Outperforming classical computers Question : Can a near-term quantum device participate in this game and win against all classical methods? The space of all classical methods is a huge space. Even if it can, it will be difficult to prove. However, there are models that have been studied intensively, AF Heisenberg on Kagome lattice, Fermi-Hubbard on square lattice. Physicists worked hard on beating each other s energy for decades. If a noisy quantum computer can beat the lowest known energy/site, that would be an indication that a noisy quantum computer can outperform classical computer for certain tasks. Isaac H. Kim (IBM) Noise-resilient quantum circuits Oct 10th, / 33
15 Moreover, it will actually be useful. Averaged quantities : Energy per site/ magnetization per site, etc. i Ō = O i N Response functions : Magnetic susceptibility, bulk modulus, etc. * V : extensive quantities α = 1 V V λ Isaac H. Kim (IBM) Noise-resilient quantum circuits Oct 10th, / 33
16 Agendas 1 Why noise resilience is important. 2 Intuition behind noise resilience. 3 Abundance of noise-resilient circuits. 4 How to use noise-resilient circuits. Isaac H. Kim (IBM) Noise-resilient quantum circuits Oct 10th, / 33
17 Guiding example : MPS 1 Generically, a unitary circuit that prepares a MPS is large-depth, but noise-resilient. 2 Running such a circuit on a quantum computer is ill-motivated, but we can learn some lessons. Isaac H. Kim (IBM) Noise-resilient quantum circuits Oct 10th, / 33
18 Guiding example : MPS Isaac H. Kim (IBM) Noise-resilient quantum circuits Oct 10th, / 33
19 Guiding example : MPS Isaac H. Kim (IBM) Noise-resilient quantum circuits Oct 10th, / 33
20 Guiding example : MPS Isaac H. Kim (IBM) Noise-resilient quantum circuits Oct 10th, / 33
21 Guiding example : MPS Isaac H. Kim (IBM) Noise-resilient quantum circuits Oct 10th, / 33
22 Guiding example : MPS Isaac H. Kim (IBM) Noise-resilient quantum circuits Oct 10th, / 33
23 Guiding example : MPS Isaac H. Kim (IBM) Noise-resilient quantum circuits Oct 10th, / 33
24 Guiding example : MPS Isaac H. Kim (IBM) Noise-resilient quantum circuits Oct 10th, / 33
25 Guiding example : MPS Isaac H. Kim (IBM) Noise-resilient quantum circuits Oct 10th, / 33
26 Guiding example : MPS Isaac H. Kim (IBM) Noise-resilient quantum circuits Oct 10th, / 33
27 Guiding example : MPS Isaac H. Kim (IBM) Noise-resilient quantum circuits Oct 10th, / 33
28 Guiding example : MPS At each time, a fresh ancilla is introduced, interacts with the system, and the system is discarded. The ancilla becomes the new system. Isaac H. Kim (IBM) Noise-resilient quantum circuits Oct 10th, / 33
29 Guiding example : MPS At each time, a fresh ancilla is introduced, interacts with the system, and the system is discarded. The ancilla becomes the new system. Isaac H. Kim (IBM) Noise-resilient quantum circuits Oct 10th, / 33
30 Guiding example : MPS At each time, a fresh ancilla is introduced, interacts with the system, and the system is discarded. The ancilla becomes the new system. Isaac H. Kim (IBM) Noise-resilient quantum circuits Oct 10th, / 33
31 Guiding example : MPS At each time, a fresh ancilla is introduced, interacts with the system, and the system is discarded. The ancilla becomes the new system. Isaac H. Kim (IBM) Noise-resilient quantum circuits Oct 10th, / 33
32 Guiding example : MPS At each time, a fresh ancilla is introduced, interacts with the system, and the system is discarded. The ancilla becomes the new system. Isaac H. Kim (IBM) Noise-resilient quantum circuits Oct 10th, / 33
33 Guiding example : MPS At each time, a fresh ancilla is introduced, interacts with the system, and the system is discarded. The ancilla becomes the new system. Isaac H. Kim (IBM) Noise-resilient quantum circuits Oct 10th, / 33
34 Guiding example : MPS At each time, a fresh ancilla is introduced, interacts with the system, and the system is discarded. The ancilla becomes the new system. Isaac H. Kim (IBM) Noise-resilient quantum circuits Oct 10th, / 33
35 Guiding example : MPS At each time, a fresh ancilla is introduced, interacts with the system, and the system is discarded. The ancilla becomes the new system. Isaac H. Kim (IBM) Noise-resilient quantum circuits Oct 10th, / 33
36 Guiding example : MPS At each time, a fresh ancilla is introduced, interacts with the system, and the system is discarded. The ancilla becomes the new system. V i V : Virtual qubit : ith physical qubit MPS can be prepared by sequentially applying a unitary over V and i, from i = 1 to N. [Fannes et al. (1992)] Isaac H. Kim (IBM) Noise-resilient quantum circuits Oct 10th, / 33
37 Guiding example : MPS At each time, a fresh ancilla is introduced, interacts with the system, and the system is discarded. The ancilla becomes the new system. V i V : Virtual qubit : ith physical qubit MPS can be prepared by sequentially applying a unitary over V and i, from i = 1 to N. [Fannes et al. (1992)] Isaac H. Kim (IBM) Noise-resilient quantum circuits Oct 10th, / 33
38 Guiding example : MPS At each time, a fresh ancilla is introduced, interacts with the system, and the system is discarded. The ancilla becomes the new system. V i V : Virtual qubit : ith physical qubit MPS can be prepared by sequentially applying a unitary over V and i, from i = 1 to N. [Fannes et al. (1992)] Isaac H. Kim (IBM) Noise-resilient quantum circuits Oct 10th, / 33
39 Guiding example : MPS At each time, a fresh ancilla is introduced, interacts with the system, and the system is discarded. The ancilla becomes the new system. V i V : Virtual qubit : ith physical qubit MPS can be prepared by sequentially applying a unitary over V and i, from i = 1 to N. [Fannes et al. (1992)] Isaac H. Kim (IBM) Noise-resilient quantum circuits Oct 10th, / 33
40 Guiding example : MPS At each time, a fresh ancilla is introduced, interacts with the system, and the system is discarded. The ancilla becomes the new system. V i : Virtual qubit : ith physical qubit MPS can be prepared by sequentially applying a unitary over V and i, from i = 1 to N. [Fannes et al. (1992)] V Isaac H. Kim (IBM) Noise-resilient quantum circuits Oct 10th, / 33
41 Guiding example : MPS At each time, a fresh ancilla is introduced, interacts with the system, and the system is discarded. The ancilla becomes the new system. V i : Virtual qubit : ith physical qubit MPS can be prepared by sequentially applying a unitary over V and i, from i = 1 to N. [Fannes et al. (1992)] V Isaac H. Kim (IBM) Noise-resilient quantum circuits Oct 10th, / 33
42 Guiding example : MPS At each time, a fresh ancilla is introduced, interacts with the system, and the system is discarded. The ancilla becomes the new system. V i : Virtual qubit : ith physical qubit MPS can be prepared by sequentially applying a unitary over V and i, from i = 1 to N. [Fannes et al. (1992)] V Isaac H. Kim (IBM) Noise-resilient quantum circuits Oct 10th, / 33
43 Guiding example : MPS At each time, a fresh ancilla is introduced, interacts with the system, and the system is discarded. The ancilla becomes the new system. V i : Virtual qubit : ith physical qubit MPS can be prepared by sequentially applying a unitary over V and i, from i = 1 to N. [Fannes et al. (1992)] V Isaac H. Kim (IBM) Noise-resilient quantum circuits Oct 10th, / 33
44 Guiding example : MPS O MPS = Tr(ρΦ n Φ 2 Φ 1 (O)) Φ i : Transfer operator Norm-nonincreasing Eigenoperator with eigenvalue λ λ = 1 : Oscillating mode λ < 1 : Decaying mode * Generically, the identity operator is the only eigenoperator with λ = 1. Isaac H. Kim (IBM) Noise-resilient quantum circuits Oct 10th, / 33
45 Oscillating modes are unstable ǫ= Error t Isaac H. Kim (IBM) Noise-resilient quantum circuits Oct 10th, / 33
46 0.07 Decaying modes are stable Error ǫ=10-3 ǫ= ǫ= ǫ= t Short-time : Little accumulation of noise Long-time : Noise in early time is killed off if every mode decays. Isaac H. Kim (IBM) Noise-resilient quantum circuits Oct 10th, / 33
47 Decaying modes are stable A state at time T is influenced by every perturbation at time t T δ(t) Φ t T (V t ) Φ t T : Transition from t to T. V t : Perturbation at time t. (Bounded by ɛ) Φ t T (V t ) decays exponentially in T t. In particular, T t=0 Φ t T (V t ) = O(ɛ) for all T. Isaac H. Kim (IBM) Noise-resilient quantum circuits Oct 10th, / 33
48 Comments 1 MPS is useful : It can describe gapped 1D systems efficiently. [Hastings (2006)] 2 Contraction of MPS is noise-resilient, even though the circuit depth scales with the system size. 3 But we can already contract MPS efficiently on a classical computer, so there s not much point of implementing the circuit on a quantum computer. Isaac H. Kim (IBM) Noise-resilient quantum circuits Oct 10th, / 33
49 Agendas 1 Why noise resilience is important. 2 Intuition behind noise resilience. 3 Abundance of noise-resilient circuits. 4 How to use noise-resilient circuits. Isaac H. Kim (IBM) Noise-resilient quantum circuits Oct 10th, / 33
50 Design principles 1 Nontriviality : The circuit must do something that physicists care about. A noiseless circuit, applied to a simple-to-prepare states(e.g., product state) outputs k-point functions of states that are of interests to physicists. 2 Advantage : There must be an advantage in running the circuit over simulating it. 3 Noise-resilience : The circuit must be noise-resilient. A reduced circuit for every k-local observable only consists of fastly decaying modes. Isaac H. Kim (IBM) Noise-resilient quantum circuits Oct 10th, / 33
51 Example 1 : A subclass of PEPS MPS vs PEPS Virtual qubit vs Rows of virtual qubits Physical qubit vs A row of physcal qubits Arbitrary unitary vs Finite-depth unitary 1 Nontriviality : The ansatz describes any Levin-Wen/quantum double [K (2017)] 2 Advantage : O(l x ) time. 3 Noise resilience : Holds under a physical condition. [K (2017)] Isaac H. Kim (IBM) Noise-resilient quantum circuits Oct 10th, / 33
52 Example 2 : MERA-like circuits MERA Introduced by Vidal(2006). MERA is formally a quantum circuit consisting of O(log N) layers. Each layers consist of depth-2 locality-preserving quantum circuits. One layer of isometry, one layer of disentangler The dimension of the circuit elements are O(χ n ). Deep MERA [K and Swingle, in prep.] Decompose χ-dimensional Hilbert space into O(log χ) qubits. To be experiment-friendly, decompose the circuit into 2-qubit gates. Each layers consist of depth-d locality-preserving quantum circuits. Ground states of various physical models can be described with D = O(log 1 δ ) for precision δ. [Haegeman et al. (2017)] * N : Number of qubits * n : Fixed constant, e.g., 4. Isaac H. Kim (IBM) Noise-resilient quantum circuits Oct 10th, / 33
53 Example 2 : MERA-like circuits N=512, D=2 Isaac H. Kim (IBM) Noise-resilient quantum circuits Oct 10th, / 33
54 Example 2 : MERA-like circuits N=512, D=3 Isaac H. Kim (IBM) Noise-resilient quantum circuits Oct 10th, / 33
55 Example 2 : MERA-like circuits N=512, D=4 Isaac H. Kim (IBM) Noise-resilient quantum circuits Oct 10th, / 33
56 Example 2 : MERA-like circuits N=512, D=5 Isaac H. Kim (IBM) Noise-resilient quantum circuits Oct 10th, / 33
57 Example 2 : MERA-like circuits N=512, D=6 Isaac H. Kim (IBM) Noise-resilient quantum circuits Oct 10th, / 33
58 Example 2 : MERA-like circuits O = Tr(Φ log N Φ 2 Φ 1 (ρ)o) [Giovanetti et al. (2008), Evenbly and Vidal (2009)] 1 O can be computed efficiently both classically and quantumly. However, for deep MERA with depth D, Classical computer seems to need O(2 cd log N) time.(matrix-matrix multiplication) This is in 1D. In d dimension, it scales as O(2 c D d log N). Quantum computer can do the same job in O(D log N) time. 2 Noise resilient iff lowest scaling dimension > 0. Isaac H. Kim (IBM) Noise-resilient quantum circuits Oct 10th, / 33
59 Error analysis For a deep MERA in d-spatial dimensions with depth D, with noise rate ɛ 1 Gate + measurement + preparation error : D d+1 ɛ (Generically) 2 Approximaton error : e cd (For known models) [Haegeman et al. (2017)] Optimizing D, O(ɛ(log d+1 (1/ɛ)) error can be achieved, using O(log d (1/ɛ)) qubits. Isaac H. Kim (IBM) Noise-resilient quantum circuits Oct 10th, / 33
60 Setup Numerical experiment 1 Place random SU(4) in each circuit locations. 2 Compute nearest neighbor reduced density matrix with and without noise. Noise model : Apply depolarizing noise with p = after SU(4). 3 Compute the trace distance. 4 Repeat 100 times for different choices of D. Result D Errors Average Std Min Max Isaac H. Kim (IBM) Noise-resilient quantum circuits Oct 10th, / 33
61 Agendas 1 Why noise resilience is important. 2 Intuition behind noise resilience. 3 Abundance of noise-resilient circuits. 4 How to use noise-resilient circuits. Isaac H. Kim (IBM) Noise-resilient quantum circuits Oct 10th, / 33
62 Quantum variational method Update circuit Quantum Computer Classical Computer Quantum-classical feedback loop Measure energy 1 Quantum processor runs a circuit and measures the energy. (Difficult classically) 2 Classical computer updates the circuit to lower the energy. (zeroth order classical optimization methods) 3 Repeat until convergence. 4 Measure physical observables, e.g., magnetization. * Inspired from variational quantum eigensolver [Peruzzo et al. (2013)] Isaac H. Kim (IBM) Noise-resilient quantum circuits Oct 10th, / 33
63 Classical optimization 1 Decompose the circuit into SU(4). 2 Sample energy. 3 Sequentially optimize each SU(4). Employ classical zeroth-order optimization with noisy measurement, e.g., SPSA. E-E Iterations Isaac H. Kim (IBM) Noise-resilient quantum circuits Oct 10th, / 33
64 Comments/Speculations Quantum computer is really good at contracting tensor networks. Contraction of physical tensor networks are resilient to noise. RG kills your mistakes so that all the imperfections, even if added together, does not blow up. The trick is to change the scale to time. A universal structure of ground state entanglement (tensor network structure) seems to guarantee the robustness of correlation functions. That s great because we care about correlation functions. Tensor networks are efficient, but not all of them are practical yet. A near-term quantum computer can assist these calculations, even if it is noisy. Isaac H. Kim (IBM) Noise-resilient quantum circuits Oct 10th, / 33
65 Outlook Lord Kelvin Differential Analyzer Lord Kelvin proposed an analog machine that can predict the flow of sea tides. (19th century) The machine essentially solved a linear differential equation. Such machines were built in the early 20th century and people actually used it!(bush, Hartree) These devices were used for scientific purposes, e.g., studies of heat flow, explosive detonations, and transmission lines, until they were eventually replaced by digital computers. Noisy quantum computer = Differential analyzer of the 21st century? Isaac H. Kim (IBM) Noise-resilient quantum circuits Oct 10th, / 33
Quantum Simulation. 9 December Scott Crawford Justin Bonnar
Quantum Simulation 9 December 2008 Scott Crawford Justin Bonnar Quantum Simulation Studies the efficient classical simulation of quantum circuits Understanding what is (and is not) efficiently simulable
Quantum 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
It 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
Quantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 1: Quantum circuits and the abelian QFT
Quantum algorithms (CO 78, Winter 008) Prof. Andrew Childs, University of Waterloo LECTURE : Quantum circuits and the abelian QFT This is a course on quantum algorithms. It is intended for graduate students
Tensor network simulations of strongly correlated quantum systems
CENTRE FOR QUANTUM TECHNOLOGIES NATIONAL UNIVERSITY OF SINGAPORE AND CLARENDON LABORATORY UNIVERSITY OF OXFORD Tensor network simulations of strongly correlated quantum systems Stephen Clark LXXT[[[GSQPEFS\EGYOEGXMZMXMIWUYERXYQGSYVWI
Holographic 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
6.896 Quantum Complexity Theory September 18, Lecture 5
6.896 Quantum Complexity Theory September 18, 008 Lecturer: Scott Aaronson Lecture 5 Last time we looked at what s known about quantum computation as it relates to classical complexity classes. Today we
Introduction to tensor network state -- concept and algorithm. Z. Y. Xie ( 谢志远 ) ITP, Beijing
Introduction to tensor network state -- concept and algorithm Z. Y. Xie ( 谢志远 ) 2018.10.29 ITP, Beijing Outline Illusion of complexity of Hilbert space Matrix product state (MPS) as lowly-entangled state
Tensor network renormalization
Coogee'15 Sydney Quantum Information Theory Workshop Tensor network renormalization Guifre Vidal In collaboration with GLEN EVENBLY IQIM Caltech UC Irvine Quantum Mechanics 1920-1930 Niels Bohr Albert
Quantum Convolutional Neural Networks
Quantum Convolutional Neural Networks Iris Cong Soonwon Choi Mikhail D. Lukin arxiv:1810.03787 Berkeley Quantum Information Seminar October 16 th, 2018 Why quantum machine learning? Machine learning: interpret
Flow equations on quantum circuits
Flow equations on quantum circuits Unified variational methods for quantum many-body systems Chris Dawson Jens Eisert and Tobias Osborne Flow equations on quantum circuits Unified variational methods for
Efficient time evolution of one-dimensional quantum systems
Efficient time evolution of one-dimensional quantum systems Frank Pollmann Max-Planck-Institut für komplexer Systeme, Dresden, Germany Sep. 5, 2012 Hsinchu Problems we will address... Finding ground states
arxiv: v4 [quant-ph] 13 Mar 2013
![arxiv: v4 [quant-ph] 13 Mar 2013](/thumbs/75/72057259.jpg "arxiv: v4 [quant-ph] 13 Mar 2013")
Deep learning and the renormalization group arxiv:1301.3124v4 [quant-ph] 13 Mar 2013 Cédric Bény Institut für Theoretische Physik Leibniz Universität Hannover Appelstraße 2, 30167 Hannover, Germany cedric.beny@gmail.com
Fermionic tensor networks
Fermionic tensor networks Philippe Corboz, Institute for Theoretical Physics, ETH Zurich Bosons vs Fermions P. Corboz and G. Vidal, Phys. Rev. B 80, 165129 (2009) : fermionic 2D MERA P. Corboz, R. Orus,
arxiv: v2 [quant-ph] 31 Oct 2013
![arxiv: v2 [quant-ph] 31 Oct 2013](/thumbs/93/112286981.jpg "arxiv: v2 [quant-ph] 31 Oct 2013")
Quantum Criticality with the Multi-scale Entanglement Renormalization Ansatz arxiv:1109.5334v2 [quant-ph] 31 Oct 2013 G. Evenbly 1 and G. Vidal 2 1 The University of Queensland, Brisbane, Queensland 4072,
Rigorous free fermion entanglement renormalization from wavelets
Computational Complexity and High Energy Physics August 1st, 2017 Rigorous free fermion entanglement renormalization from wavelets arxiv: 1707.06243 Jutho Haegeman Ghent University in collaboration with:
Fourier analysis of boolean functions in quantum computation
Fourier analysis of boolean functions in quantum computation Ashley Montanaro Centre for Quantum Information and Foundations, Department of Applied Mathematics and Theoretical Physics, University of Cambridge
Machine Learning with Tensor Networks
Machine Learning with Tensor Networks E.M. Stoudenmire and David J. Schwab Advances in Neural Information Processing 29 arxiv:1605.05775 Beijing Jun 2017 Machine learning has physics in its DNA # " # #
Multiclass Classification-1
CS 446 Machine Learning Fall 2016 Oct 27, 2016 Multiclass Classification Professor: Dan Roth Scribe: C. Cheng Overview Binary to multiclass Multiclass SVM Constraint classification 1 Introduction Multiclass
Introduction to Tensor Networks: PEPS, Fermions, and More
Introduction to Tensor Networks: PEPS, Fermions, and More Román Orús Institut für Physik, Johannes Gutenberg-Universität, Mainz (Germany)! School on computational methods in quantum materials Jouvence,
Quantum 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
b) (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
C/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
Tensor Networks, Renormalization and Holography (overview)
KITP Conference Closing the entanglement gap: Quantum information, quantum matter, and quantum fields June 1 st -5 th 2015 Tensor Networks, Renormalization and Holography (overview) Guifre Vidal KITP Conference
Tensor network methods in condensed matter physics. ISSP, University of Tokyo, Tsuyoshi Okubo
Tensor network methods in condensed matter physics ISSP, University of Tokyo, Tsuyoshi Okubo Contents Possible target of tensor network methods! Tensor network methods! Tensor network states as ground
Lecture 2: From Classical to Quantum Model of Computation
CS 880: Quantum Information Processing 9/7/10 Lecture : From Classical to Quantum Model of Computation Instructor: Dieter van Melkebeek Scribe: Tyson Williams Last class we introduced two models for deterministic
What is possible to do with noisy quantum computers?
What is possible to do with noisy quantum computers? Decoherence, inaccuracy and errors in Quantum Information Processing Sara Felloni and Giuliano Strini sara.felloni@disco.unimib.it Dipartimento di Informatica
CSE 599d - Quantum Computing Fault-Tolerant Quantum Computation and the Threshold Theorem
CSE 599d - Quantum Computing Fault-Tolerant Quantum Computation and the Threshold Theorem Dave Bacon Department of Computer Science & Engineering, University of Washington In the last few lectures, we
Holographic Branching and Entanglement Renormalization
KITP, December 7 th 2010 Holographic Branching and Entanglement Renormalization Glen Evenbly Guifre Vidal Tensor Network Methods (DMRG, PEPS, TERG, MERA) Potentially offer general formalism to efficiently
Quantum 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
Disentangling Topological Insulators by Tensor Networks
Disentangling Topological Insulators by Tensor Networks Shinsei Ryu Univ. of Illinois, Urbana-Champaign Collaborators: Ali Mollabashi (IPM Tehran) Masahiro Nozaki (Kyoto) Tadashi Takayanagi (Kyoto) Xueda
Fermionic tensor networks
Fermionic tensor networks Philippe Corboz, ETH Zurich / EPF Lausanne, Switzerland Collaborators: University of Queensland: Guifre Vidal, Roman Orus, Glen Evenbly, Jacob Jordan University of Vienna: Frank
Markov Chains for Tensor Network States
Sofyan Iblisdir University of Barcelona September 2013 arxiv 1309.4880 Outline Main issue discussed here: how to find good tensor network states? The optimal state problem Markov chains Multiplicative
An introduction to tensornetwork
An introduction to tensornetwork states and MERA Sissa Journal Club Andrea De Luca 29/01/2010 A typical problem We are given: A lattice with N sites On each site a C d hilbert space A quantum hamiltonian
arxiv: v1 [quant-ph] 18 Jul 2017
![arxiv: v1 [quant-ph] 18 Jul 2017](/thumbs/88/116853038.jpg "arxiv: v1 [quant-ph] 18 Jul 2017")
Implicitly disentangled renormalization arxiv:1707.05770v1 [quant-ph] 18 Jul 017 Glen Evenbly 1 1 Département de Physique and Institut Quantique, Université de Sherbrooke, Québec, Canada (Dated: July 19,
Tensor network renormalization
Walter Burke Institute for Theoretical Physics INAUGURAL CELEBRATION AND SYMPOSIUM Caltech, Feb 23-24, 2015 Tensor network renormalization Guifre Vidal Sherman Fairchild Prize Postdoctoral Fellow (2003-2005)
Algorithm for Quantum Simulation
Applied Mathematics & Information Sciences 3(2) (2009), 117 122 An International Journal c 2009 Dixie W Publishing Corporation, U. S. A. Algorithm for Quantum Simulation Barry C. Sanders Institute for
using Low-Depth Quantum Circuits Guillaume Verdon Co-Founder & Chief Scientific Officer
Training Neural Networks using Low-Depth Quantum Circuits QC Meetup @YC Guillaume Verdon Co-Founder & Chief Scientific Officer guillaume@everettian.com Overview Classical Boltzmann machines? Energy-based
Belief propagation decoding of quantum channels by passing quantum messages
Belief propagation decoding of quantum channels by passing quantum messages arxiv:67.4833 QIP 27 Joseph M. Renes lempelziv@flickr To do research in quantum information theory, pick a favorite text on classical
Loop optimization for tensor network renormalization
Yukawa Institute for Theoretical Physics, Kyoto University, Japan June, 6 Loop optimization for tensor network renormalization Shuo Yang! Perimeter Institute for Theoretical Physics, Waterloo, Canada Zheng-Cheng
Lecture 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
Experimental state and process reconstruction. Philipp Schindler + Thomas Monz Institute of Experimental Physics University of Innsbruck, Austria
Experimental state and process reconstruction Philipp Schindler + Thomas Monz Institute of Experimental Physics University of Innsbruck, Austria What do we want to do? Debug and characterize a quantum
Lecture 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
arxiv:quant-ph/ v1 19 Mar 2006
On the simulation of quantum circuits Richard Jozsa Department of Computer Science, University of Bristol, Merchant Venturers Building, Bristol BS8 1UB U.K. Abstract arxiv:quant-ph/0603163v1 19 Mar 2006
MP 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
Quantum computing and the entanglement frontier. John Preskill NAS Annual Meeting 29 April 2018
Quantum computing and the entanglement frontier John Preskill NAS Annual Meeting 29 April 2018 Quantum Information Science Planck quantum theory + computer science + information theory Turing quantum information
Renormalization of Tensor Network States
Renormalization of Tensor Network States I. Coarse Graining Tensor Renormalization Tao Xiang Institute of Physics Chinese Academy of Sciences txiang@iphy.ac.cn Numerical Renormalization Group brief introduction
1 Bernstein-Vazirani Algorithm
CMSC 33001: Novel Computing Architectures and Technologies Lecturer: Yongshan Ding, Pranav Gokhale Scribe: Shankar G. Menon Lecture 08: More on Algorithms November 1, 018 1 Bernstein-Vazirani Algorithm
Quantum 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
Quantum many-body systems and tensor networks: simulation methods and applications
Quantum many-body systems and tensor networks: simulation methods and applications Román Orús School of Physical Sciences, University of Queensland, Brisbane (Australia) Department of Physics and Astronomy,
Quantum computing with superconducting qubits Towards useful applications
Quantum computing with superconducting qubits Towards useful applications Stefan Filipp IBM Research Zurich Switzerland Forum Teratec 2018 June 20, 2018 Palaiseau, France Why Quantum Computing? Why now?
Machine Learning with Quantum-Inspired Tensor Networks
Machine Learning with Quantum-Inspired Tensor Networks E.M. Stoudenmire and David J. Schwab Advances in Neural Information Processing 29 arxiv:1605.05775 RIKEN AICS - Mar 2017 Collaboration with David
Simulation of quantum computers with probabilistic models
Simulation of quantum computers with probabilistic models Vlad Gheorghiu Department of Physics Carnegie Mellon University Pittsburgh, PA 15213, U.S.A. April 6, 2010 Vlad Gheorghiu (CMU) Simulation of quantum
Hilbert 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
Quantum Metropolis Sampling. K. Temme, K. Vollbrecht, T. Osborne, D. Poulin, F. Verstraete arxiv:
Quantum Metropolis Sampling K. Temme, K. Vollbrecht, T. Osborne, D. Poulin, F. Verstraete arxiv: 09110365 Quantum Simulation Principal use of quantum computers: quantum simulation Quantum Chemistry Determination
Logical 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)
Tensor product Take two tensors, get together enough inputs to feed into both, and take the product of their results.
1 Tensors Tensors are a representation of linear operators. Much like with bra-ket notation, we want a notation which will suggest correct operations. We can represent a tensor as a point with n legs radiating
Simulating Quantum Systems through Matrix Product States. Laura Foini SISSA Journal Club
Simulating Quantum Systems through Matrix Product States Laura Foini SISSA Journal Club 15-04-2010 Motivations Theoretical interest in Matrix Product States Wide spectrum of their numerical applications
Logical Quantum Computing. Sarah Sheldon, IBM T.J. Watson Research Center
Logical Quantum Computing Sarah Sheldon, IBM T.J. Watson Research Center Quantum computing has the potential to revolutionize a wide array of industries, from pharmaceuticals and materials research to
Time 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,
Lectures on Fault-Tolerant Quantum Computation
Lectures on Fault-Tolerant Quantum Computation B.M. Terhal, IBM Research I. Descriptions of Noise and Quantum States II. Quantum Coding and Error-Correction III. Fault-Tolerant Error-Correction. Surface
Markovian Marginals. Isaac H. Kim. Oct. 9, arxiv: IBM T.J. Watson Research Center
Markovian Marginals Isaac H. Kim IBM T.J. Watson Research Center Oct. 9, 2016 arxiv:1609.08579 Marginal Problem Consider a physical system I. Given { I 0}, istherea 0 such that I = I 8I? If yes, the marginals
Quantum decoherence. Éric Oliver Paquette (U. Montréal) -Traces Worshop [Ottawa]- April 29 th, Quantum decoherence p. 1/2
![Quantum decoherence. Éric Oliver Paquette (U. Montréal) -Traces Worshop [Ottawa]- April 29 th, Quantum decoherence p. 1/2](/thumbs/78/77811482.jpg "Quantum decoherence. Éric Oliver Paquette (U. Montréal) -Traces Worshop [Ottawa]- April 29 th, Quantum decoherence p. 1/2")
Quantum decoherence p. 1/2 Quantum decoherence Éric Oliver Paquette (U. Montréal) -Traces Worshop [Ottawa]- April 29 th, 2007 Quantum decoherence p. 2/2 Outline Quantum decoherence: 1. Basics of quantum
CS286.2 Lecture 8: A variant of QPCP for multiplayer entangled games
CS286.2 Lecture 8: A variant of QPCP for multiplayer entangled games Scribe: Zeyu Guo In the first lecture, we saw three equivalent variants of the classical PCP theorems in terms of CSP, proof checking,
Quantum entanglement in the 21 st century
Quantum entanglement in the 21 st century Algorithms Error Correction Matter Spacetime Three Questions About Quantum Computers 1. Why build one? How will we use it, and what will we learn from it? A quantum
Report on Conceptual Foundations and Foils for QIP at the Perimeter Institute, May 9 May
Report on Conceptual Foundations and Foils for QIP at the Perimeter Institute, May 9 May 13 2011 Vlad Gheorghiu Department of Physics Carnegie Mellon University Pittsburgh, PA 15213, U.S.A. May 19, 2011
On the complexity of stoquastic Hamiltonians
On the complexity of stoquastic Hamiltonians Ian Kivlichan December 11, 2015 Abstract Stoquastic Hamiltonians, those for which all off-diagonal matrix elements in the standard basis are real and non-positive,
4 Matrix product states
Physics 3b Lecture 5 Caltech, 05//7 4 Matrix product states Matrix product state (MPS) is a highly useful tool in the study of interacting quantum systems in one dimension, both analytically and numerically.
One-Way Quantum Computing Andrew Lopez. A commonly used model in the field of quantum computing is the Quantum
One-Way Quantum Computing Andrew Lopez A commonly used model in the field of quantum computing is the Quantum Circuit Model. The Circuit Model can be thought of as a quantum version of classical computing,
Quantum Information and Quantum Many-body Systems
Quantum Information and Quantum Many-body Systems Lecture 1 Norbert Schuch California Institute of Technology Institute for Quantum Information Quantum Information and Quantum Many-Body Systems Aim: Understand
Q2B: Quantum Computing for Business. John Preskill 5 December 2017
Q2B: Quantum Computing for Business John Preskill 5 December 2017 Quantum Computing in the NISQ* Era and Beyond John Preskill 5 December 2017 *Noisy Intermediate-Scale Quantum Computer Frontiers of Physics
becomes at most η th ( η ) 2t. As a result, it requires only O(log log T ) levels of concatenation to achieve sucient accuracy (η effective 1 T
SURVEY ON THE BOUNDS OF THE QUANTUM FAULT-TOLERANCE THRESHOLD CHRISTOPHER GRAVES 1. Introduction I rst briey summarize the threshold theorem and describe the motivations for tightening the bounds on the
Noisy Interactive Quantum Communication
Noisy Interactive Quantum ommunication arxiv: 1309.2643 Gilles rassard, shwin Nayak, lain Tapp, Dave Touchette and Falk Unger arcelona, QIP 2014 touchetd@iro.umontreal.ca Noisy Interactive Quantum ommunication
3 Symmetry Protected Topological Phase
Physics 3b Lecture 16 Caltech, 05/30/18 3 Symmetry Protected Topological Phase 3.1 Breakdown of noninteracting SPT phases with interaction Building on our previous discussion of the Majorana chain and
Lecture 3: Tensor Product Ansatz
Lecture 3: Tensor Product nsatz Graduate Lectures Dr Gunnar Möller Cavendish Laboratory, University of Cambridge slide credits: Philippe Corboz (ETH / msterdam) January 2014 Cavendish Laboratory Part I:
phys4.20 Page 1 - the ac Josephson effect relates the voltage V across a Junction to the temporal change of the phase difference
Josephson Effect - the Josephson effect describes tunneling of Cooper pairs through a barrier - a Josephson junction is a contact between two superconductors separated from each other by a thin (< 2 nm)
Quantum simulation with string-bond states: Joining PEPS and Monte Carlo
Quantum simulation with string-bond states: Joining PEPS and Monte Carlo N. Schuch 1, A. Sfondrini 1,2, F. Mezzacapo 1, J. Cerrillo 1,3, M. Wolf 1,4, F. Verstraete 5, I. Cirac 1 1 Max-Planck-Institute
1. 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
Positive Tensor Network approach for simulating open quantum many-body systems
Positive Tensor Network approach for simulating open quantum many-body systems 19 / 9 / 2016 A. Werner, D. Jaschke, P. Silvi, M. Kliesch, T. Calarco, J. Eisert and S. Montangero PRL 116, 237201 (2016)
sparse codes from quantum circuits
sparse codes from quantum circuits arxiv:1411.3334 Dave Bacon Steve Flammia Aram Harrow Jonathan Shi Coogee 23 Jan 2015 QECC [n,k,d] code: encode k logical qubits in n physical qubits and correct errors
Introduction to Quantum Algorithms Part I: Quantum Gates and Simon s Algorithm
Part I: Quantum Gates and Simon s Algorithm Martin Rötteler NEC Laboratories America, Inc. 4 Independence Way, Suite 00 Princeton, NJ 08540, U.S.A. International Summer School on Quantum Information, Max-Planck-Institut
Lecture 1: Introduction to Quantum Computing
Lecture 1: Introduction to Quantum Computing Rajat Mittal IIT Kanpur Whenever the word Quantum Computing is uttered in public, there are many reactions. The first one is of surprise, mostly pleasant, and
c 2017 Society for Industrial and Applied Mathematics
MULTISCALE MODEL. SIMUL. Vol. 15, No. 4, pp. 1423 1447 c 2017 Society for Industrial and Applied Mathematics TENSOR NETWORK SKELETONIZATION LEXING YING Abstract. We introduce a new coarse-graining algorithm,
arxiv: v2 [quant-ph] 25 May 2018
![arxiv: v2 [quant-ph] 25 May 2018](/thumbs/80/81904262.jpg "arxiv: v2 [quant-ph] 25 May 2018")
arxiv:79.79v2 [quant-ph] 25 May 28 A PRACTICAL QUANTUM ALGORITHM FOR THE SCHUR TRANSFORM WILLIAM M. KIRBY a Physics Department, Williams College Williamstown, MA 267, USA FREDERICK W. STRAUCH b Physics
Introduction into Quantum Computations Alexei Ashikhmin Bell Labs
Introduction into Quantum Computations Alexei Ashikhmin Bell Labs Workshop on Quantum Computing and its Application March 16, 2017 Qubits Unitary transformations Quantum Circuits Quantum Measurements Quantum
Surface Code Threshold in the Presence of Correlated Errors
Surface Code Threshold in the Presence of Correlated Errors USP-São Carlos - 2013 E. Novais, P. Jouzdani, and E. Mucciolo CCNH Universidade Federal do ABC Department of Physics University of Central Florida
Lecture 1: Introduction to Quantum Computing
Lecture : Introduction to Quantum Computing Rajat Mittal IIT Kanpur What is quantum computing? This course is about the theory of quantum computation, i.e., to do computation using quantum systems. These
H ψ = E ψ. Introduction to Exact Diagonalization. Andreas Läuchli, New states of quantum matter MPI für Physik komplexer Systeme - Dresden
H ψ = E ψ Introduction to Exact Diagonalization Andreas Läuchli, New states of quantum matter MPI für Physik komplexer Systeme - Dresden http://www.pks.mpg.de/~aml laeuchli@comp-phys.org Simulations of
Lecture 2: Introduction to Quantum Mechanics
CMSC 49: Introduction to Quantum Computation Fall 5, Virginia Commonwealth University Sevag Gharibian Lecture : Introduction to Quantum Mechanics...the paradox is only a conflict between reality and your
Scale invariance on the lattice
Coogee'16 Sydney Quantum Information Theory Workshop Feb 2 nd - 5 th, 2016 Scale invariance on the lattice Guifre Vidal Coogee'16 Sydney Quantum Information Theory Workshop Feb 2 nd - 5 th, 2016 Scale
arxiv:quant-ph/ v2 23 Aug 2003
An Architecture of Deterministic Quantum Central Processing Unit arxiv:quant-ph/0207032v2 23 Aug 2003 Fei Xue a, Zeng-Bing Chen a Mingjun Shi a Xianyi Zhou a Jiangfeng Du a Rongdian Han a a Department
Quantum Computing and the Possible Effects on Modern Security Practices
Quantum Computing and the Possible Effects on Modern Security Practices SE 4C03 Winter 2005 Kartik Sivaramakrishnan Researched by: Jeffery Lindner, 9904294 Due: April 04, 2005 Table of Contents Introduction...
Physics 202 Laboratory 5. Linear Algebra 1. Laboratory 5. Physics 202 Laboratory
Physics 202 Laboratory 5 Linear Algebra Laboratory 5 Physics 202 Laboratory We close our whirlwind tour of numerical methods by advertising some elements of (numerical) linear algebra. There are three
Quantum Computing: Great Expectations
Quantum Computing: Great Expectations Quantum Computing for Nuclear Physics Workshop Dave Bacon dabacon@google.com In a Galaxy Seven Years Ago... 0.88 fidelity 0.78 fidelity (2010) fidelities: 14 qubits:
Quantum Teleportation Pt. 1
Quantum Teleportation Pt. 1 PHYS 500 - Southern Illinois University April 17, 2018 PHYS 500 - Southern Illinois University Quantum Teleportation Pt. 1 April 17, 2018 1 / 13 Types of Communication In the
arxiv:quant-ph/ v4 4 Jul 2005
Operator Quantum Error Correcting Subsystems for Self-Correcting Quantum Memories Dave Bacon Department of Computer Science & Engineering, University of Washington, Seattle, WA 98195 (Dated: June 6, 2005)
Introduction to Quantum Computation
Chapter 1 Introduction to Quantum Computation 1.1 Motivations The main task in this course is to discuss application of quantum mechanics to information processing (or computation). Why? Education:Asingleq-bitisthesmallestpossiblequantummechanical
Lecture Notes Each circuit agrees with M on inputs of length equal to its index, i.e. n, x {0, 1} n, C n (x) = M(x).
CS 221: Computational Complexity Prof. Salil Vadhan Lecture Notes 4 February 3, 2010 Scribe: Jonathan Pines 1 Agenda P-/NP- Completeness NP-intermediate problems NP vs. co-np L, NL 2 Recap Last time, we
Entanglement 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
An exponential separation between quantum and classical one-way communication complexity
An exponential separation between quantum and classical one-way communication complexity Ashley Montanaro Centre for Quantum Information and Foundations, Department of Applied Mathematics and Theoretical