Related papers: Complexity classification of two-qubit commuting h…
Integrability is a cornerstone of classical mechanics, where it has a precise meaning. Extending this notion to quantum systems, however, remains subtle and unresolved. In particular, deciding whether a quantum Hamiltonian - viewed simply…
Clifford circuits -- i.e. circuits composed of only CNOT, Hadamard, and $\pi/4$ phase gates -- play a central role in the study of quantum computation. However, their computational power is limited: a well-known result of Gottesman and…
This work discusses simple examples how quantum systems are obtained as subsystems of classical statistical systems. For a single qubit with arbitrary Hamiltonian and for the quantum particle in a harmonic potential we provide explicitly…
We show here that the Hamiltonian for an electronic system may be written exactly in terms of fluctuation operators that transition constituent fragments between internally correlated states, accounting rigorously for inter-fragment…
We develop new constructions of 2D classical and quantum superintegrable Hamiltonians allowing separation of variables in Cartesian coordinates. In classical mechanics we start from two functions on a one-dimensional phase space, a natural…
We show that there exists a universal quantum Turing machine (UQTM) that can simulate every other QTM until the other QTM has halted and then halt itself with probability one. This extends work by Bernstein and Vazirani who have shown that…
We extend classical methods of computational complexity to the realm of distributed computing, where they sometimes prove more effective than in their original context. Our focus is on decision problems in the LOCAL model, a setting in…
A universal family of Hamiltonians can be used to simulate any local Hamiltonian by encoding its full spectrum as the low-energy subspace of a Hamiltonian from the family. Many spin-lattice model Hamiltonians -- such as Heisenberg or XY…
A concrete computation -- twelve slidings with sixteen tiles -- reveals that certain commutativity phenomena occur in every double semigroup. This can be seen as a sort of Eckmann-Hilton argument, but it does not use units. The result…
We formulate a systematic algorithm for constructing a whole class of Hermitian position-dependent-mass Hamiltonians which, to lowest order of perturbation theory, allow a description in terms of PT-symmetric Hamiltonians. The method is…
In topological quantum computation the geometric details of a particle trajectory are irrelevant; only the topology matters. Taking this one step further, we consider a model of computation that disregards even the topology of the particle…
What is the simplest Hamiltonian which can implement quantum computation without requiring any control operations during the computation process? In a previous paper we have constructed a 10-local finite-range interaction among qubits on a…
The Hamiltonian formalism offers a natural framework for discussing the notion of Poisson Lie T-duality. This is because the duality is inherent in the Poisson structures alone and exists regardless of the choice of Hamiltonian. Thus one…
We present a hybrid quantum-classical algorithm to simulate thermal states of a classical Hamiltonians on a quantum computer. Our scheme employs a sequence of locally controlled rotations, building up the desired state by adding qubits one…
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…
The goal of this work is to define a notion of a quantum neural network to classify data, which exploits the low energy spectrum of a local Hamiltonian. As a concrete application, we build a binary classifier, train it on some actual data…
The problem of simulating sparse Hamiltonians on quantum computers is well studied. The evolution of a sparse N x N Hamiltonian H for time t can be simulated using O(||Ht||poly(log N)) operations, which is essentially optimal due to a…
We study the computation power of lattices composed of two dimensional systems (qubits) on which translationally invariant global two-qubit gates can be performed. We show that if a specific set of 6 global two qubit gates can be performed,…
The practical application of quantum technologies to chemical problems faces significant challenges, particularly in the treatment of realistic basis sets and the accurate inclusion of electron correlation effects. A direct approach to…
Characterizing quantum many-body systems is a fundamental problem across physics, chemistry, and materials science. While significant progress has been made, many existing Hamiltonian learning protocols demand digital quantum control over…