Related papers: Sequency Hierarchy Truncation (SeqHT) for Adiabati…
The observation of genuine quantum effects in systems governed by non-Hermitian Hamiltonians has been an outstanding challenge in the field. Here we simulate the evolution under such Hamiltonians in the quantum regime on a superconducting…
The quadrature-based balanced truncation (QuadBT) framework of arXiv:2104.01006 is a non-intrusive reformulation of balanced truncation (BT), a classical projection-based model-order reduction technique for linear systems. QuadBT is…
Quantum computing applications in the noisy intermediate-scale quantum (NISQ) era require algorithms that can generate shallower circuits feasible for today's quantum systems. This is particularly challenging for quantum chemistry…
Matrix product states provide a natural entanglement basis to represent a quantum register and operate quantum gates on it. This scheme can be materialized to simulate a quantum adiabatic algorithm solving hard instances of a NP-Complete…
The preparation of $n$-qubit quantum states is a cross-cutting subroutine for many quantum algorithms, and the effort to reduce its circuit complexity is a significant challenge. In the literature, the quantum state preparation algorithm by…
Quantum simulation algorithms often require numerous ancilla qubits and deep circuits, prohibitive for near-term hardware. We introduce a framework for simulating quantum channels using ensembles of low-depth circuits in place of many-qubit…
Quantum networks are expected to be heterogeneous systems, combining distinct qubit platforms, photon wavelengths, and device timescales to achieve scalable, multiuser connectivity. Building and iterating on such systems is costly and slow,…
Quantum state preparation lies at the heart of quantum computation and quantum simulations, enabling the investigation of complex manybody systems across physics, chemistry, and data science. While existing methods such as Variational…
It is crucial to reduce the resources required to run quantum algorithms and simulate physical systems on quantum computers due to coherence time limitations. With regards to Hamiltonian simulation, a significant effort has focused on…
Quantum coherence profoundly alters classical thermodynamic expectations by modifying the structure and accessibility of probability distributions. Classically, transitions to lower-entropy states (local second-law violations) are…
We describe a simple, efficient method for simulating Hamiltonian dynamics on a quantum computer by approximating the truncated Taylor series of the evolution operator. Our method can simulate the time evolution of a wide variety of…
Adiabatic quantum algorithms are characterized by their run time and accuracy. The relation between the two is essential for quantifying adiabatic algorithmic performance, yet is often poorly understood. We study the dynamics of a…
Quantum adiabatic optimization seeks to solve combinatorial problems using quantum dynamics, requiring the Hamiltonian of the system to align with the problem of interest. However, these Hamiltonians are often incompatible with the native…
A central challenge in quantum machine learning is the design and training of parameterized quantum circuits (PQCs). Much like in deep learning, vanishing gradients pose significant obstacles to the trainability of PQCs, arising from…
Modeling non-Hermitian Hamiltonians is increasingly important in classical and quantum domains, especially when studying open systems, $PT$ symmetry, and resonances. However, the quantum simulation of these models has been limited by the…
Adiabatic quantum computation provides an alternative approach to quantum computation using a time-dependent Hamiltonian. The time evolution of entanglement during the adiabatic quantum search algorithm is studied, and its relevance as a…
Recent advances in quantum information science enabled the development of quantum communication network prototypes and created an opportunity to study full-stack quantum network architectures. This work develops SeQUeNCe, a comprehensive,…
Quantum state preparation is an important subroutine for quantum computing. We show that any $n$-qubit quantum state can be prepared with a $\Theta(n)$-depth circuit using only single- and two-qubit gates, although with a cost of an…
We introduce a digital-analog quantum computing framework that enables counterdiabatic protocols to be implemented at constant circuit depth, allowing fast and resource-efficient quantum state preparation on current quantum hardware.…
We propose and experimentally demonstrate sequential quantum computing (SQC), a paradigm that utilizes multiple homogeneous or heterogeneous quantum processors in hybrid classical-quantum workflows. In this manner, we are able to overcome…