Related papers: Optimizing Strongly Interacting Fermionic Hamilton…
We analyze the scaling of quantum Fisher information with the number of system particles in the limit of large number of particles, as a function of the number of parties interacting with each other, for encoding Hamiltonians having…
We study a quantum-simulation model of a mass enhancement in the fermionic states, as well as in the bosonic ones, of the supersymmetric quantum mechanics. The bosonic and fermionic states are graded by a qubit. This model is so simple that…
In this review we discuss the latest results concerning development of the machine learning algorithms for characterization of the magnetic skyrmions that are topologically-protected magnetic textures originated from the…
We consider the problem of learning the Hamiltonian of a quantum system from estimates of Gibbs-state expectation values. Various methods for achieving this task were proposed recently, both from a practical and theoretical point of view.…
We analyze the quantum chaotic behavior of the Yukawa-SYK model as a function of filling and temperature, which describes random Yukawa interactions between $N$ complex fermions and $M$ bosons in zero spatial dimensions, for both the…
The optimal regularization of infinite-dimensional degrees of freedom is a central open problem in the tractable simulation of lattice gauge theories on quantum computers. Here, we consider regularizing the gauge field by replacing the…
Estimating thermal expectations of local observables is a natural target for quantum advantage. We give a simple classical algorithm that approximates thermal expectations for Gibbs states of local Hamiltonians, and we show it has…
We study several problems related to properties of non-negative matrices that arise at the boundary between quantum and classical probabilistic computation. Our results are twofold. First, we identify a large class of quantum Hamiltonians…
In this work, we address the problem of maximizing fidelity in a quantum state transformation process controlled in such a way as to keep decoherence within given bounds. We consider a three-level $\Lambda$-type atom subjected to Markovian…
We propose efficient algorithms for classically simulating fermionic linear optics operations applied to non-Gaussian initial states. By gadget constructions, this provides algorithms for fermionic linear optics with non-Gaussian…
We propose a hybrid quantum-classical algorithm for approximating the ground state and ground state energy of a Hamiltonian. Once the Ansatz has been decided, the quantum part of the algorithm involves the calculation of two overlap…
We study the SYK model -- an important toy model for quantum gravity on IBM's superconducting qubit quantum computers. By using a graph-coloring algorithm to minimize the number of commuting clusters of terms in the qubitized Hamiltonian,…
Bayesian quantum estimation provides a robust framework for quantum technologies, especially in scenarios with limited data and minimal prior information. Yet, its application to continuous-variable Gaussian systems has remained limited and…
It is a well-known fact that the optimal POVM for quantum state tomography is the symmetric, informationally complete, positive operator valued measure (SIC-POVM). We investigate the same problem only in the case when there are some a…
Tensor network states and specifically matrix-product states have proven to be a powerful tool for simulating ground states of strongly correlated spin models. Recently, they have also been applied to interacting fermionic problems,…
A model of quantum noisy channel with input encoding by a classical random vector is described. An equation of optimality is derived to determine a complete set of wave functions describing quantum decodings based on quasi-measurements…
We describe a general technique that yields the first {\em Statistical Query lower bounds} for a range of fundamental high-dimensional learning problems involving Gaussian distributions. Our main results are for the problems of (1) learning…
Simon in his FOCS'94 paper was the first to show an exponential gap between classical and quantum computation. The problem he dealt with is now part of a well-studied class of problems, the hidden subgroup problems. We study Simon's problem…
We explore the effectiveness of variational quantum circuits in simulating the ground states of quantum many-body Hamiltonians. We show that generic high-depth circuits, performing a sequence of layer unitaries of the same form, can…
The calculation of ground-state energies of physical systems can be formalised as the k-local Hamiltonian problem, which is the natural quantum analogue of classical constraint satisfaction problems. One way of making the problem more…