3 ms·

Confinement in the Transverse Field Ising Model on the Heavy Hex Lattice

2 points by westurner 2y ago

westurner 2y ago
"Confinement in the Transverse Field Ising model on the Heavy Hex lattice" (2024) https://journals.aps.org/prl/abstract/10.1103/PhysRevLett.133.180402 https://journals.aps.org/prl/abstract/10.1103/PhysRevLett.13... : > Abstract: Inspired by a recent quantum computing experiment [Y. Kim et al., Nature (London), 618, 500–5 (2023)], we study the emergence of confinement in the transverse field Ising model on a decorated hexagonal lattice. Using an infinite tensor network state optimized with belief propagation we show how a quench from a broken symmetry state leads to striking nonthermal behavior underpinned by persistent oscillations and saturation of the entanglement entropy. We explain this phenomenon by constructing a minimal model based on the confinement of elementary excitations. Our model is in excellent agreement with our numerical results. For quenches to larger values of the transverse field and/or from nonsymmetry broken states, our numerical results display the expected signatures of thermalization: a linear growth of entanglement entropy in time, propagation of correlations, and the saturation of observables to their thermal averages. These results provide a physical explanation for the unexpected classical simulability of the quantum dynamics. "Evidence for the utility of quantum computing before fault tolerance" (2023) https://www.nature.com/articles/s41586-023-06096-3 https://www.nature.com/articles/s41586-023-06096-3 : > Abstract: [...] In the regime of strong entanglement, the quantum computer provides correct results for which leading classical approximations such as pure-state-based 1D (matrix product states, MPS) and 2D (isometric tensor network states, isoTNS) tensor network methods [2,3] break down. These experiments demonstrate a foundational tool for the realization of near-term quantum applications [4,5]
- westurner 2y ago
  NewsArticle: "Computers Find Impossible Solution, Beating Quantum Tech at Own Game" (2024) https://www.sciencealert.com/computers-find-impossible-solution-beating-quantum-tech-at-own-game https://www.sciencealert.com/computers-find-impossible-solut... : > As successful as that test was, follow-up experiments have shown classical computers can do it too. > According to the Flatiron Institute's Joseph Tindall and Dries Sels, this is possible because of a behavior called confinement, in which extremely stable states appear in the interconnected chaos of undecided particle properties, giving a classical computer something it can model.

2 points by westurner 2y ago

"Confinement in the Transverse Field Ising model on the Heavy Hex lattice" (2024) https://journals.aps.org/prl/abstract/10.1103/PhysRevLett.133.180402 https://journals.aps.org/prl/abstract/10.1103/PhysRevLett.13... : > Abstract: Inspired by a recent quantum computing experiment [Y. Kim et al., Nature (London), 618, 500–5 (2023)], we study the emergence of confinement in the transverse field Ising model on a decorated hexagonal lattice. Using an infinite tensor network state optimized with belief propagation we show how a quench from a broken symmetry state leads to striking nonthermal behavior underpinned by persistent oscillations and saturation of the entanglement entropy. We explain this phenomenon by constructing a minimal model based on the confinement of elementary excitations. Our model is in excellent agreement with our numerical results. For quenches to larger values of the transverse field and/or from nonsymmetry broken states, our numerical results display the expected signatures of thermalization: a linear growth of entanglement entropy in time, propagation of correlations, and the saturation of observables to their thermal averages. These results provide a physical explanation for the unexpected classical simulability of the quantum dynamics. "Evidence for the utility of quantum computing before fault tolerance" (2023) https://www.nature.com/articles/s41586-023-06096-3 https://www.nature.com/articles/s41586-023-06096-3 : > Abstract: [...] In the regime of strong entanglement, the quantum computer provides correct results for which leading classical approximations such as pure-state-based 1D (matrix product states, MPS) and 2D (isometric tensor network states, isoTNS) tensor network methods [2,3] break down. These experiments demonstrate a foundational tool for the realization of near-term quantum applications [4,5]

westurner 2y ago
NewsArticle: "Computers Find Impossible Solution, Beating Quantum Tech at Own Game" (2024) https://www.sciencealert.com/computers-find-impossible-solution-beating-quantum-tech-at-own-game https://www.sciencealert.com/computers-find-impossible-solut... : > As successful as that test was, follow-up experiments have shown classical computers can do it too. > According to the Flatiron Institute's Joseph Tindall and Dries Sels, this is possible because of a behavior called confinement, in which extremely stable states appear in the interconnected chaos of undecided particle properties, giving a classical computer something it can model.