Preparing Projected Entangled Pair States on a Quantum Computer
|
|
- Juniper Caldwell
- 5 years ago
- Views:
Transcription
1 Preparing Projected Entangled Pair States on a Quantum Computer Martin Schwarz, Kristan Temme, Frank Verstraete University of Vienna, Faculty of Physics, Boltzmanngasse 5, 1090 Vienna, Austria Toby Cubitt, David Peréz-García Mathematics and Quantum Information group, Departamento de Analisis Matematico, Facultad de CC Matematicas, Universidad Complutense de Madrid, Plaza de Ciencias 3, Ciudad Universitaria, Madrid, Spain arxiv:
2 Overview Some PEPS background Growing PEPS Run-time bound Generalizations Conclusion 2
3 PEPS definition PEPS are quantum states defined on an arbitrary graph G=(V,E). Edges of G are associated to maximally entangled pairs states providing virtual indices. A tensor A (v) of rank k+1 is associated to each vertex v of degree k mapping k virtual indices to one physical index. PEPS is created by applying the maps A (v) to the virtual indices at each vertex v. 3
4 PEPS properties PEPS are a natural parameterization of multi-partite quantum states on lattices (or general graphs) that satisfies an area law by design Conjectured structure of ground states of gapped local Hamiltonians Proven so by Hastings [1] for 1D case (Matrix Product States) General PEPS preparation oracles are powerful resources! [2] as powerful as contracting tensor networks or computing their norm PP-complete, for general PEPS given as classical input Key question raised by Verstraete, Wolf, Peréz-García, Cirac (2006) [3] : Is it possible to prepare PEPS in BQP under mild restrictions? If PEPS generation is hard, what subclass of PEPS are physical? 4 [1] M. Hastings, Journal of Stat. Mech. 2007, P08024 (2007) [2] N. Schuch, M. Wolf, FV, and J.I. Cirac, PRL 98, (2007) [3] FV, M. Wolf, DPG, and J. Cirac, PRL 96, (2006)
5 Injective PEPS A PEPS is called injective, iff the map A (v) is left-invertible (after blocking sites), i.e. Injectivity is a generic property of many interesting states (e.g. 2D AKLT, all lattices, etc. almost always injective) Each injective PEPS is the unique ground state of a parent Hamiltonian [4] There is a standard construction [4] for 2-local parent Hamiltonian H = projector onto the complement of the support of each 2-body reduced density matrix of PEPS 5 [4] DPG, FV, J. I. Cirac, and M. M. Wolf, Quant. Inf. Comp 8, 0650 (2008)
6 Growing PEPS Key idea for preparing injective PEPS: 1. prepare a set of entangled pair states, one for each edge 2. construct parent Hamiltonian with entangled pairs as groundstate treat virtual PEPS indices as physical indices as well 3. grow the PEPS by growing the parent Hamiltonian, vertex by vertex 1. update parent Hamiltonian edge and vertex terms 2. add Hamiltonian term to restrict to the physical subspace with energy penalty larger than spectral gap 3. project onto unique ground state vector of updated Hamiltonian This step is probabilistic and requires some more work 4. final ground state is the PEPS we want to prepare 6
7 Growing PEPS 7
8 Growing PEPS 8
9 Growing PEPS 9
10 Growing PEPS 10
11 Growing PEPS 11
12 Projecting on next ground state Projection onto the next ground state is performed using Phase Estimation [5] We perform a binary measurement on the energy register (zero or non-zero) If the outcome is zero, we have perpared the desired ground state Else, we undo the measurement using the well-known Marriot-Watrous trick [6] and re-try, either starting from the original state or an orthogonal one By Jordan s Lemma, analysis reduces to a single 2x2 block, i.e. 2D subspace Transition may also be effected adiabatically [7] (doesn t generalize to G-inj. case) unique GS of H t+1 unique GS of H t 12 [5] M. Nielsen, I. Chuang. Quant. Comp. and Quant. Inf., Cambridge Univ. Press. (2000) [6] C. Marriot, J. Watrous, Comput. Complex. 14, pp (2003) [7] D. Aharonov, A. Ta-Shma, SIAM J. Comput. Vol. 37, No. 1, pp , (2007)
13 Bounding the run-time We need a lower bound for the transition probability Let be the condition number of matrix A Then, using the PEPS structure, we show that for each injective PEPS Let =max( (A (v) )) be the max. condition number over all PEPS projectors A (v) Let =min( (H t )) be the smallest spectral gap over all H t generated Then the algorithm produces PEPS p with probability at least 1- in time 13
14 Generalization The algorithm generalizes to G-injective PEPS [8], where symmetry group G is acting on virtual indices and A (v) is left-invertible on the G- invariant subspace. A PEPS is called G-isometric, if all A (v) s are isometries. Problem: A (v) s not injective parent Hamiltonian has degenerate ground space! How can we undo failed projections which are not rank-1? 14 [8] N. Schuch, J.I. Cirac, DPG, Annals of Physics, Volume 325, Issue 10 (2010)
15 Growing G-injective PEPS Generalization of the basic algorithm A related G-isometric PEPS is prepared deterministically by known methods [9,10] to enter the G-invariant subspace first The G-isometric PEPS is then transformed into the G-injective PEPS as before, maintaining the G-invariant subspace To undo measurements, we crucially use the PEPS structure and the fact that A (v) is invertible on the the G-invariant subspace to show that in fact we can proceed as before! Same run-time bound as basic algorithm. Examples of G-isometric PEPS being prepared initially: G=Z1: (trivial): product of entangled pairs (same as before) G=Z2: well-known toric code state The class of G-injective PEPS includes many physically interesting states with topologically order, such as quantum double models, etc. 15 [9] M. Aguado, G. Vidal, Phys. Rev. Lett. 100, (2008) [10] FV, M. M. Wolf, and J. I. Cirac. Nature Physics, 5: (2009)
16 Conclusion We have shown how to efficiently (in BQP) prepare well-conditioned injective PEPS on a quantum computer with high probability. We have exploited the PEPS structure to construct a sequence of parent Hamiltonians with an induced sequence of unique ground states with lowerbounded overlap, and we have shown how to move through this sequence efficiently to produce the final PEPS. The result generalizes to G-injective PEPS yielding the same run-time bound of (with restricted to the G-invariant subspace) Future directions: implement quadratic speedup in by using Quantum Rejection Sampling [11] can we solve interesting computational problems in this PEPS framework faster? [12] 16 [11] M. Ozols, M. Roetteler, J. Roland, arxiv: (2011) [12] I. Arad, Z. Landau, SIAM Journal on Computing 39, 3089 (2010)
17 References 1. M. Hastings, Journal of Statistical Mechanics: Theory and Experiment 2007, P08024 (2007) 2. N. Schuch, M. Wolf, F. Verstraete, and J.I. Cirac, PRL 98, (2007) 3. F. Verstraete, M. Wolf, D. Perez-Garcia, and J. Cirac, PRL 96, (2006) 4. D. Perez-Garcia, F. Verstraete, J. I. Cirac, and M. M. Wolf, Quant. Inf. Comp 8, 0650 (2008) 5. D. Aharonov, A. Ta-Shma, SIAM J. Comput. Vol. 37, No. 1, pp , (2007) 6. C. Marriot, J. Watrous, Comput. Complex. 14, pp (2003) 7. M. A. Nielsen, I. L. Chuang. Quantum Comp. and Quantum Inf., Cambridge Univ. Press. (2000) 8. N. Schuch, J.I. Cirac, D. Peréz-García, Annals of Physics, Volume 325, Issue 10 (2010) 9. M. Aguado, G. Vidal, Phys. Rev. Lett. 100, (2008) 10. F. Verstraete, M. M. Wolf, and J. I. Cirac. Nature Physics, 5: (2009) 11. M. Ozols, M. Roetteler, J. Roland, Quantum rejection sampling, arxiv: (2011) 12. I. Arad, Z. Landau, SIAM Journal on Computing 39, 3089 (2010) 17
Gapless Hamiltonians for the Toric Code Using the Projected Entangled Pair State Formalism Supplementary Material
Gapless Hamiltonians for the Toric Code Using the Projected ntangled Pair State Formalism Supplementary Material Carlos Fernández-González,, Norbert Schuch, 3, 4 Michael M. Wolf, 5 J. Ignacio Cirac, 6
More informationFermionic topological quantum states as tensor networks
order in topological quantum states as Jens Eisert, Freie Universität Berlin Joint work with Carolin Wille and Oliver Buerschaper Symmetry, topology, and quantum phases of matter: From to physical realizations,
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 information4 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.
More information3 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
More informationMatrix Product Operators: Algebras and Applications
Matrix Product Operators: Algebras and Applications Frank Verstraete Ghent University and University of Vienna Nick Bultinck, Jutho Haegeman, Michael Marien Burak Sahinoglu, Dominic Williamson Ignacio
More informationReflections in Hilbert Space III: Eigen-decomposition of Szegedy s operator
Reflections in Hilbert Space III: Eigen-decomposition of Szegedy s operator James Daniel Whitfield March 30, 01 By three methods we may learn wisdom: First, by reflection, which is the noblest; second,
More informationEntanglement spectrum and Matrix Product States
Entanglement spectrum and Matrix Product States Frank Verstraete J. Haegeman, D. Draxler, B. Pirvu, V. Stojevic, V. Zauner, I. Pizorn I. Cirac (MPQ), T. Osborne (Hannover), N. Schuch (Aachen) Outline Valence
More informationThe computational difficulty of finding MPS ground states
The computational difficulty of finding MPS ground states Norbert Schuch 1, Ignacio Cirac 1, and Frank Verstraete 2 1 Max-Planck-Institute for Quantum Optics, Garching, Germany 2 University of Vienna,
More informationQuantum 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
More informationLecture 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:
More informationTensors and complexity in quantum information science
Tensors in CS and geometry workshop, Nov. 11 (2014) Tensors and complexity in quantum information science Akimasa Miyake 1 CQuIC, University of New Mexico Outline Subject: math of tensors physics of
More informationIntroduction 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,
More informationMeasurement-based quantum computation 10th Canadian Summer School on QI. Dan Browne Dept. of Physics and Astronomy University College London
Measurement-based quantum computation 0th Canadian Summer School on QI Dan Browne Dept. of Physics and Astronomy University College London What is a quantum computer? The one-way quantum computer A multi-qubit
More informationQuantum 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
More informationADIABATIC PREPARATION OF ENCODED QUANTUM STATES
ADIABATIC PREPARATION OF ENCODED QUANTUM STATES Fernando Pastawski & Beni Yoshida USC Los Angeles, June 11, 2014 QUANTUM NOISE Storing single observable not enough. Decoherence deteriorates quantum observables.
More informationarxiv: v1 [cond-mat.str-el] 7 Aug 2011
Topological Geometric Entanglement of Blocks Román Orús 1, 2 and Tzu-Chieh Wei 3, 4 1 School of Mathematics and Physics, The University of Queensland, QLD 4072, Australia 2 Max-Planck-Institut für Quantenoptik,
More informationNeural Network Representation of Tensor Network and Chiral States
Neural Network Representation of Tensor Network and Chiral States Yichen Huang ( 黄溢辰 ) 1 and Joel E. Moore 2 1 Institute for Quantum Information and Matter California Institute of Technology 2 Department
More informationRigorous 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:
More informationarxiv: 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
More informationQuantum 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
More informationA Holevo-type bound for a Hilbert Schmidt distance measure
Journal of Quantum Information Science, 205, *,** Published Online **** 204 in SciRes. http://www.scirp.org/journal/**** http://dx.doi.org/0.4236/****.204.***** A Holevo-type bound for a Hilbert Schmidt
More informationIntroduction 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
More informationKai Sun. University of Michigan, Ann Arbor. Collaborators: Krishna Kumar and Eduardo Fradkin (UIUC)
Kai Sun University of Michigan, Ann Arbor Collaborators: Krishna Kumar and Eduardo Fradkin (UIUC) Outline How to construct a discretized Chern-Simons gauge theory A necessary and sufficient condition for
More informationBasics of quantum computing and some recent results. Tomoyuki Morimae YITP Kyoto University) min
Basics of quantum computing and some recent results Tomoyuki Morimae YITP Kyoto University) 50+10 min Outline 1. Basics of quantum computing circuit model, classically simulatable/unsimulatable, quantum
More informationStability of local observables
Stability of local observables in closed and open quantum systems Angelo Lucia anlucia@ucm.es Universidad Complutense de Madrid NSF/CBMS Conference Quantum Spin Systems UAB, June 20, 2014 A. Lucia (UCM)
More informationLocal Algorithms for 1D Quantum Systems
Local Algorithms for 1D Quantum Systems I. Arad, Z. Landau, U. Vazirani, T. Vidick I. Arad, Z. Landau, U. Vazirani, T. Vidick () Local Algorithms for 1D Quantum Systems 1 / 14 Many-body physics Are physical
More informationThermalization time bounds for Pauli stabilizer Hamiltonians
Thermalization time bounds for Pauli stabilizer Hamiltonians Kristan Temme California Institute of Technology arxiv:1412.2858 QEC 2014, Zurich t mix apple O(N 2 e 2 ) Overview Motivation & previous results
More informationTensor 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
More informationarxiv: v3 [quant-ph] 30 Mar 2012
Spectral Gap Amplification R. D. Somma 1 and S. Boixo 2 1 Los Alamos National Laboratory, Los Alamos, NM 87545, USA 2 Information Sciences Institute, USC, Marina del Rey, CA 90292, USA. Harvard University,
More informationTopological Phases in One Dimension
Topological Phases in One Dimension Lukasz Fidkowski and Alexei Kitaev arxiv:1008.4138 Topological phases in 2 dimensions: - Integer quantum Hall effect - quantized σ xy - robust chiral edge modes - Fractional
More informationQuantum 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,
More informationBy allowing randomization in the verification process, we obtain a class known as MA.
Lecture 2 Tel Aviv University, Spring 2006 Quantum Computation Witness-preserving Amplification of QMA Lecturer: Oded Regev Scribe: N. Aharon In the previous class, we have defined the class QMA, which
More informationQuantum-controlled measurement device for quantum-state discrimination
PHYSICAL REVIEW A, 66, 022112 2002 Quantum-controlled measurement device for quantum-state discrimination Miloslav Dušek 1,2 and Vladimír Bužek 2,3 1 Department of Optics, Palacký University, 17. listopadu
More informationClassification of Tripartite Entanglement with one Qubit. Marcio F. Cornelio and A. F. R. de Toledo Piza
Classification of Tripartite Entanglement with one Qubit Marcio F. Cornelio and A. F. R. de Toledo Piza Universidade de São Paulo, Instituto de Física, CP 66318, 05315 São Paulo, S.P., Brazil July 05,
More informationUnderstanding Topological Order with PEPS. David Pérez-García Autrans Summer School 2016
Understanding Topological Order with PEPS David Pérez-García Autrans Summer School 2016 Outlook 1. An introduc
More informationTime-dependent variational principle for quantum many-body systems
Quantum Information in Quantum Many-Body Physics October 21, 2011 Centre de Recherches Mathematiques, Montréal Time-dependent variational principle for quantum many-body systems PRL 107, 070601 (2011)
More informationMarkov 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
More informationarxiv: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
More informationQuantum entanglement and symmetry
Journal of Physics: Conference Series Quantum entanglement and symmetry To cite this article: D Chrucisi and A Kossaowsi 2007 J. Phys.: Conf. Ser. 87 012008 View the article online for updates and enhancements.
More informationA Complete Characterization of Unitary Quantum Space
A Complete Characterization of Unitary Quantum Space Bill Fefferman (QuICS, University of Maryland/NIST) Joint with Cedric Lin (QuICS) Based on arxiv:1604.01384 1. Basics Quantum space complexity Main
More informationQuantum Statistics -First Steps
Quantum Statistics -First Steps Michael Nussbaum 1 November 30, 2007 Abstract We will try an elementary introduction to quantum probability and statistics, bypassing the physics in a rapid first glance.
More informationQuantum 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
More informationDetecting pure entanglement is easy, so detecting mixed entanglement is hard
A quantum e-meter Detecting pure entanglement is easy, so detecting mixed entanglement is hard Aram Harrow (University of Washington) and Ashley Montanaro (University of Cambridge) arxiv:1001.0017 Waterloo
More informationArea Laws in Quantum Systems: Mutual Information and Correlations
ESI The Erwin Schrödinger International Boltzmanngasse 9 Institute for Mathematical Physics A-1090 Wien, Austria Area Laws in Quantum Systems: Mutual Information and Correlations Michael M. Wolf Frank
More informationExponential Decay of Correlations Implies Area Law
Exponential Decay of Correlations Implies Area Law Fernando G.S.L. Brandão ETH Michał Horodecki Gdansk University Arxiv:1206.2947 QIP 2013, Beijing Condensed (matter) version of the talk y - Finite correlation
More informationEnergetics and Error Rates of Self-Correcting Quantum Memories
Energetics and Error Rates of Self-Correcting Quantum Memories John Schulman Quantum codes allow for the robust storage of quantum information despite interaction with the environment. In a quantum code,
More informationCLASSIFICATION OF SU(2)-SYMMETRIC TENSOR NETWORKS
LSSIFITION OF SU(2)-SYMMETRI TENSOR NETWORKS Matthieu Mambrini Laboratoire de Physique Théorique NRS & Université de Toulouse M.M., R. Orús, D. Poilblanc, Phys. Rev. 94, 2524 (26) D. Poilblanc, M.M., arxiv:72.595
More informationFRG Workshop in Cambridge MA, May
FRG Workshop in Cambridge MA, May 18-19 2011 Programme Wednesday May 18 09:00 09:10 (welcoming) 09:10 09:50 Bachmann 09:55 10:35 Sims 10:55 11:35 Borovyk 11:40 12:20 Bravyi 14:10 14:50 Datta 14:55 15:35
More informationPositive 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)
More informationFrustration-free Ground States of Quantum Spin Systems 1
1 FRG2011, Harvard, May 19, 2011 Frustration-free Ground States of Quantum Spin Systems 1 Bruno Nachtergaele (UC Davis) based on joint work with Sven Bachmann, Spyridon Michalakis, Robert Sims, and Reinhard
More informationATELIER INFORMATION QUANTIQUE ET MÉCANIQUE STATISTIQUE QUANTIQUE WORKSHOP QUANTUM INFORMATION AND QUANTUM STATISTICAL MECHANICS
HORAIRE / PROGRAM ATELIER INFORMATION QUANTIQUE ET MÉCANIQUE STATISTIQUE QUANTIQUE 15 au 19 octobre 2018 WORKSHOP QUANTUM INFORMATION AND QUANTUM STATISTICAL MECHANICS October 15 19, 2018 CONFÉRENCES :
More informationQuantum expanders from any classical Cayley graph expander
Quantum expanders from any classical Cayley graph expander arxiv:0709.1142 Aram Harrow (Bristol) QIP 08 19 Dec 2007 outline Main result. Definitions. Proof of main result. Applying the recipe: examples
More informationQUANTUM FINITE AUTOMATA. Andris Ambainis 1 1 Faculty of Computing, University of Latvia,
QUANTUM FINITE AUTOMATA Andris Ambainis 1 1 Faculty of Computing, University of Latvia, Raiņa bulv. 19, Rīga, LV-1586, Latvia. Email: ambainis@lu.lv Abstract Quantum finite automata (QFAs) are quantum
More informationLOCAL RECOVERY MAPS AS DUCT TAPE FOR MANY BODY SYSTEMS
LOCAL RECOVERY MAPS AS DUCT TAPE FOR MANY BODY SYSTEMS Michael J. Kastoryano November 14 2016, QuSoft Amsterdam CONTENTS Local recovery maps Exact recovery and approximate recovery Local recovery for many
More informationWitness-preserving Amplification of QMA
Witness-preserving Amplification of QMA Yassine Hamoudi December 30, 2015 Contents 1 Introduction 1 1.1 QMA and the amplification problem.................. 2 1.2 Prior works................................
More informationChiral Haldane-SPT phases of SU(N) quantum spin chains in the adjoint representation
Chiral Haldane-SPT phases of SU(N) quantum spin chains in the adjoint representation Thomas Quella University of Cologne Presentation given on 18 Feb 2016 at the Benasque Workshop Entanglement in Strongly
More informationDiscrete quantum random walks
Quantum Information and Computation: Report Edin Husić edin.husic@ens-lyon.fr Discrete quantum random walks Abstract In this report, we present the ideas behind the notion of quantum random walks. We further
More informationNonlocal Quantum XOR Games for Large Number of Players
onlocal Quantum XOR Games for Large umber of Players Andris Ambainis, Dmitry Kravchenko, ikolajs ahimovs, Alexander Rivosh Faculty of Computing, University of Latvia Abstract onlocal games are used to
More informationEfficient description of many body systems with prjected entangled pair states
Efficient description of many body systems with prjected entangled pair states J. IGNACIO CIRAC Workshop on Quantum Information Science and many-body systems, National Cheng Kung University, Tainan, Taiwan,
More informationOn the Representation of Orthogonally Additive Polynomials in l p
Publ. RIMS, Kyoto Univ. 45 (2009), 519 524 On the Representation of Orthogonally Additive Polynomials in l p By Alberto Ibort,PabloLinares and José G.Llavona Abstract We present a new proof of a Sundaresan
More informationMachine 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
More informationEfficient 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
More informationRecursive proof of the Bell Kochen Specker theorem in any dimension n>3
Physics Letters A 339 (2005) 425 429 www.elsevier.com/locate/pla Recursive proof of the Bell Kochen Specker theorem in any dimension n>3 Adán Cabello a,, José M. Estebaranz b, Guillermo García-Alcaine
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 informationT ensor N et works. I ztok Pizorn Frank Verstraete. University of Vienna M ichigan Quantum Summer School
T ensor N et works I ztok Pizorn Frank Verstraete University of Vienna 2010 M ichigan Quantum Summer School Matrix product states (MPS) Introduction to matrix product states Ground states of finite systems
More informationEntanglement and variational methods for strongly correlated quantum many-body systems
Entanglement and variational methods for strongly correlated quantum many-body systems Frank Verstraete J. Haegeman, M. Marien, V. Stojevic, K. Van Acoleyen, L. Vanderstraeten D. Nagaj, V. Eissler, M.
More informationQuantum principal component analysis
Quantum principal component analysis The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Citation As Published Publisher Lloyd, Seth,
More informationarxiv: v1 [quant-ph] 6 Apr 2018
Quantum Machine Learning Matrix Product States Jacob D Biamonte 1,2,* 1 Deep Quantum Labs, Skolkovo Institute of Science and Technology, 3 Nobel Street, Moscow, Russia 121205 2 Institute for Quantum Computing,
More informationMachine 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 # " # #
More informationTRANSITIVE HOLONOMY GROUP AND RIGIDITY IN NONNEGATIVE CURVATURE. Luis Guijarro and Gerard Walschap
TRANSITIVE HOLONOMY GROUP AND RIGIDITY IN NONNEGATIVE CURVATURE Luis Guijarro and Gerard Walschap Abstract. In this note, we examine the relationship between the twisting of a vector bundle ξ over a manifold
More informationarxiv:quant-ph/ v1 28 Apr 2005
Recursive proof of the Bell-Kochen-Specker theorem in any dimension n > 3 Adán Cabello arxiv:quant-ph/0504217v1 28 Apr 2005 Departamento de Física Aplicada II, Universidad de Sevilla, E-41012 Sevilla,
More informationArea laws and efficient descriptions of quantum many-body states
PAPER OPEN ACCESS Area laws and efficient descriptions of quantum many-body states To cite this article: Yimin Ge and Jens Eisert 2016 New J. Phys. 18 083026 View the article online for updates and enhancements.
More informationA Superconducting Quantum Simulator for Topological Order and the Toric Code. Michael J. Hartmann Heriot-Watt University, Edinburgh qlightcrete 2016
A Superconducting Quantum Simulator for Topological Order and the Toric Code Michael J. Hartmann Heriot-Watt University, Edinburgh qlightcrete 2016 Topological Order (in 2D) A 2-dimensional physical system
More informationMany-body entanglement witness
Many-body entanglement witness Jeongwan Haah, MIT 21 January 2015 Coogee, Australia arxiv:1407.2926 Quiz Energy Entanglement Charge Invariant Momentum Total spin Rest Mass Complexity Class Many-body Entanglement
More informationEXTENSION OF BILINEAR FORMS FROM SUBSPACES OF L 1 -SPACES
Annales Academiæ Scientiarum Fennicæ Mathematica Volumen 27, 2002, 91 96 EXENSION OF BILINEAR FORMS FROM SUBSPACES OF L 1 -SPACES Jesús M. F. Castillo, Ricardo García and Jesús A. Jaramillo Universidad
More informationEntanglement in Valence-Bond-Solid States on Symmetric Graphs
Entanglement in Valence-Bond-Solid States on Symmetric Graphs Shu Tanaka A, Hosho Katsura B, Naoki Kawashima C Anatol N. Kirillov D, and Vladimir E. Korepin E A. Kinki University B. Gakushuin University
More information1 9/5 Matrices, vectors, and their applications
1 9/5 Matrices, vectors, and their applications Algebra: study of objects and operations on them. Linear algebra: object: matrices and vectors. operations: addition, multiplication etc. Algorithms/Geometric
More informationarxiv: v1 [quant-ph] 17 Jun 2009
Quantum search algorithms on the hypercube Birgit Hein and Gregor Tanner School of Mathematical Sciences, University of Nottingham, University Park, Nottingham NG7 2RD, UK e-mail: gregor.tanner@nottingham.ac.uk
More informationarxiv: Statistical mechanical models for quantum codes subject to correlated noise
Statistical mechanical models for quantum codes subject to correlated noise Christopher Chubb (EQUS USyd), Steve Flammia (EQUS USyd/YQI Yale) (me@)christopherchubb.com arxiv:1809.10704 Perimeter Institute
More informationFermionic 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
More informationRank-one and Quantum XOR Games
Rank-one and Quantum XOR Games T. Cooney 1 M. Junge 2 C. Palazuelos 3 D. Pérez García 1 and O. Regev 4 T. Vidick 5 1 Universidad Complutense de Madrid 2 University of Illinois at Urbana Champaign 3 Instituto
More informationTensor network simulation of QED on infinite lattices: learning from (1 + 1)d, and prospects for (2 + 1)d
Tensor network simulation of QED on infinite lattices: learning from (1 + 1)d, and prospects for (2 + 1)d Román Orús University of Mainz (Germany) K. Zapp, RO, Phys. Rev. D 95, 114508 (2017) Goal of this
More informationarxiv:quant-ph/ v2 23 Feb 2006
Quantum Information and Computation, Vol. 0, No. 0 (2003) 000 000 c Rinton Press The Computational Power of the W and GHZ states arxiv:quant-ph/0412177v2 23 Feb 2006 Ellie D Hondt Department of Mathematics,
More informationarxiv: Statistical mechanical models for quantum codes subject to correlated noise
Statistical mechanical models for quantum codes subject to correlated noise Christopher Chubb (EQUS USyd), Steve Flammia (EQUS USyd/YQI Yale) (me@)christopherchubb.com arxiv:1809.10704 UNM 2018-10 Quantum
More informationarxiv: v2 [quant-ph] 6 Feb 2018
Quantum Inf Process manuscript No. (will be inserted by the editor) Faster Search by Lackadaisical Quantum Walk Thomas G. Wong Received: date / Accepted: date arxiv:706.06939v2 [quant-ph] 6 Feb 208 Abstract
More informationA REPRESENTATION THEOREM FOR ORTHOGONALLY ADDITIVE POLYNOMIALS ON RIESZ SPACES
A REPRESENTATION THEOREM FOR ORTHOGONALLY ADDITIVE POLYNOMIALS ON RIESZ SPACES A. IBORT, P. LINARES AND J.G. LLAVONA Abstract. The aim of this article is to prove a representation theorem for orthogonally
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 informationHamilton Cycles in Digraphs of Unitary Matrices
Hamilton Cycles in Digraphs of Unitary Matrices G. Gutin A. Rafiey S. Severini A. Yeo Abstract A set S V is called an q + -set (q -set, respectively) if S has at least two vertices and, for every u S,
More informationarxiv: v1 [math.na] 9 Feb 2013
STRENGTHENED CAUCHY-SCHWARZ AND HÖLDER INEQUALITIES arxiv:1302.2254v1 [math.na] 9 Feb 2013 J. M. ALDAZ Abstract. We present some identities related to the Cauchy-Schwarz inequality in complex inner product
More informationarxiv: v1 [cond-mat.dis-nn] 18 Jan 2017
Efficient Representation of Quantum Many-body States with Deep Neural Networks Xun Gao 1 and Lu-Ming Duan 1, 2 1 Center for Quantum Information, IIIS, Tsinghua University, Beijing 100084, PR China 2 Department
More informationarxiv: v1 [quant-ph] 6 Feb 2013
Exact quantum query complexity of EXACT and THRESHOLD arxiv:302.235v [quant-ph] 6 Feb 203 Andris Ambainis Jānis Iraids Juris Smotrovs University of Latvia, Raiņa bulvāris 9, Riga, LV-586, Latvia February
More informationUniversal Quantum Simulator, Local Convertibility and Edge States in Many-Body Systems Fabio Franchini
New Frontiers in Theoretical Physics XXXIV Convegno Nazionale di Fisica Teorica - Cortona Universal Quantum Simulator, Local Convertibility and Edge States in Many-Body Systems Fabio Franchini Collaborators:
More informationarxiv: v1 [quant-ph] 7 Jan 2013
An area law and sub-exponential algorithm for D systems Itai Arad, Alexei Kitaev 2, Zeph Landau 3, Umesh Vazirani 4 Abstract arxiv:30.62v [quant-ph] 7 Jan 203 We give a new proof for the area law for general
More informationQuantum Algorithms for Graph Traversals and Related Problems
Quantum Algorithms for Graph Traversals and Related Problems Sebastian Dörn Institut für Theoretische Informatik, Universität Ulm, 89069 Ulm, Germany sebastian.doern@uni-ulm.de Abstract. We study the complexity
More informationarxiv: v1 [quant-ph] 4 Jul 2013
GEOMETRY FOR SEPARABLE STATES AND CONSTRUCTION OF ENTANGLED STATES WITH POSITIVE PARTIAL TRANSPOSES KIL-CHAN HA AND SEUNG-HYEOK KYE arxiv:1307.1362v1 [quant-ph] 4 Jul 2013 Abstract. We construct faces
More informationPRIME NON-COMMUTATIVE JB -ALGEBRAS
PRIME NON-COMMUTATIVE JB -ALGEBRAS KAIDI EL AMIN, ANTONIO MORALES CAMPOY and ANGEL RODRIGUEZ PALACIOS Abstract We prove that if A is a prime non-commutative JB -algebra which is neither quadratic nor commutative,
More informationRandom Fermionic Systems
Random Fermionic Systems Fabio Cunden Anna Maltsev Francesco Mezzadri University of Bristol December 9, 2016 Maltsev (University of Bristol) Random Fermionic Systems December 9, 2016 1 / 27 Background
More informationEntanglement Entropy In Gauge Theories. Sandip Trivedi Tata Institute of Fundamental Research, Mumbai, India.
Entanglement Entropy In Gauge Theories Sandip Trivedi Tata Institute of Fundamental Research, Mumbai, India. On The Entanglement Entropy For Gauge Theories, arxiv: 1501.2593 Sudip Ghosh, Ronak Soni and
More informationHamiltonian simulation with nearly optimal dependence on all parameters
Hamiltonian simulation with nearly optimal dependence on all parameters Dominic Berry + Andrew Childs obin Kothari ichard Cleve olando Somma Quantum simulation by quantum walks Dominic Berry + Andrew Childs
More information