相关论文: Simulating Hamiltonians in Quantum Networks: Effic…

Although a universal quantum computer is still far from reach, the tremendous advances in controllable quantum devices, in particular with solid-state systems, make it possible to physically implement "quantum simulators". 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 consider the problem of switching off unwanted interactions in a given multi-partite Hamiltonian. This is known to be an important primitive in quantum information processing and several schemes have been presented in the literature to…

Decoupling the interactions in a spin network governed by a pair-interaction Hamiltonian is a well-studied problem. Combinatorial schemes for decoupling and for manipulating the couplings of Hamiltonians have been developed which use…

Quantum simulation uses a well-known quantum system to predict the behavior of another quantum system. Certain limitations in this technique arise, however, when applied to specific problems, as we demonstrate with a theoretical and…

Parity-time ($PT$) symmetric Hamiltonians are generally non-Hermitian and give rise to exotic behaviour in quantum systems at exceptional points, where eigenvectors coalesce. The recent realisation of $PT$-symmetric Hamiltonians in quantum…

We consider the problem of selectively controlling couplings in a practical quantum processor with always-on interactions that are diagonal in the computational basis, using sequences of local NOT gates. This methodology is well-known in…

We have developed a concrete quantum simulation scheme and experimentally simulated a pairing model on an NMR quantum computer. The design of our experiment includes choosing an appropriate initial state in order to make our scheme scalable…

We propose a polynomial-time algorithm for simulation of the class of pairing Hamiltonians, e.g., the BCS Hamiltonian, on an NMR quantum computer. The algorithm adiabatically finds the low-lying spectrum in the vicinity of the gap between…

We use an n-spin system with permutation symmetric zz-interaction for simulating arbitrary pair-interaction Hamiltonians. The calculation of the required time overhead is mathematically equivalent to a separability problem of n-qubit…

We present a low-space overhead simulation algorithm based on the truncated Dyson series for time-dependent quantum dynamics. This algorithm is applied to simulating time-independent Hamiltonians by transitioning to the interaction picture,…

Estimating extensive combinations of local parameters in distributed quantum systems is a central problem in quantum sensing, with applications ranging from magnetometry to timekeeping. While optimal strategies are known for sensing…

Quantum simulation is a promising near term application for mesoscale quantum information processors, with the potential to solve computationally intractable problems at the scale of just a few dozen interacting quantum systems. Recent…

A powerful control method in experimental quantum computing is the use of spin echoes, employed to select a desired term in the system's internal Hamiltonian, while refocusing others. Here we address a more general problem, describing a…

We describe a simple quantum algorithm to simulate time-dependent Hamiltonian, extending the methodology of quantum signal processing. The framework achieves optimal scaling up to some factor with respect to other parameters, and nearly…

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…

We propose dynamical control schemes for Hamiltonian simulation in many-body quantum systems that avoid instantaneous control operations and rely solely on realistic bounded-strength control Hamiltonians. Each simulation protocol consists…

We describe an algorithm that computes the ground state energy and correlation functions for 2-local Hamiltonians in which interactions between qubits are weak compared to single-qubit terms. The running time of the algorithm is polynomial…

This chapter gives a self-contained review of the how standard open quantum system Hamiltonians can be mapped analytically onto representations in which the environments appear as one dimensional harmonic chains with nearest neighbour…

We propose an efficient quantum algorithm for simulating the dynamics of general Hamiltonian systems. Our technique is based on a power series expansion of the time-evolution operator in its off-diagonal terms. The expansion decouples the…