Related papers: Global optimization of spin Hamiltonians with gain…
We develop circuit implementations for digital-level quantum Hamiltonian dynamics simulation algorithms suitable for implementation on a reconfigurable quantum computer, such as trapped ions. Our focus is on the co-design of a problem, its…
Given a generic time-dependent many-body quantum state, we determine the associated parent Hamiltonian. This procedure may require, in general, interactions of any sort. Enforcing the requirement of a fixed set of engineerable Hamiltonians,…
We develop the theory of canonical-dissipative systems, based on the assumption that both the conservative and the dissipative elements of the dynamics are determined by invariants of motion. In this case, known solutions for conservative…
For spins chains to be useful for quantum information processing tasks, the interaction between the spin chain and its environment generally needs to be suppressed. In this paper, we propose the use of strong static and oscillating control…
Recent experiments demonstrated quantum computational advantage in random circuit sampling and Gaussian boson sampling. However, it is unclear whether these experiments can lead to practical applications even after considerable research…
It is of great interest to understand the thermalization of open quantum many-body systems, and how quantum computers are able to efficiently simulate that process. A recently introduced disispative evolution, inspired by existing models of…
A common situation in quantum many-body physics is that the underlying theories are known but too complicated to solve efficiently. In such cases one usually builds simpler effective theories as low-energy or large-scale alternatives to the…
We present an approach to the numerical simulation of open quantum many-body systems based on the semiclassical framework of the discrete truncated Wigner approximation. We establish a quantum jump formalism to integrate the quantum master…
The Ising machine is an unconventional computing architecture that can be used to solve NP-hard combinatorial optimization problems more efficiently than traditional von Neumann architectures. Fast, compact oscillator networks which provide…
It is a general fact that the coupling constant of an interacting many-body Hamiltonian do not correspond to any observable and one has to infer its value by an indirect measurement. For this purpose, quantum systems at criticality can be…
In this note, we provide a unifying framework to investigate the computational complexity of classical spin models and give the full classification on spin models in terms of system dimensions, randomness, external magnetic fields and types…
We developed a Keplerian-based Hamiltonian splitting for solving the gravitational $N$-body problem. This splitting allows us to approximate the solution of a general $N$-body problem by a composition of multiple, independently evolved…
Geometric numerical integration has recently been exploited to design symplectic accelerated optimization algorithms by simulating the Lagrangian and Hamiltonian systems from the variational framework introduced in Wibisono et al. In this…
We study the spatio-temporal spreading of correlations in an ensemble of spins due to dissipation characterized by short- and long-range spatial profiles. We consider systems initially in an uncorrelated state, and find that correlations…
In this paper, we introduce a technique to enhance the computational efficiency of solution algorithms for high-dimensional discrete simulation-based optimization problems. The technique is based on innovative adaptive partitioning…
The past few years have witnessed the concrete and fast spreading of quantum technologies for practical computation and simulation. In particular, quantum computing platforms based on either trapped ions or superconducting qubits have…
We devise a deterministic algorithm to efficiently sample high-quality solutions of certain spin-glass systems that encode hard optimization problems. We employ tensor networks to represent the Gibbs distribution of all possible…
The controls enacting logical operations on quantum systems are described by time-dependent Hamiltonians that often include rapid oscillations. In order to accurately capture the resulting time dynamics in numerical simulations, a very…
The reduction of Hamiltonian systems aims to build smaller reduced models, valid over a certain range of time and parameters, in order to reduce computing time. By maintaining the Hamiltonian structure in the reduced model, certain…
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…