Efficient Quantum State Tomography using the MERA in 1D critical system Presenter : Jong Yeon Lee (Undergraduate, Caltech)

Slides:



Advertisements
Similar presentations
Pretty-Good Tomography Scott Aaronson MIT. Theres a problem… To do tomography on an entangled state of n qubits, we need exp(n) measurements Does this.
Advertisements

Sergey Bravyi, IBM Watson Center Robert Raussendorf, Perimeter Institute Perugia July 16, 2007 Exactly solvable models of statistical physics: applications.
Variational Methods for Graphical Models Micheal I. Jordan Zoubin Ghahramani Tommi S. Jaakkola Lawrence K. Saul Presented by: Afsaneh Shirazi.
Principal Component Analysis Based on L1-Norm Maximization Nojun Kwak IEEE Transactions on Pattern Analysis and Machine Intelligence, 2008.
Fast Algorithms For Hierarchical Range Histogram Constructions
U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science Solving POMDPs Using Quadratically Constrained Linear Programs Christopher Amato.
Algebraic, transcendental (i.e., involving trigonometric and exponential functions), ordinary differential equations, or partial differential equations...
Fundamentals of Data Analysis Lecture 12 Methods of parametric estimation.
Doing Very Big Calculations on Modest Size Computers Reducing the Cost of Exact Diagonalization Using Singular Value Decomposistion Marvin Weinstein, Assa.
An Introduction to Variational Methods for Graphical Models.
Chapter 4: Linear Models for Classification
2D and time dependent DMRG
Andy Ferris International summer school on new trends in computational approaches for many-body systems Orford, Québec (June 2012) Multiscale Entanglement.
Visual Recognition Tutorial
Local Fault-tolerant Quantum Computation Krysta Svore Columbia University FTQC 29 August 2005 Collaborators: Barbara Terhal and David DiVincenzo, IBM quant-ph/
Gentle tomography and efficient universal data compression Charlie Bennett Aram Harrow Seth Lloyd Caltech IQI Jan 14, 2003.
Algorithm Evaluation and Error Analysis class 7 Multiple View Geometry Comp Marc Pollefeys.
Review Rong Jin. Comparison of Different Classification Models  The goal of all classifiers Predicating class label y for an input x Estimate p(y|x)
Radial Basis Function Networks
Introduction to Tensor Network States Sukhwinder Singh Macquarie University (Sydney)
Frame by Frame Bit Allocation for Motion-Compensated Video Michael Ringenburg May 9, 2003.
Bayesian parameter estimation in cosmology with Population Monte Carlo By Darell Moodley (UKZN) Supervisor: Prof. K Moodley (UKZN) SKA Postgraduate conference,
Prof. Dr. S. K. Bhattacharjee Department of Statistics University of Rajshahi.
Lecture 12 Statistical Inference (Estimation) Point and Interval estimation By Aziza Munir.
ECE 8443 – Pattern Recognition ECE 8423 – Adaptive Signal Processing Objectives: Deterministic vs. Random Maximum A Posteriori Maximum Likelihood Minimum.
 Quantum State Tomography  Finite Dimensional  Infinite Dimensional (Homodyne)  Quantum Process Tomography (SQPT)  Application to a CNOT gate  Related.
ECE 8443 – Pattern Recognition LECTURE 07: MAXIMUM LIKELIHOOD AND BAYESIAN ESTIMATION Objectives: Class-Conditional Density The Multivariate Case General.
ELEC 303 – Random Signals Lecture 18 – Classical Statistical Inference, Dr. Farinaz Koushanfar ECE Dept., Rice University Nov 4, 2010.
Tensor networks and the numerical study of quantum and classical systems on infinite lattices Román Orús School of Physical Sciences, The University of.
1 MODELING MATTER AT NANOSCALES 4. Introduction to quantum treatments The variational method.
Introduction to MERA Sukhwinder Singh Macquarie University.
Linear Models for Classification
July 11, 2006Bayesian Inference and Maximum Entropy Probing the covariance matrix Kenneth M. Hanson T-16, Nuclear Physics; Theoretical Division Los.
1  The Problem: Consider a two class task with ω 1, ω 2   LINEAR CLASSIFIERS.
8.4.2 Quantum process tomography 8.5 Limitations of the quantum operations formalism 量子輪講 2003 年 10 月 16 日 担当:徳本 晋
CpSc 881: Machine Learning
ECE 8443 – Pattern Recognition Objectives: Jensen’s Inequality (Special Case) EM Theorem Proof EM Example – Missing Data Intro to Hidden Markov Models.
Quasi-1D antiferromagnets in a magnetic field a DMRG study Institute of Theoretical Physics University of Lausanne Switzerland G. Fath.
Information Bottleneck versus Maximum Likelihood Felix Polyakov.
6. Population Codes Presented by Rhee, Je-Keun © 2008, SNU Biointelligence Lab,
Sporadic model building for efficiency enhancement of the hierarchical BOA Genetic Programming and Evolvable Machines (2008) 9: Martin Pelikan, Kumara.
Chance Constrained Robust Energy Efficiency in Cognitive Radio Networks with Channel Uncertainty Yongjun Xu and Xiaohui Zhao College of Communication Engineering,
Can small quantum systems learn? NATHAN WIEBE & CHRISTOPHER GRANADE, DEC
KITPC Max Planck Institut of Quantum Optics (Garching) Tensor networks for dynamical observables in 1D systems Mari-Carmen Bañuls.
Giansalvo EXIN Cirrincione unit #4 Single-layer networks They directly compute linear discriminant functions using the TS without need of determining.
CHAPTER- 3.1 ERROR ANALYSIS.  Now we shall further consider  how to estimate uncertainties in our measurements,  the sources of the uncertainties,
Ground State Entanglement in 1-Dimensional Translationally-Invariant Quantum Systems Sandy Irani Computer Science Department University of California,
Computacion Inteligente Least-Square Methods for System Identification.
Ch 1. Introduction Pattern Recognition and Machine Learning, C. M. Bishop, Updated by J.-H. Eom (2 nd round revision) Summarized by K.-I.
Fundamentals of Data Analysis Lecture 11 Methods of parametric estimation.
PATTERN RECOGNITION AND MACHINE LEARNING CHAPTER 1: INTRODUCTION.
Learning Deep Generative Models by Ruslan Salakhutdinov
Deep Feedforward Networks
Probability Theory and Parameter Estimation I
CH 5: Multivariate Methods
Exact Inference Continued
Generalized DMRG with Tree Tensor Network
Bucket Renormalization for Approximate Inference
Modelling data and curve fitting
Estimating Networks With Jumps
Filtering and State Estimation: Basic Concepts
Where did we stop? The Bayes decision rule guarantees an optimal classification… … But it requires the knowledge of P(ci|x) (or p(x|ci) and P(ci)) We.
Adaptive Perturbation Theory: QM and Field Theory
دانشگاه صنعتي اميركبير
Exact Inference Continued
Linear Discrimination
Tensor Network Simulations of QFT in Curved Spacetime
Computational approaches for quantum many-body systems
Computational approaches for quantum many-body systems
A quantum machine learning algorithm based on generative models
Presentation transcript:

