Maximally Multipartite Entangled States and Statistical Mechanics

Slides:



Advertisements
Similar presentations
Henry Haselgrove School of Physical Sciences University of Queensland
Advertisements

Simulazione di Biomolecole: metodi e applicazioni giorgio colombo
APRIL 2010 AARHUS UNIVERSITY Simulation of probed quantum many body systems.
Monte Carlo Methods and Statistical Physics
Spin chains and channels with memory Martin Plenio (a) & Shashank Virmani (a,b) quant-ph/ , to appear prl (a)Institute for Mathematical Sciences.
CHAPTER 8 A NNEALING- T YPE A LGORITHMS Organization of chapter in ISSO –Introduction to simulated annealing –Simulated annealing algorithm Basic algorithm.
Emergence of Quantum Mechanics from Classical Statistics.
Visual Recognition Tutorial
MSEG 803 Equilibria in Material Systems 8: Statistical Ensembles Prof. Juejun (JJ) Hu
NMR Quantum Information Processing and Entanglement R.Laflamme, et al. presented by D. Motter.
Quantum Computation and Error Correction Ali Soleimani.
Statistical Mechanics
Quantum fermions from classical statistics. quantum mechanics can be described by classical statistics !
Fermions and non-commuting observables from classical probabilities.
Quantum Mechanics from Classical Statistics. what is an atom ? quantum mechanics : isolated object quantum mechanics : isolated object quantum field theory.
Efficient Quantum State Tomography using the MERA in 1D critical system Presenter : Jong Yeon Lee (Undergraduate, Caltech)
Quantum computing Alex Karassev. Quantum Computer Quantum computer uses properties of elementary particle that are predicted by quantum mechanics Usual.
Introduction to Monte Carlo Methods D.J.C. Mackay.
Is Communication Complexity Physical? Samuel Marcovitch Benni Reznik Tel-Aviv University arxiv
Witnesses for quantum information resources Archan S. Majumdar S. N. Bose National Centre for Basic Sciences, Kolkata, India Collaborators: S. Adhikari,
F.F. Assaad. MPI-Stuttgart. Universität-Stuttgart Numerical approaches to the correlated electron problem: Quantum Monte Carlo.  The Monte.
Module 1: Statistical Issues in Micro simulation Paul Sousa.
Simulated Annealing.
1 Qubits, time and the equations of physics Salomon S. Mizrahi Departamento de Física, CCET, Universidade Federal de São Carlos Time and Matter October.
Multiple Antennas Have a Big Multi- User Advantage in Wireless Communications Bertrand Hochwald (Bell Labs)
NCN nanoHUB.org Wagner The basics of quantum Monte Carlo Lucas K. Wagner Computational Nanosciences Group University of California, Berkeley In collaboration.
Recent Progress in Many-Body Theories Barcelona, 20 July 2007 Antonio Acín 1,2 J. Ignacio Cirac 3 Maciej Lewenstein 1,2 1 ICFO-Institut de Ciències Fotòniques.
Lecture 26 Molecular orbital theory II
DYNAMICS OF OPEN Q-SYSTES FROM A PERSPECTIVE OF QIT IMS, Imperial College, London, 18 January 2007 Vladimír Bužek Research Center for Quantum Information.
Copyright© 2012, D-Wave Systems Inc. 1 Quantum Boltzmann Machine Mohammad Amin D-Wave Systems Inc.
Multipartite Entanglement and its Role in Quantum Algorithms Special Seminar: Ph.D. Lecture by Yishai Shimoni.
Non classical correlations of two interacting qubits coupled to independent reservoirs R. Migliore CNR-INFM, Research Unit CNISM of Palermo Dipartimento.
A new approach for the gamma tracking clustering by the deterministic annealing method François Didierjean IPHC, Strasbourg.
Quantum State Transferring through Spin Chains Abolfazl Bayat Sharif University of Technology Tehran, Iran. IICQI September 2007 Kish Island, Iran.
Quantum Boltzmann Machine
Arnau Riera, Grup QIC, Universitat de Barcelona Universität Potsdam 10 December 2009 Simulation of the Laughlin state in an optical lattice.
Physical Fluctuomatics 13th Quantum-mechanical extensions of probabilistic information processing Kazuyuki Tanaka Graduate School of Information Sciences,
Optimization via Search
Learning Deep Generative Models by Ruslan Salakhutdinov
Applications of the Canonical Ensemble: Simple Models of Paramagnetism
G. Florio Dipartimento di Fisica, Università di Bari, Italy
Simulated Annealing Chapter
Heuristic Optimization Methods
Measures of Entanglement at Quantum Phase Transitions
M. Stobińska1, F. Töppel2, P. Sekatski3,
Entropy in statistical mechanics. Thermodynamic contacts:
Maintaining Adiabaticity in Car-Parrinello Molecular Dynamics
By Rohit Ray ESE 251 Simulated Annealing.
Maria Okuniewski Nuclear Engineering Dept.
Generalized DMRG with Tree Tensor Network
Applications of the Canonical Ensemble:
10. Quantum Monte Carlo Methods
Recall the Equipartition
Quantum mechanics from classical statistics
Concept test 15.1 Suppose at time
Haim Kaplan and Uri Zwick
Quantum Information with Continuous Variables
Graduate School of Information Sciences Tohoku University, Japan
Quantum State and Process Measurement and Characterization
Adaptive Perturbation Theory: QM and Field Theory
Introduction to Simulated Annealing
1.
Quantum computation with classical bits
Feature space tansformation methods
Recall the Equipartition
Xin-She Yang, Nature-Inspired Optimization Algorithms, Elsevier, 2014
Introducing complex networks into quantum regime
Witness for Teleportation
Computational approaches for quantum many-body systems
Stochastic Methods.
Presentation transcript:

