Zobrazeno 1 - 10
of 30
pro vyhledávání: '"Soleimanifar, Mehdi"'
Autor:
Ramkumar, Akshar, Soleimanifar, Mehdi
Providing evidence that quantum computers can efficiently prepare low-energy or thermal states of physically relevant interacting quantum systems is a major challenge in quantum information science. A newly developed quantum Gibbs sampling algorithm
Externí odkaz:
http://arxiv.org/abs/2411.04454
A naive classical representation of an n-qubit state requires specifying exponentially many amplitudes in the computational basis. Past works have demonstrated that classical neural networks can succinctly express these amplitudes for many physically
Externí odkaz:
http://arxiv.org/abs/2410.23152
We study random constant-depth quantum circuits in a two-dimensional architecture. While these circuits only produce entanglement between nearby qubits on the lattice, long-range entanglement can be generated by measuring a subset of the qubits of th
Externí odkaz:
http://arxiv.org/abs/2407.21203
Certifying that an n-qubit state synthesized in the lab is close to the target state is a fundamental task in quantum information science. However, existing rigorous protocols either require deep quantum circuits or exponentially many single-qubit me
Externí odkaz:
http://arxiv.org/abs/2404.07281
Autor:
Soleimanifar, Mehdi
This thesis focuses on quantum information and quantum computing, and their applications in studying quantum many-body systems. A remarkable interplay between computer science and quantum physics in the past few decades has revealed that a precise co
Externí odkaz:
https://hdl.handle.net/1721.1/150722
Autor:
Soleimanifar, Mehdi, Wright, John
Devising schemes for testing the amount of entanglement in quantum systems has played a crucial role in quantum computing and information theory. Here, we study the problem of testing whether an unknown state $|\psi\rangle$ is a matrix product state
Externí odkaz:
http://arxiv.org/abs/2201.01824
We consider the task of approximating the ground state energy of two-local quantum Hamiltonians on bounded-degree graphs. Most existing algorithms optimize the energy over the set of product states. Here we describe a family of shallow quantum circui
Externí odkaz:
http://arxiv.org/abs/2105.01193
Publikováno v:
Nature Physics (2022)
In this work, we make a connection between two seemingly different problems. The first problem involves characterizing the properties of entanglement in the ground state of gapped local Hamiltonians, which is a central topic in quantum many-body phys
Externí odkaz:
http://arxiv.org/abs/2004.15009
Publikováno v:
Nature Physics, 2021 (Extended abstract in FOCS 2020)
We study the problem of learning the Hamiltonian of a quantum many-body system given samples from its Gibbs (thermal) state. The classical analog of this problem, known as learning graphical models or Boltzmann machines, is a well-studied question in
Externí odkaz:
http://arxiv.org/abs/2004.07266
Publikováno v:
Proc of STOC 2020, pp 378-386
In this paper, we present a quasi-polynomial time classical algorithm that estimates the partition function of quantum many-body systems at temperatures above the thermal phase transition point. It is known that in the worst case, the same problem is
Externí odkaz:
http://arxiv.org/abs/1910.09071