相关论文: Simulating Arbitrary Pair-Interactions by a Given …

Unitary operations are the building blocks of quantum programs. Our task is to design effcient or optimal implementations of these unitary operations by employing the intrinsic physical resources of a given n-qubit system. The most common…

We propose an algorithm for simulating the dynamics of a geometrically local Hamiltonian $A$ under a small geometrically local perturbation $\alpha B$. In certain regimes, the algorithm achieves the optimal scaling and outperforms the…

We investigate the power of quantum systems for the simulation of Hamiltonian time evolutions on a cubic lattice under the constraint of translational invariance. Given a set of translationally invariant local Hamiltonians and short range…

We consider quantum systems consisting of a linear chain of n harmonic oscillators coupled by a nearest neighbour interaction of the form $-q_r q_{r+1}$ ($q_r$ refers to the position of the $r$th oscillator). In principle, such systems are…

We present a methodology for generating Ising Hamiltonians of tunable complexity and with a priori known ground states based on a decomposition of the model graph into edge-disjoint subgraphs. The idea is illustrated with a spin-glass model…

Extensions of average Hamiltonian theory to quantum computation permit the design of arbitrary Hamiltonians, allowing rotations throughout a large Hilbert space. In this way, the kinematics and dynamics of any quantum system may be…

A large family of multispin interacting one-dimensional quantum spin models with $Z(N)$ symmetry and a free-particle eigenspectra are known in the literature. They are free-fermionic ($N=2$) and free-parafermionic ($N\geq 2$) quantum…

Many coherence transfer experiments in Nuclear Magnetic Resonance Spectroscopy, involving network of coupled spins, use temporary spin-decoupling to produce desired effective Hamiltonians. In this paper, we show that significant time can be…

We present a quantum algorithm for the dynamical simulation of time-dependent Hamiltonians. Our method involves expanding the interaction-picture Hamiltonian as a sum of generalized permutations, which leads to an integral-free Dyson series…

We present quantum complexity lower and upper bounds for independent set problems in graphs. In particular, we give quantum algorithms for computing a maximal and a maximum independent set in a graph. We present applications of these…

We demonstrate how electric fields with arbitrary time profile can be used to control the time-dependent parameters of spin and orbital exchange Hamiltonians. Analytic expressions for the exchange constants are derived from a time-dependent…

We present a universal quantum Monte Carlo algorithm for simulating arbitrary high-spin (spin greater than 1/2) Hamiltonians, based on the recently developed permutation matrix representation (PMR) framework. Our approach extends a…

Recent numerical advances in the field of strongly correlated electron systems allow the calculation of the entanglement spectrum and entropies for interacting fermionic systems. An explicit determination of the entanglement (modular)…

The emergence of a collective behavior in a many-body system is responsible of the quantum criticality separating different phases of matter. Interacting spin systems in a magnetic field offer a tantalizing opportunity to test different…

One-dimensional atomic mixtures of fermions can effectively realize spin chains and thus constitute a clean and controllable platform to study quantum magnetism. Such strongly correlated quantum systems are also of sustained interest to…

We describe an efficient approximation algorithm for evaluating the ground-state energy of the classical Ising Hamiltonian with linear terms on an arbitrary planar graph. The running time of the algorithm grows linearly with the number of…

Interaction frames play an important role in describing and understanding experimental schemes in magnetic resonance. They are often used to eliminate dominating parts of the spin Hamiltonian, e.g., the Zeeman Hamiltonian in the usual…

The quantum circuit model allows gates between any pair of qubits yet physical instantiations allow only limited interactions. We address this problem by providing an interaction graph together with an efficient method for compiling quantum…

Complexity plays a very important part in quantum computing and simulation where it acts as a measure of the minimal number of gates that are required to implement a unitary circuit. We study the lower bound of the complexity [Eisert, Phys.…

Correlated electron materials, such as superconductors and magnetic materials, are regarded as fascinating targets in quantum computing. However, the quantitative resources, specifically the number of quantum gates and qubits, required to…