Multiplexed Bilayered Realization of Fault-Tolerant Quantum Computation Over Optically Networked Trapped-Ion Modules

Abstract: We study an architecture for fault-tolerant measurement-based quantum computation (FT-MBQC) over optically-networked trapped-ion modules. The architecture is implemented with a finite number of modules and ions per module, and leverages photonic interactions for generating remote entanglement between modules and local Coulomb interactions for intra-modular entangling gates. We focus on generating the topologically protected Raussendorf–Harrington–Goyal […]

A Sparse-Event Simulation Engine to Model Coincidence-Based Ranging Architectures in Quantum Lidar

Abstract: Nonclassical radar and lidar systems have received substantial interest recently; however, although many experimental demonstrations have provided deep physical knowledge of such systems, there remains a lack of effective system models to obtain fundamental metrics such as range resolution as a function of system parameters. This work introduces a high-fidelity simulation platform to mimic […]

Control of a Josephson Digital Phase Detector via an SFQ-Based Flux Bias Driver

Abstract: Quantum computation requires high-fidelity qubit readout, preserving the quantum state. In the case of superconductings qubits, readout is typically performed using a complex analog experimental setup operating at room temperature, which poses significant technological and economic barriers to large system scalability. An alternative approach is to perform a cryogenic on-chip qubit readout based on […]

Improved Belief Propagation Decoding Algorithms for Surface Codes

Abstract: Quantum error correction is crucial for universal fault-tolerant quantum computing. Highly accurate and low-time-complexity decoding algorithms play an indispensable role in ensuring quantum error correction works effectively. Among existing decoding algorithms, belief propagation (BP) is notable for its nearly linear time complexity and general applicability to stabilizer codes. However, BP’s decoding accuracy without postprocessing […]

A Comprehensive Cross-Model Framework for Benchmarking the Performance of Quantum Hamiltonian Simulations

Abstract: Quantum Hamiltonian simulation is one of the most promising applications of quantum computing and forms the basis for many quantum algorithms. Benchmarking them is an important gauge of progress in quantum computing technology. We present a methodology and software framework to evaluate various facets of the performance of gate-based quantum computers on Trotterized quantum […]

Emulation of Density Matrix Dynamics With Classical Analog Circuits

Abstract: Analog circuits have emerged as a valuable quantum emulation and simulation platform. Specifically, they have been experimentally shown to excel in emulating coherent state vector dynamics and motifs of quantum circuits, such as the quantum Fourier transform, tensor product superpositions, two-level systems such as Josephson junctions, and nuclear magnetic resonance state dynamics, all on […]

Dissipative Variational Quantum Algorithms for Gibbs State Preparation

In recent years, variational quantum algorithms have gained significant attention due to their adaptability and efficiency on near-term quantum hardware. They have shown potential in a variety of tasks, including linear algebra, search problems, Gibbs, and ground state preparation. Nevertheless, the presence of noise in current day quantum hardware severely limits their performance. In this […]

Improving Probabilistic Error Cancellation in the Presence of Nonstationary Noise

In this article, we investigate the stability of probabilistic error cancellation (PEC) outcomes in the presence of nonstationary noise, which is an obstacle to achieving accurate observable estimates. Leveraging Bayesian methods, we design a strategy to enhance PEC stability and accuracy. Our experiments using a five-qubit implementation of the Bernstein–Vazirani algorithm and conducted on the […]

Noise Robustness of Quantum Relaxation for Combinatorial Optimization

Relaxation is a common way for dealing with combinatorial optimization problems. Quantum random-access optimization (QRAO) is a quantum-relaxation-based optimizer that uses fewer qubits than the number of bits in the original problem by encoding multiple variables per qubit using quantum random-access code (QRAC). Reducing the number of qubits will alleviate physical noise (typically, decoherence), and […]