Abstract: In fault-tolerant quantum computing, a large number of physical qubits are required to construct a single logical qubit, and a single quantum node may be able to hold only a small number of logical qubits. In such a case, the idea of distributed fault-tolerant quantum computing (DFTQC) is important to demonstrate large-scale quantum computation […]
Abstract: The single-photon dual-rail qubit is popular for photonic quantum computing and communications, both due to gates being realizable with linear optics (LO) and photon detection, as well as easy interfaces with matter quantum memories. Two-qubit operations, i.e., two-qubit gates followed by the measurement of one (Type-I fusion) or both (Type-II fusion) qubits, are, however, […]
Abstract: In modern power systems, the integration of converter-interfaced generations requires the development of electromagnetic transient network simulation programs (EMTP) that can capture rapid fluctuations. However, as the power system scales, the EMTP’s computing complexity increases exponentially, leading to a curse of dimensionality that hinders its practical application. Facing this challenge, quantum computing offers a […]
Abstract: Topological superconductivity could host quasiparticles that are key candidates for fault tolerant quantum computation due to their immunity to noise as they obey non-Abelian exchange statistics. For example, in the case of Majorana Zero Modes (MZM), braiding enables two topologically protected quantum gates. While their direct manipulation in solid-state systems remains experimentally challenging, digital […]
Abstract: Solving partial differential equations (PDEs), which is pervasive in science and engineering, is emerging as a promising application area for quantum computing because it can be reduced to Hamiltonian simulation. Unlike quantum chemistry, Pauli-term expansion is not useful for a PDE Hamiltonian, since it ends up with an exponential number of Pauli terms. Recently, […]
Abstract: Classical simulation remains a practical foundation for developing and evaluating quantum circuits, and state-vector methods are still among the most important exact simulation techniques. In this setting, gate fusion is a widely used optimization that combines multiple gates into a larger operator to reduce repeated state-vector traversal and improve execution efficiency. However, existing fusion […]
Abstract: Circuit compression is a key requirement for near-term quantum computing, yet the factors that govern stability under gate removal are not fully understood. We study this problem via a large-scale numerical analysis of 300 structurally uniform circuits across 10, 12, and 14 qubits. Despite identical macroscopic resources, each ensemble separates into two stability classes […]
Abstract: This paper presents a comprehensive survey of the current frontier in quantum computing for computational sciences, evaluating the technical requirements to translate theoretical asymptotic speedups into practical utility in the areas of chemistry, biochemistry, and materials science. We review foundational algorithms, including the Quantum Fourier Transform (QFT), Quantum Phase Estimation (QPE), and the quantum […]
Abstract: Engineering quantum circuits that use minimal resource requirements is essential for suppressing noise-induced errors and enhancing the performance of quantum processors. Here, we propose minimal-complexity hardware constructions of Clifford circuits for implementing new two-qubit Clifford gates, effectively expanding the available Clifford circuit library. The circuits are realized through engineered coherent phonon-mediated interactions between two […]
Abstract: The scalability of neutral-atom quantum computing is increasingly limited by a compiler–architecture challenge: logical circuits must be mapped onto dynamically reconfigurable atom arrays while controlling crosstalk, transport overhead, and hardware constraints. To address this problem, we present ZAP, a co-designed zoned architecture and deterministic compiler for field-programmable atom arrays. ZAP partitions the array into […]