Related papers: The Computational Power of Symmetric Hamiltonians
We propose a method for Hamiltonian engineering in quantum information processing architectures that requires no local control, but only relies on collective qubit rotations and field gradients. The technique achieves a spatial modulation…
We discuss classical and quantum computations in terms of corresponding Hamiltonian dynamics. This allows us to introduce quantum computations which involve parallel processing of both: the data and programme instructions. Using mixed…
How well can quantum computers simulate classical dynamical systems? There is increasing effort in developing quantum algorithms to efficiently simulate dynamics beyond Hamiltonian simulation, but so far exact resource estimates are not…
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 has been established that local lattice spin Hamiltonians can be used for universal adiabatic quantum computation. However, the 2-local model Hamiltonians used in these proofs are general and hence do not limit the types of interactions…
We show, for the first time, that continuous dynamical decoupling can preserve the coherence of a two-qubit state as it evolves during a SWAP quantum operation. Hence, because the Heisenberg exchange interaction alone can be used for…
Quantum annealing (QA) is a promising approach for not only solving combinatorial optimization problems but also simulating quantum many-body systems such as those in condensed matter physics. However, non-adiabatic transitions constitute a…
Any quantum system with a non-trivial Hamiltonian is able to simulate any other Hamiltonian evolution provided that a sufficiently large group of unitary control operations is available. We show that there exist finite groups with this…
A quantum simulator is a device engineered to reproduce the properties of an ideal quantum model. It allows the study of quantum systems that cannot be efficiently simulated on classical computers. While a universal quantum computer is also…
A number of many-body problems can be formulated using Hamiltonians that are quadratic in the creation and annihilation operators. Here, we show how such quadratic Hamiltonians can be efficiently estimated indirectly, employing very few…
We show how to implement quantum computation on a system with an intrinsic Hamiltonian by controlling a limited subset of spins. Our primary result is an efficient control sequence on a nearest-neighbor XY spin chain through control of a…
The linearity inherent in quantum mechanics limits current quantum hardware from directly solving nonlinear systems governed by nonlinear differential equations. One can opt for linearization frameworks such as Carleman linearization, which…
We construct a family of time-independent nearest-neighbor Hamiltonians coupling eight-state systems on a 1D ring that enables universal quantum computation. Hamiltonians in this family can achieve universality either by driving a…
Simulation of quantum systems is notoriously challenging for classical computers, while quantum hardware is naturally well-suited for this task. However, the imperfections of contemporary quantum systems poses a considerable challenge in…
It is natural to investigate if the quantization of an integrable or superintegrable classical Hamiltonian systems is still integrable or superintegrable. We study here this problem in the case of natural Hamiltonians with constants of…
Digital-analog is a quantum computational paradigm that employs the natural interaction Hamiltonian of a system as the entangling resource, combined with single qubit gates, to implement universal quantum operations. As in the case of its…
Simulation of quantum dynamics is a grand challenge of computational physics. In this work we investigate methods for reducing the demands of such simulation by identifying reduced-order models for dynamics generated by parameterized…
In recent years quantum simulation has made great strides culminating in experiments that operate in a regime that existing supercomputers cannot easily simulate. Although this raises the possibility that special purpose analog quantum…
Without wasting time and effort on philosophical justifications and implications, we write down the conditions for the Hamiltonian of a quantum system for rendering it mathematically equivalent to a deterministic system. These are the…
A new method for quantum computation in the presence of detected spontaneous emission is proposed. The method combines strong and fast (dynamical decoupling) pulses and a quantum error correcting code that encodes $n$ logical qubits into…