Yichao Yu, Keqin Yan, Debopriyo Biswas, Vivian Ni Zhang, Bahaa Harraz, Crystal Noel, Christopher Monroe, Alexander Kozhanov • Published: 2025-04-17
We implement in-situ mid-circuit measurement and reset (MCMR) operations on a trapped-ion quantum computing system by using metastable qubit states in $^{171}\textrm{Yb}^+$ ions. We introduce and compare two methods for isolating data qubits from measured qubits: one shelves the data qubit into the metastable state and the other drives the measured qubit to the metastable state without disturbing ...
Thiago L. M. Guedes, Guillermo A. Mena Marugán, Francesca Vidotto, Markus Müller • Published: 2024-12-28
In loop quantum gravity (LQG), states of the gravitational field are represented by labeled graphs called spin networks. Their dynamics can be described by a Hamiltonian constraint, { which acts on the spin network states modifying both spins and graphs.} Fixed-graph approximations of the dynamics have been extensively studied, but its full graph-changing action so far remains elusive. The latter,...
Guo Zhang, Yuanye Zhu, Ying Li • Published: 2025-10-22
We propose a fault-tolerant quantum computation scheme that is broadly applicable to quantum low-density parity-check (qLDPC) codes. The scheme achieves constant qubit overhead and a time overhead of $O(d^{a+o(1)})$ for any $[[n,k,d]]$ qLDPC code with constant encoding rate and distance $d = Ω(n^{1/a})$. For good qLDPC codes, the time overhead is minimized and reaches $O(d^{1+o(1)})$. In contrast,...
Samuel T. Elkin, Ghazi Khan, Ebrahim Forati, Brandon W. Langley, Dogan Timucin, Reza Molavi, Sara Sussman, Thomas E. Roth • Published: 2025-11-25
High-fidelity numerical methods that model the physical layout of a device are essential for the design of many technologies. For methods that characterize electromagnetic effects, these numerical methods are referred to as computational electromagnetics (CEM) methods. Although the CEM research field is mature, emerging applications can still stress the capabilities of the techniques in use today....
Maria Gabriela Jordão Oliveira, Nina Glaser • Published: 2025-06-11
Computing eigenvalues is a computationally intensive task central to numerous applications in the natural sciences. Toward this end, we investigate the quantum block Krylov subspace projector (QBKSP) algorithm - a multireference quantum Lanczos method designed to accurately compute low-lying eigenenergies, including degenerate ones, of quantum systems. We present three compact quantum circuits tai...
Pei Zeng, Guo Zheng, Qian Xu, Liang Jiang • Published: 2025-11-25
Fault tolerance is widely regarded as indispensable for achieving scalable and reliable quantum computing. However, the spacetime overhead required for fault-tolerant quantum computating remains prohibitively large. A critical challenge arises in many quantum algorithms with Clifford + $\varphi$ compiling, where logical rotation gates $R_{Z_L}(\varphi)$ serve as essential components. The Eastin-Kn...
Peter Brearley, Philipp Pfeffer • Published: 2025-11-24
We present a high-order splitting method for simulating non-unitary dynamics by sequential real- and imaginary-time Hamiltonian evolutions. Complex-coefficient splitting methods with positive real parts are chosen for stable integration in a quantum circuit, avoiding the unstable, norm-amplifying negative steps that arise from real-coefficient splitting at high orders. The method is most beneficia...
Steven Abel, Iwo Wasek, Simon Williams • Published: 2025-11-24
We formulate a continuous-variable quantum computing (CVQC) algorithm to study Berry's phase on photonic quantum computers. We demonstrate that CVQC allows the simulation of charged particles with orbital angular momentum under the influence of an adiabatically changing $\vec{B}$ field. Although formulated entirely in the CVQC setting, our construction uses only passive linear-optical operations (...
Jean-Francois Biasse, Fang Song • Published: 2025-10-02
In this paper, we provide details on the proofs of the quantum polynomial time algorithm of Biasse and Song (SODA 16) for computing the $S$-unit group of a number field. This algorithm directly implies polynomial time methods to calculate class groups, S-class groups, relative class group and the unit group, ray class groups, solve the principal ideal problem, solve certain norm equations, and dec...
Jevgēnijs Vihrovs • Published: 2025-05-28
We show a simple generalization of the quantum walk algorithm for search in backtracking trees by Montanaro (ToC 2018) to the case where vertices can have different times of computation. If a vertex $v$ in the tree of depth $D$ is computed in $t_v$ steps from its parent, then we show that detection of a marked vertex requires $\text{O}(\sqrt{TD})$ queries to the steps of the computing procedures, ...