Maximally Multipartite Entangled States and Statistical Mechanics Premio “Sergio Fubini” 2008 Ph.D. Thesis: Decoherence and Entanglement in Quantum Information Processing Maximally Multipartite Entangled States and Statistical Mechanics Giuseppe Florio Università di Bari and INFN In collaboration with Saverio Pascazio, Paolo Facchi Giorgio Parisi Ugo Marzolino Università di Bari & INFN Università di Roma “La Sapienza”, INFN, SMC, CNR-INFM Università di Trieste & INFN Rome -- 22 September 08

Quantum Information It can exist in a superposition of states!!! Simulation of quantum (many-body) systems Complex and mesoscopic systems Criptography Database Search Transfer of Information (secure protocols) … Applications The QUBIT is the quantum extension of a classical bit (a two level system). (electron spin, photon polarization, hyperfine splitting of trapped ions…) It can exist in a superposition of states!!! Rome -- 22 September 08

What is the fundamental resource in Quantum Information? Entanglement What is the fundamental resource in Quantum Information? ENTANGLEMENT Entanglement is important for: Nielsen and Chuang, “Quantum Information and Computation” Quantum algorithms Secure communication Teleportation Amico et al. Rev. Mod. Phys. 80, 517 (2008) Applications in many-body physics Transfer of information in spin chains Strongly correlated fermions Harmonic lattices Rome -- 22 September 08

If one can write the state in a factorized form Entanglement Consider a quantum system in a state Consider two subsystems A and B If one can write the state in a factorized form A B then the state is SEPARABLE. Otherwise it is ENTANGLED. Rome -- 22 September 08

Two subsystems A and B: evaluate entanglement between them Motivations Bipartite systems VS Multipartite systems Two subsystems A and B: evaluate entanglement between them (well understood) Many subsystems: ?!?! Objective: characterizing Multipartite Entanglement Objective: define Maximally Multipartite Entangled States Rome -- 22 September 08

Entanglement A B We consider an ensemble of n two-level systems (qubits) in the state and a partition of the ensemble in two subsystems A and B What is the bipartite entanglement between A and B? For a generic state one can find its diagonal form = dimension of the Hilbert space = eigenvalues of Purity (linear entropy): a measure of bipartite entanglement Rome -- 22 September 08

Entanglement is “encoded” in the eigenvalues of the density matrix The reduced density matrix of subsystem A is obtained by tracing on the degrees of freedom of B Its purity is Max entangled for bipartition A-B Separable for bipartition A-B All eigenvalues = 1/NA Only one eigenvalue different from 0 Dimension of the Hilbert space of A Entanglement is “encoded” in the eigenvalues of the density matrix Rome -- 22 September 08

Characterization of multipartite entanglement The quantity completely defines the BIPARTITE ENTANGLEMENT (one number is sufficient). It depends on the bipartition. What about MULTIPARTITE ENTANGLEMENT? The numbers needed to characterize the system scale exponentially with its size. Seminal ideas from Man’ko, Marmo, Sudarshan, Zaccaria:(J. Phys. A 02-03) Parisi: complex systems Statistical methods The distribution of characterizes the entanglement of the system. The average will be a measure of the amount of entanglement in the system, while the variance will measure how well such entanglement is distributed: a smaller variance will correspond to a larger insensitivity to the choice of the partition. (See Facchi, G.F., Pascazio [PRA 74, 042331 (2006)]) Rome -- 22 September 08

