English
Related papers

Related papers: Hamiltonian Learning and Certification Using Quant…

200 papers

Numerical simulation of quantum systems is crucial to further our understanding of natural phenomena. Many systems of key interest and importance, in areas such as superconducting materials and quantum chemistry, are thought to be described…

Quantum Physics · Physics 2010-11-17 Katherine L Brown , William J Munro , Vivien M Kendon

We propose a quantum machine learning task that is provably easy for quantum computers and arguably hard for classical ones. The task involves predicting quantities of the form $\mathrm{Tr}[f(H)\rho]$, where $f$ is an unknown function,…

Quantum Physics · Physics 2025-05-09 Yuto Morohoshi , Akimoto Nakayama , Hidetaka Manabe , Kosuke Mitarai

Simulating real-time dynamics under a Hamiltonian is a central goal of quantum information science. While numerous Hamiltonian-simulation quantum algorithms have been proposed, the effects of physical noise have rarely been incorporated…

Quantum Physics · Physics 2026-03-13 Keisuke Murota , Synge Todo , Suguru Endo

The presence of symmetries, be they discrete or continuous, in a physical system typically leads to a reduction in the problem to be solved. Here we report that neither translational invariance nor rotational invariance reduce the…

Quantum Physics · Physics 2008-07-24 Alastair Kay

Quantum optimization algorithms hold the promise of solving classically hard, discrete optimization problems in practice. The requirement of encoding such problems in a Hamiltonian realized with a finite -- and currently small -- number of…

Quantum Physics · Physics 2023-07-10 Yifeng Rocky Zhu , David Joseph , Cong Ling , Florian Mintert

Hybrid classical-quantum algorithms aim at variationally solving optimisation problems, using a feedback loop between a classical computer and a quantum co-processor, while benefitting from quantum resources. Here we present experiments…

We obtain sufficient conditions for the efficient simulation of a continuous variable quantum algorithm or process on a classical computer. The resulting theorem is an extension of the Gottesman-Knill theorem to continuous variable quantum…

Quantum Physics · Physics 2007-05-23 Stephen D. Bartlett , Barry C. Sanders , Samuel L. Braunstein , Kae Nemoto

Since simulating quantum computers requires exponentially more classical resources, efficient algorithms are extremely helpful. We analyze algorithms that create single qubit and specific controlled qubit matrix representations of gates.…

Quantum Physics · Physics 2007-05-23 Eric Hsu

Recent work has demonstrated the existence of universal Hamiltonians - simple spin lattice models that can simulate any other quantum many body system to any desired level of accuracy. Until now proofs of universality have relied on…

Quantum Physics · Physics 2022-03-18 Tamara Kohler , Stephen Piddock , Johannes Bausch , Toby Cubitt

Quantum computing has long promised transformative advances in data analysis, yet practical quantum machine learning has remained elusive due to fundamental obstacles such as a steep quantum cost for the loading of classical data and poor…

We employ quantum circuit learning to simulate quantum field theories (QFTs). Typically, when simulating QFTs with quantum computers, we encounter significant challenges due to the technical limitations of quantum devices when implementing…

High Energy Physics - Theory · Physics 2025-04-08 Kazuki Ikeda

Various Hamiltonian simulation algorithms have been proposed to efficiently study the dynamics of quantum systems on a quantum computer. The existing algorithms generally approximate the time evolution operators, which may need a deep…

Quantum Physics · Physics 2024-03-14 Zi-Jian Zhang , Jinzhao Sun , Xiao Yuan , Man-Hong Yung

We introduce a quantum information theory-inspired method to improve the characterization of many-body Hamiltonians on near-term quantum devices. We design a new class of similarity transformations that, when applied as a preprocessing…

Quantum Physics · Physics 2024-07-24 Andi Gu , Hong-Ye Hu , Di Luo , Taylor L. Patti , Nicholas C. Rubin , Susanne F. Yelin

Simulating quantum circuits using classical computers lets us analyse the inner workings of quantum algorithms. The most complete type of simulation, strong simulation, is believed to be generally inefficient. Nevertheless, several…

Quantum Physics · Physics 2013-02-25 T. H. Johnson , J. D. Biamonte , S. R. Clark , D. Jaksch

Characterizing noisy quantum devices requires methods for learning the underlying quantum Hamiltonian which governs their dynamics. Often, such methods compare measurements to simulations of candidate Hamiltonians, a task which requires…

Quantum Physics · Physics 2021-10-13 Assaf Zubida , Elad Yitzhaki , Netanel H. Lindner , Eyal Bairey

Quantum computing is gaining increased attention as a potential way to speed up simulations of physical systems, and it is also of interest to apply it to simulations of classical plasmas. However, quantum information science is…

Plasma Physics · Physics 2024-06-19 I. Y. Dodin , E. A. Startsev

Digital quantum simulation has broad applications in approximating unitary evolution of Hamiltonians. In practice, many simulation tasks for quantum systems focus on quantum states in the low-energy subspace instead of the entire Hilbert…

Quantum Physics · Physics 2024-07-16 Weiyuan Gong , Shuo Zhou , Tongyang Li

We discuss Hamiltonian learning in quantum field theories as a protocol for systematically extracting the operator content and coupling constants of effective field theory Hamiltonians from experimental data. Learning the Hamiltonian for…

The required precision to perform quantum simulations beyond the capabilities of classical computers imposes major experimental and theoretical challenges. The key to solving these issues are precise means of characterizing analog quantum…

Quantum Physics · Physics 2024-11-11 Dominik Hangleiter , Ingo Roth , Jonas Fuksa , Jens Eisert , Pedram Roushan

The general problem of finding the ground state energy of lattice Hamiltonians is known to be very hard, even for a quantum computer. We show here that this is the case even for translationally invariant systems. We also show that a quantum…

Quantum Physics · Physics 2009-11-13 K. G. H. Vollbrecht , J. I. Cirac
‹ Prev 1 3 4 5 6 7 10 Next ›