相关论文: Simulating Arbitrary Pair-Interactions by a Given …
A promising approach to achieve computational supremacy over the classical von Neumann architecture explores classical and quantum hardware as Ising machines. The minimisation of the Ising Hamiltonian is known to be NP-hard problem for…
Non-deterministic polynomial-time (NP) problems are ubiquitous in almost every field of study. Recently, all-optical approaches have been explored for solving classic NP problems based on the spin-glass Ising Hamiltonian. However, obtaining…
We determine the computational complexity of approximately counting and sampling independent sets of a given size in bounded-degree graphs. That is, we identify a critical density $\alpha_c(\Delta)$ and provide (i) for $\alpha <…
In this paper we consider the computational complexity of uniformizing a domain with a given computable boundary. We give nontrivial upper and lower bounds in two settings: when the approximation of boundary is given either as a list of…
We calculate the frame potential for Brownian clusters of $N$ spins or fermions with time-dependent all-to-all interactions. In both cases the problem can be mapped to an effective statistical mechanics problem which we study using a path…
We construct Hamiltonians with only 1- and 2-body interactions that exhibit an exact non-Abelian gauge symmetry (specifically, combinatiorial gauge symmetry). Our spin Hamiltonian realizes the quantum double associated to the group of…
We develop a method to estimate the spin-spin interactions in the Hamiltonian from the observed magnetization curve by machine learning based on Bayesian inference. In our method, plausible spin-spin interactions are determined by…
Precise knowledge of the Hamiltonian of a system is a key to many of its applications. Tasks such state transfer or quantum computation have been well studied with a linear chain, but hardly with systems, which do not possess a linear…
We derive a universal Hamiltonian for a quantum dot in the presence of spin-orbit interaction in the symmetry limits of a strong spin-dependent Aharonov-Bohm-like term. We also derive a closed expression for the conductance through such a…
The energy spectra of two different quantum systems are paired through supersymmetric algorithms. One of the systems is Hermitian and the other is characterized by a complex-valued potential, both of them with only real eigenvalues in their…
We present a simple criterion for solvability of lattice spin systems on the basis of the graph theory and the simplicial homology. The lattice systems satisfy algebras with graphical representations. It is shown that the null spaces of…
We investigate the effect of periodic driving by an external field on systems with attractive pairing interactions. These include spin systems (like the ferromagnetic XXZ model) as well as ultracold fermionic atoms described by the…
The notion of treewidth, introduced by Robertson and Seymour in their seminal Graph Minors series, turned out to have tremendous impact on graph algorithmics. Many hard computational problems on graphs turn out to be efficiently solvable in…
Motivated by experimental limitations commonly met in the design of solid state quantum computers, we study the problems of non-local Hamiltonian simulation and non-local gate synthesis when only homogeneous local unitaries are performed in…
We introduce a family of many-body systems of distinguishable continuous-variable particles in which interparticle interactions are set by the adjacency matrix of a graph. The ground-state wavefunction of such systems is of a generalized…
We construct a nearest-neighbor Hamiltonian whose ground states encode the solutions to the NP-complete problem INDEPENDENT SET in cubic planar graphs. The Hamiltonian can be easily simulated by Ising interactions between adjacent particles…
Today's devices for quantum computing are still far from implementing useful and powerful quantum algorithms. Decoherence and the wish to resist the effects of errors in a system of quantum bits incurs a lot of overhead in the number of…
The observation of genuine quantum effects in systems governed by non-Hermitian Hamiltonians has been an outstanding challenge in the field. Here we simulate the evolution under such Hamiltonians in the quantum regime on a superconducting…
The understanding of out-of-equilibrium physics, especially dynamic instabilities and dynamic phase transitions, is one of the major challenges of contemporary science, spanning the broadest wealth of research areas that range from quantum…
The complexity of graph homomorphisms has been a subject of intense study [11, 12, 4, 42, 21, 17, 6, 20]. The partition function $Z_{\mathbf A}(\cdot)$ of graph homomorphism is defined by a symmetric matrix $\mathbf A$ over $\mathbb C$. We…