Efficient Quantum State Tomography using the MERA in 1D critical system Presenter : Jong Yeon Lee (Undergraduate, Caltech)

Quantum Tomography How to reconstruct quantum state? Black Box It prepares identical qubit state repeatedly Measure with Up/Down basis and +, – basis Reconstruct the state that black box prepares

Quantum Tomography For generic case Black Box Measure with complete set of observables Reconstruct the state that black box prepares Obtain probability for observables Density Matrix

Standard Method Problems of traditional method (Maximum likelihood estimation) – Number of Observables increases exponentially with the system size – Given that each observable has an uncertainty (as long as the number of measurement is not infinite), algorithms for finding optimal density matrix has also exponential time complexity. – The expectation value of observables decreases exponentially with the system size N – Any solution?

Many quantum ground states have a special structure – “Area Law” : Entanglement Entropy related to Boundary – It takes a time exponentially large in system size for the quantum state to reach majority of Hilbert space by local interaction How to represent quantum states?

Goal Minimize the number of measurements to experimentally identify 1D systems including critical system. Use variational family of states represented by type of tensor network states, which is called ‘MERA’ (having linear number of parameters with respect to the system size) ….. Density Matrix ….. Marcus et al. (2011)

MERA Methodology developed by Guifre Vidal Originally exploited to find a quantum ground state of critical Hamiltonian Tree-like Structure – Isometry – Disentangler G.Evenbly, G.Vidal

MERA tomography In MERA tomography, one finds a MERA circuit which well approximates a given experimental state Use ‘Partial’ Information to infer the state, therefore much more efficient that usual tomographic procedure. Following questions arise: 1.How to find parameters for MERA circuit? 2.What much more efficient? What is the Scaling of the number of measurements required? 3.Is reconstructed state actually close to given experimental state?

1. MERA tomography – Principle Assume tensor network structure of state

Choose disentanglers U such that sum of red box is minimized. Quantities in red box should be zero in ideal MERA circuit. Isometry W is automatically determined to diagonalized reduced density matrix 1. MERA tomography – Principle

Performance Convergence of Objective Function in 24 Qubits This is the sum of probability weights on the wrong subspace, which should be zero in ideal case

In standard method, the number of measurements required with fixed precision increases exponentially with system size. Theoretically, MERA state has only polynomial (square) increase of the number of parameters with system size. What would be the exact scaling for the number of measurements for various 1D critical systems? 2. Scaling of the number of measurements

Renormalization of observables 8-sites observable is effected mapped into 4-sites observable

To maintain same precision at all renormalized layers, the number of measurements should increase to compensate increased factors. 2. Scaling of the number of measurements Renormalize

How to achieve smaller scaling factor? – Longest Residual Vector selection method – Out of all possible observables, choose a set of observable that most efficiently in tomographic procedure 4 6 operators 4 4 operators 2. Scaling of the number of measurements

Scaling Factor for Measurements Precision of each observable measured 100 times

Now we know that our MERA tomographic procedure works efficiently. However, whether or not a reconstructed state well approximates the given experimental state needs to be examined. Can it be verified during the tomographic procedure? 3. Verification : Fidelity between Actual versus Reconstructed states

Upper bound for the fidelity between reconstructed state and given experimental state can be obtained using the quantity obtained during tomographic optimization procedure!

Conclusion Superior optimization scheme Provided a bound for the distance between the experimental state and the reconstructed state using local data – Providing an efficient scalable certification method for critical states. Examined the performance of MERA tomography on the ground states of several 1D critical models.