For chaotic systems A B Chaotic phenomena can generate (typical) states with a large amount of entanglement (see Facchi, G.F. Pascazio, PRA 2006; Rossini, Benenti PRL 2008) Perfect maximally multipartite entangled states (MMES) Distribution for a typical state (generated by chaotic phenomena) Is it possible to reach the ideal minimum for all bipartitions? NO, for n > 7 there is frustration (see Scott PRA2004) Separable states Rome -- 22 September 08

Obtaining a MMES Maximally multipartite entangled state (MMES): minimizer of the potential of multipartite entanglement (see Facchi, G.F., Parisi, Pascazio PRA 2008) Minimization over balanced bipartitions nA is the number of qubits in subsystem A A B Due to linearity, it inherits the bounds If we want to reach a delta distribution… we introduce the generalized cost function Lagrange multiplier > 0 variance Rome -- 22 September 08

Optimization For a given bipartition we find 2 qubits 3 qubits We search MMES of the form For a given bipartition we find 2 qubits minimization 3 qubits 4 qubits The system of 4 qubits is frustrated (we send to 0 the variance for weigths but not a perfect MMES) Rome -- 22 September 08

Larger systems For larger system the optimization procedure is more difficult. We find a number of local minima where deterministic algorithms get stuck Stochastic algorithms Simulated annealing (see Kirkpatrick et al., Science 1983) Cost E(s) Start in a configuration s. At each step the algorithm chooses a new configuration s’ and probabilistically decides if let the system in s or move it to s’. The acceptance probability must depend on the “energy difference” E(s’)-E(s) and on a “temperature”; it is non zero when DE > 0; thus it is possible to pass barriers. s A simple choice is using the Metropolis algorithm with a Boltzmann factor. The schedule for the temperature lowering depends on the problem (usually, the slower, the better). Rome -- 22 September 08

5-6 qubits For 5 qubits we tested the case of phases = 0 or p It turns out that it is always possible to find a perfect MMES with these phases T(k) = 0.95k Tmax This is a typical run for 6 qubits. reaches the value of 1/8 and the variance goes to 0. Also in this case it is possible to find a perfect MMES Rome -- 22 September 08

7 qubits The numerical optimization of shows that it is not possible to reach the ideal value 1/8. Thus we have to optimize the cost function In this case one has to find a compromise between average entanglement and width of the distribution. T(k) = 0.95k Tmax Width decreases but average increases!!! Rome -- 22 September 08

Let’s change strategy… The minimization problem becomes easily very complicated (system size + frustration). We search another strategy to define MMES… We will recast the problem in a classical statistical mechanical problem. We consider the state The potential of entanglement is a function of the coefficients The set of Rome -- 22 September 08

Let’s change strategy… (see Facchi, GF, Marzolino, Parisi, Pascazio arxiv:0803.4498) We introduce the partition function: with the measure normalization and a fictitious inverse temperature A brief summary Rome -- 22 September 08

Statistical Mechanics Suppose we have the distribution at infinite temperature The distribution at ARBITRARY temperature is Minimum of the Hamiltonian Limits for the distribution Rome -- 22 September 08

Statistical Mechanics For the average we find Limits: Derivative: Non increasing function of Rome -- 22 September 08

Statistical Mechanics We can evaluate the cumulants of the distribution at high temperature: The average is the same of the purity Variance: For independent bipartitions: There is an interaction among the bipartitions Rome -- 22 September 08

Gaussian Approximation Higher order cumulants decrease faster Gaussian approximation Valid if Rome -- 22 September 08

Dependence on the “Temperature” When the tail “touches” the minimum, the distribution is deformed Deformation Rigid shift Rome -- 22 September 08

Dependence on the “Temperature” This picture is valid if What if ? order of the first non vanishing derivative Rome -- 22 September 08

Conclusions We defined a characterization of multipartite entanglement that is based on the framework of bipartite entanglement but with statistical information. We defined an optimization problem for deriving a class of Maximally Multipartite Entangled States (MMES) We recasted the problem in terms of a classical statistical mechanical problem We obtained a non trivial form of the second cumulant of the energy distribution and some features of the high temperature behaviour. FUTURE WORK: Extend the analysis; applications to many-body systems; exploration of the structure of the frustration… Rome -- 22 September 08