Related papers: Optimized Aaronson-Gottesman stabilizer circuit si…
Many-body ground state preparation is an important subroutine used in the simulation of physical systems. In this paper, we introduce a flexible and efficient framework for obtaining a state preparation circuit for a large class of…
This study addresses the challenge of simulating realistic particle systems by proposing a novel particle decomposition scheme that improves the parallel performance of surface resolved particle simulations. Realistic particle systems often…
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…
Hosting non-classical states of light in three-dimensional microwave cavities has emerged as a promising paradigm for continuous-variable quantum information processing. Here we experimentally demonstrate high-fidelity generation of a range…
The increasing depth of quantum circuits presents a major limitation for the execution of quantum algorithms, as the limited coherence time of physical qubits leads to noise that manifests as errors during computation. In this work, we…
The work proposes an extension of the quantum circuit formalism where qubits (wires) are circular instead of linear. The left-to-right interpretation of a quantum circuit is replaced by a circular representation which allows to select the…
We present an algorithm for efficiently simulating a quantum circuit in the graph formalism. In the graph formalism, we represent states as a linear combination of graphs with Clifford operations on their vertices. We show how a…
High-fidelity and robust quantum manipulation is the key for scalable quantum computation. Therefore, due to the intrinsic operational robustness, quantum manipulation induced by geometric phases is one of the promising candidates. However,…
We describe the generation of entangling gates on superconductor-semiconductor hybrid qubits by ac voltage modulation of the Josephson energy. Our numerical simulations demonstrate that the unitary error can be below $10^{-5}$ in a variety…
We develop several algorithms for performing quantum phase estimation based on basic measurements and classical post-processing. We present a pedagogical review of quantum phase estimation and simulate the algorithm to numerically determine…
We propose a phase-difference estimation algorithm based on the tensor-network circuit compression, leveraging time-evolution data to pursue scalability and higher accuracy on a quantum phase estimation (QPE)-type algorithm. Using tensor…
The phase reduction method is a dimension reduction method for weakly driven limit-cycle oscillators, which has played an important role in the theoretical analysis of synchro- nization phenomena. Recently, we proposed a generalization of…
The most scalable proposed methods of simulating lattice fermions on noisy quantum computers employ encodings that eliminate nonlocal operators using a constant factor more qubits and a nontrivial stabilizer group. In this work, we…
In this work we introduce a new family of 14-steps linear multistep methods for the integration of the Schr\"odinger equation. The new methods are phase fitted but they are designed in order to improve the frequency tolerance. This is…
We present quantum protocols for executing arbitrarily accurate $\pi/2^k$ rotations of a qubit about its $Z$ axis. Reduced instruction set computing (\textsc{risc}) architectures typically restrict the instruction set to stabilizer…
We propose and analyze the design of a programmable photonic integrated circuit for high-fidelity quantum computation and simulation. We demonstrate that the reconfigurability of our design allows us to overcome two major impediments to…
We present \texttt{lcg\_plus}, an open-source Python library for the simulation of continuous-variable quantum circuits with both generaldyne and photon-number-resolving detector capabilities. Our framework merges the linear combination of…
A quantum circuit may be strongly classically simulated with the aid of ZX-calculus by decomposing its $t$ T-gates into a sum of $2^{\alpha t}$ classically computable stabiliser terms. In this paper, we introduce a general procedure to find…
Proton transfer reactions are fundamental to many chemical and biological systems, where quantum effects such as tunneling, delocalization, and zero-point motion play key kinetic control roles. However, classical methods capable of…
We develop a phase estimation method with a distinct feature: its maximal runtime (which determines the circuit depth) is $\delta/\epsilon$, where $\epsilon$ is the target precision, and the preconstant $\delta$ can be arbitrarily close to…