Related papers: Simulation of Non-Hermitian Hamiltonians with Biva…
We describe a simple method for simulating time-independent Hamiltonian $H$ that could be decomposed as $H = \sum_{i=1}^m H_i$ where each $H_i$ can be efficiently simulated. Approaches relying on product formula generally work by splitting…
In the holonomic approach to quantum computation information is encoded in a degenerate eigenspace of a parametric family of Hamiltonians and manipulated by the associated holonomic gates. These are realized in terms of the non-abelian…
Quantum Signal Processing (QSP) is a technique that can be used to implement a polynomial transformation $P(x)$ applied to the eigenvalues of a unitary $U$, essentially implementing the operation $P(U)$, provided that $P$ satisfies some…
In the recently quickly developing context of quantum mechanics of unitary systems using a time-independent non-Hermitian Hamiltonian $H$ (having real spectrum and defined as acting in an unphysical but user-friendly Hilbert space ${\cal…
Non-Hermitian systems have emerged as a powerful paradigm for ultrasensitive sensing, leveraging unique spectral and dynamical properties that find no counterparts in Hermitian physics. While recent theoretical assessments have established…
Quantum effects like entanglement and coherent amplification can be used to drastically enhance the accuracy of quantum parameter estimation beyond classical limits. However, challenges such as decoherence and time-dependent errors hinder…
Prime factorization on quantum processors is typically implemented either via circuit-based approaches such as Shor's algorithm or through Hamiltonian optimization methods based on adiabatic, annealing, or variational techniques. While…
The Hamiltonian H specifies the energy levels and time evolution of a quantum theory. A standard axiom of quantum mechanics requires that H be Hermitian because Hermiticity guarantees that the energy spectrum is real and that time evolution…
Quantum Signal Processing (QSP) has emerged as a promising framework to manipulate and determine properties of quantum systems. QSP not only unifies most existing quantum algorithms but also provides tools to discover new ones. Quantum…
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…
Quantum sensing using non-linear interferometers offers the possibility of bicolour imaging, using light that never interacted with the object of interest, and provides a way to achieve phase supersensitivity, i.e. a Heisenberg-type scaling…
We report the quantum computing of reacting flows by simulating the Hamiltonian dynamics. The scalar transport equation for reacting flows is transformed into a Hamiltonian system, mapping the dissipative and non-Hermitian problem in…
Non-Hermitian systems generically have complex energies, which may host topological structures, such as links or knots. While there has been great progress in experimentally engineering non-Hermitian models in quantum simulators, it remains…
The Quantum Fourier Transform (QFT) is required by hidden subgroup problem (HSP) algorithms, including Shor's algorithm for factoring. The circuit depth of the QFT remains challenging for near-term hardware. To find shallower alternatives…
Quantum state preparation (QSP) for a general $n$-qubit state requires $O(2^n)$ CNOT gates and circuit depth, making exact amplitude encoding (EAE) impractical for near-term quantum hardware. We introduce an ancilla-free hybrid…
Quantum computing is increasingly offering concrete solutions toward the simulation of nuclear structure, with the potential to overcome the exponential scaling that limits classical diagonalization methods in large spaces. A particularly…
We show how, given a non-Hermitian Hamiltonian $H$, we can generate new non-Hermitian operators sequentially, producing a virtually infinite chain of non-Hermitian Hamiltonians which are isospectral to $H$ and $H^\dagger$ and whose…
The hidden subgroup problem~(HSP) is one of the most important problems in quantum computation. Many problems for which quantum algorithm achieves exponential speedup over its classical counterparts can be reduced to the Abelian HSP.…
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…
High-sensitivity quantum sensors are a promising tool for experimental searches for beyond-Standard-Model interactions. Here, we demonstrate an atomic comagnetometer operating under a resonantly-coupled hybrid spin-resonance (HSR) regime to…