相关论文: Ising Machines for Diophantine Problems in Physics
Inverse problems in statistical physics are motivated by the challenges of `big data' in different fields, in particular high-throughput experiments in biology. In inverse problems, the usual procedure of statistical physics needs to be…
We study the glued-trees problem of Childs et. al. in the adiabatic model of quantum computing and provide an annealing schedule to solve an oracular problem exponentially faster than classically possible. The Hamiltonians involved in the…
In this work we investigate the capabilities of a hybrid quantum-classical procedure to explore the solution space using the D-Wave $2000Q^{TM}$ Quantum Annealer device. Here we study the ability of the Quantum hardware to solve the Number…
A technique inspired on quantum annealing is proposed in order to obtain the classical ground state of a spin-glass by tracking the full wavefunction of a given system within the subspace of matrix product states (MPS), using the density…
Demonstrations of quantum advantage for certain sampling problems have generated considerable excitement for quantum computing and have further spurred the development of circuit-model quantum computers, which represent quantum programs as…
Using a specially constructed set of hard 2-SAT problems with four satisfying assignments, we study the scaling and sampling performance of numerical simulation of quantum annealing as well as that of the physical quantum annealers offered…
Quantum computation is a promising emerging technology, and by utilizing the principles of quantum mechanics, it is expected to achieve faster computations than classical computers for specific problems. There are two distinct architectures…
Quantum annealers are suited to solve several logistic optimization problems expressed in the QUBO formulation. However, the solutions proposed by the quantum annealers are generally not optimal, as thermal noise and other disturbing…
Oscillator based Ising machines are non-von-Neumann machines ideally suited for solving combinatorial problems otherwise intractable on classic stored-program digital computers due to their run-time complexity. Possible future applications…
The renormalization group flows of the one-dimensional anisotropic XY model and quantum Ising model under a transverse field are obtained by different multiscale entanglement renormalization ansatz schemes. It is shown that the optimized…
Polynomial systems over the binary field have important applications, especially in symmetric and asymmetric cryptanalysis, multivariate-based post-quantum cryptography, coding theory, and computer algebra. In this work, we study the…
We introduce a two-parameter approximate counter-diabatic term into the Hamiltonian of the transverse-field Ising model for quantum annealing to accelerate convergence to the solution, generalizing an existing single-parameter approach. The…
Quadratic unconstrained binary optimization (QUBO) is the mathematical formalism for phrasing and solving a class of optimization problems that are combinatorial in nature. Due to their natural equivalence with the two dimensional Ising…
In quantum gauge theories, anomaly cancellation severely restricts the allowed patterns of chiral charges. Here we show that, in a phenomenologically motivated framework for light minicharged particles, the anomaly cancellation conditions…
The notion of duality -- that a given physical system can have two different mathematical descriptions -- is a key idea in modern theoretical physics. Establishing a duality in lattice statistical mechanics models requires the construction…
I present a novel use of quantum annealing to solve the Set Splitting Problem using (QUBO) problem formulation. The contribution of the work is in formulating penalty functions that ensure the ground state of the QUBO Hamiltonian…
We propose a novel quantum technique to search for unmodeled anomalies in multidimensional binned collider data. We propose associating an Ising lattice spin site with each bin, with the Ising Hamiltonian suitably constructed from the…
Charged particle reconstruction or track reconstruction is one of the most crucial components of pattern recognition in high-energy collider physics. It is known to entail enormous consumption of computing resources, especially when the…
The scaling limit of the two-dimensional Ising model in the plane of temperature and magnetic field defines a field theory which provides the simplest illustration of non-trivial phenomena such as spontaneous symmetry breaking and…
Adiabatic quantum computing is an analog quantum computing scheme with various applications in solving optimization problems. In the parity picture of quantum optimization, the problem is encoded in local fields that act on qubits which are…