Related papers: qSWIFT: High-order randomized compiler for Hamilto…
We develop new algorithms for Quantum Singular Value Transformation (QSVT), a unifying framework that encapsulates most known quantum algorithms and serves as the foundation for new ones. Existing implementations of QSVT rely on block…
We propose a simple quantum algorithm for simulating highly oscillatory quantum dynamics, which does not require complicated quantum control logic for handling time-ordering operators. To our knowledge, this is the first quantum algorithm…
Quantum Hamiltonian identification is important for characterizing the dynamics of quantum systems, calibrating quantum devices and achieving precise quantum control. In this paper, an effective two-step optimization (TSO) quantum…
We present a tool QSeqSim, a Qiskit-integrated symbolic backend that fills the current gap of having no Qiskit-native support for simulating while-loop quantum programs and their induced sequential quantum circuits. QSeqSim takes Qiskit…
This article proposes a formalism which unifies Hamiltonian simulation techniques from different fields. This formalism leads to a competitive method to construct the Hamiltonian simulation with a comprehensible, simple-to-implement circuit…
In this article, we compare the methods implementing the real-time evolution operator generated by a unitary diagonal matrix where its entries obey a known underlying real function. When the size of the unitary diagonal matrix is small, a…
We introduce AppQSim, a benchmarking suite for quantum computers focused on applications of Hamiltonian simulation. We consider five different settings for which we define a precise task and score: condensed matter and material simulation…
Quantum signal processing (QSP) is a powerful toolbox for the design of quantum algorithms and can lead to asymptotically optimal computational costs. Its realization on noisy quantum computers without fault tolerance, however, is…
We introduce a novel open-source software package QForte, a comprehensive development tool for new quantum simulation algorithms. QForte incorporates functionality for handling molecular Hamiltonians, fermionic encoding, ansatz…
High-fidelity quantum gates are an essential prerequisite for large-scale quantum computation. When manipulating practical quantum systems, environmentally and operationally induced errors are inevitable, and thus, in addition to being…
Realizing a conceptual quantum algorithm on an actual physical device necessitates the algorithm's quantum circuit description to undergo certain transformations in order to adhere to all constraints imposed by the hardware. In this regard,…
We propose a computational protocol for quantum simulations of Fermionic Hamiltonians on a quantum computer, enabling calculations which were previously not feasible with conventional encoding and ansatses of variational quantum…
Quantum computation is traditionally expressed in terms of quantum bits, or qubits. In this work, we instead consider three-level qu$trits$. Past work with qutrits has demonstrated only constant factor improvements, owing to the $\log_2(3)$…
We give three new algorithms for efficient in-place estimation, without using ancilla qubits, of average fidelity of a quantum logic gate acting on a d-dimensional system using much fewer random bits than what was known so far. Previous…
We present and experimentally implement a real-time protocol for calibrating the frequency of a resonantly driven qubit, achieving exponential scaling in calibration precision with the number of measurements, up to the limit imposed by…
As established in the seminal work by Berry et al.[1], expanding the time evolution operator using truncated Taylor series (up to some order $K$) makes a good candidate for simulating Hamiltonian dynamics. Here, we adapt the method but…
We introduce a framework for simulating hybrid oscillator-qubit quantum processors on qubit-only systems through position encoding. By encoding continuous-variable position and momentum wave functions into qubit amplitudes, our method…
We present a simple but general framework for constructing quantum circuits that implement the multiply-controlled unitary $\text{Select}(H) \equiv \sum_\ell |\ell\rangle\langle\ell|\otimes H_\ell$, where $H = \sum_\ell H_\ell$ is the…
The Quantum Skip Gate (QSG) is a unitary circuit primitive that coherently superposes the execution and omission of an expensive quantum subroutine based on the outcome of a cheaper preceding subroutine, without mid-circuit measurement or…
We propose and validate on real quantum computing hardware a new method for extended two-qubit gate set design, replacing iterative, fine calibration with fast characterization of a small number of gate parameters which are then tracked and…