Thomas Barthel

Probing Entanglement Scaling Across a Quantum Phase Transition on a Quantum Computer

Qiang Miao [1], Tianyi Wang [2,1], Kenneth R. Brown [1,2,3,4], Thomas Barthel [1,2,5], Marko Cetina [2,1,3]

Abstract

The investigation of strongly-correlated quantum matter is difficult due to the curse of dimensionality and intricate entanglement structures. These challenges are particularly pronounced in the vicinity of continuous quantum phase transitions, where quantum fluctuations manifest across all length scales. While quantum simulators give controlled access to a number of strongly correlated systems, the study of critical phenomena has been hampered by finite-size effects arising from diverging correlation lengths. Moreover, the experimental investigation of entanglement in many-body systems has been hindered by limitations in measurement protocols. To address these challenges, we employ the multiscale entanglement renormalization ansatz (MERA) and implement a holographic scheme for subsystem tomography on a fully-connected trapped-ion quantum computer. Our method accurately represents infinite systems and long-range correlations with few qubits, facilitating the efficient extraction of observables and entanglement properties, even at criticality. We observe a quantum phase transition with spontaneous symmetry breaking and reveal the evolution of entanglement properties across the critical point. For the first time, we demonstrate log-law scaling of subsystem entanglement entropies at criticality on a digital quantum computer. This achievement highlights the potential of MERA for the investigation of strongly-correlated many-body systems on quantum computers.

Quantum-classical eigensolver using multiscale entanglement renormalization

Qiang Miao [1], Thomas Barthel [1]

Abstract

We propose a variational quantum eigensolver (VQE) for the simulation of strongly-correlated quantum matter based on a multi-scale entanglement renormalization ansatz (MERA) and gradient-based optimization. This MERA quantum eigensolver can have substantially lower computation costs than corresponding classical algorithms. Due to its narrow causal cone, the algorithm can be implemented on noisy intermediate-scale quantum (NISQ) devices and still describe large systems. It is particularly attractive for ion-trap devices with ion-shuttling capabilities. The number of required qubits is system-size independent, and increases only to a logarithmic scaling when using quantum amplitude estimation to speed up gradient evaluations. Translation invariance can be used to make computation costs square-logarithmic in the system size and describe the thermodynamic limit. We demonstrate the approach numerically for a MERA with Trotterized disentanglers and isometries. With a few Trotter steps, one recovers the accuracy of the full MERA.