Related papers: Quantum Supremacy for Simulating A Translation-Inv…
In this work, we study and evaluate the impact of a periodic spin-lattice coupling in an Ising-like system on a 2D triangular lattice. Our proposed simple Hamiltonian considers this additional interaction as an effect of preferential phonon…
A phenomenological Hamiltonian of a closed (i.e., unitary) quantum system is assumed to have an $N$ by $N$ real-matrix form composed of a unperturbed diagonal-matrix part $H^{(N)}_0$ and of a tridiagonal-matrix perturbation…
Photonic Ising Machines constitute an emergent new paradigm of computation, geared towards tackling combinatorial optimization problems that can be reduced to the problem of finding the ground state of an Ising model. Spatial Photonic Ising…
Classical integrable Hamiltonian systems generated by elements of the Poisson commuting ring of spectral invariants on rational coadjoint orbits of the loop algebra $\wt{\gr{gl}}^{+*}(2,{\bf R})$ are integrated by separation of variables in…
Fitting geometric models onto outlier contaminated data is provably intractable. Many computer vision systems rely on random sampling heuristics to solve robust fitting, which do not provide optimality guarantees and error bounds. It is…
Simple constructions and protocols are demonstrated to allow the implementation of universal quantum computation on an arbitrarily large quantum system by controlling a fixed number of spins, vastly reducing the engineering requirements in…
We consider quantum-to-classical mapping for an arbitrary system of interacting spins at finite temperatures. We prove that, in the large-$S$ limit, the asymptotic form of the partition function coincides with that of a classical model for…
We study a soliton in an optical lattice holding bosonic atoms quantum mechanically using both an exact numerical solution and quantum Monte Carlo simulations. The computation of the state is combined with an explicit account of the…
We study the dynamics of the Gaudin magnet ("central-spin model") using machine-learning methods. This model is of practical importance, e.g., for studying non-Markovian decoherence dynamics of a central spin interacting with a large bath…
Discrete translational symmetry plays a fundamental role in condensed matter physics and lattice gauge theories, enabling the analysis of systems that would otherwise be intractable. Despite this, many open problems remain. Quantum…
Hamiltonian simulation is a promising application for quantum computers to achieve a quantum advantage. We present classical algorithms based on tensor network methods to optimize quantum circuits for this task. We show that, compared to…
In this work we propose an approach for implementing time-evolution of a quantum system using product formulas. The quantum algorithms we develop have provably better scaling (in terms of gate complexity and circuit depth) than a naive…
The notion of compressed quantum computation is employed to simulate the Ising interaction of a 1D--chain consisting out of $n$ qubits using the universal IBM cloud quantum computer running on $\log(n)$ qubits. The external field parameter…
Quantum simulation has become a promising avenue of research that allows one to simulate and gain insight into the models of High Energy Physics whose experimental realizations are either complicated or inaccessible with current technology.…
Systems of interacting quantum spins show a rich spectrum of quantum phases and display interesting many-body dynamics. Computing characteristics of even small systems on conventional computers poses significant challenges. A quantum…
A novel quantum-classical hybrid scheme is proposed to efficiently solve large-scale combinatorial optimization problems. The key concept is to introduce a Hamiltonian dynamics of the classical flux variables associated with the quantum…
Spin squeezing is a form of entanglement that reshapes the quantum projection noise to improve measurement precision. Here, we provide numerical and analytic evidence for the following conjecture: any Hamiltonian exhibiting finite…
Classical information loading is an essential task for many processing quantum algorithms, constituting a cornerstone in the field of quantum machine learning. In particular, the embedding techniques based on Hamiltonian simulation…
Quantum supremacy is the ability of quantum processors to outperform classical computers at certain tasks. In digital random quantum circuit approaches for supremacy, the output distribution produced is described by the Porter-Thomas (PT)…
We use the class of commuting quantum computations known as IQP (Instantaneous Quantum Polynomial time) to strengthen the conjecture that quantum computers are hard to simulate classically. We show that, if either of two plausible…