John Penuel, Amara Katabarwa, Peter D. Johnson, Parker Kuklinski, Benjamin Rempfer, Collin Farquhar, Yudong Cao, Michael C. Garrett • Published: 2024-06-10
This study examines the potential for fault-tolerant quantum computers to provide utility in fluid dynamics simulations, with a focus on drag force calculations for ship hull design. We assess whether quantum algorithms can surpass classical computational limits by generating detailed quantum resource estimates (QREs) in terms of logical qubits and $T$-gate counts. Our analysis is based on a quant...
Yosuke Ueno, Shinichi Sunami, Toshihide Hinokuma, Yasunari Suzuki, Akihisa Goban, Hayata Yamasaki, Teruo Tanimoto, Ilkwon Byun • Published: 2026-09-13
Technological advances in neutral-atom platforms have opened a new path toward designing efficient protocols for fault-tolerant quantum computing (FTQC). However, each physical operation is still orders of magnitude slower than on other platforms, such as superconducting qubits. Therefore, architects must identify fast and efficient FTQC architectures, which require reliable modeling tools to expl...
Katia Hakem, Grégoire de Gliniasty, Nathan Shettell, Paul Hilaire, Stephen C. Wein • Published: 2026-11-17
Fusion-based quantum computation (FBQC) is a promising route to fault-tolerant photonic quantum computing, connecting small entangled resource states through linear-optical fusion measurements. While logical encoding can substantially improve resilience to photon loss, whether these benefits extend to other noise remain an open question. In this work, we show that this is not generally the case wh...
Nahia J. Dios-Bilbao, Adrián Castaño-García, J. J. Gálvez-Viruet, Felipe J. Llanes-Estrada, Mario Logrosán-Álvarez, Nicolás M. Arenaza • Published: 2026-11-13
Efficient algorithms for the (anti)symmetrization of quantum registers are necessary for upcoming few- and many-body physics applications, from atomic to particle-physics scales. We propose a recursive algorithm (anti)symmetrizing the last particle added to memory, each time one is created or destroyed, respect to the rest of already (anti)symmetrized ones. Given a generalized Dicke state (GDS) of...
Qianjun Yao, Jie Liu, He Li • Published: 2026-11-17
Stabilizer-based subspace methods can substantially reduce the quantum resources required for electronic structure calculations, but the resulting projection neglects Hamiltonian couplings to configurations outside the retained subspace. In this work, we introduce Stabilizer-Subspace Perturbation Theory (SSPT) to recover the associated correlation contributions, using the Contextual Subspace Varia...
Yafei Yang, Chung-chieh Shan • Published: 2026-11-16
Developing quantum programs requires not only running them on quantum hardware but also simulating them on classical hardware. Because the meaning of a quantum program can be defined in terms of state vectors, it can be viewed as a form of weighted nondeterminism and simulated using any implementation of probabilistic programming that supports complex or at least negative weights. In this study, w...
Yuqing Wang, Xiaotian Nie, Jiale Dai, Zhongyi Ni, Tao Zhang, Hui Zhai, Linghui Chen • Published: 2026-04-15
Qubit loss is a major source of error in atom-array quantum computing and invalidates the algebraic structure of the standard stabilizer formalism for quantum error-correcting codes. On the one hand, it complicates decoding; on the other hand, it introduces tochastic flicker patterns in stabilizers as a hallmark of qubit loss. Here, we develop an artificial-intelligence-enabled decoder based on a ...
Selman Ipek • Published: 2026-11-16
An antidistinguishing measurement for a family of preparations excludes at least one preparation for every possible outcome, constraining 'classical' representations of these processes, known as ontological models. We develop this connection within quantum computing with magic states (QCM), a universal model of quantum computation. Our constructions use adaptive Pauli measurements on tensor produc...
Abdur Rahman Ovy, Xiaosong Du • Published: 2026-11-16
Airfoil geometry parameterization is essential in aerodynamic design optimization. Optimization search in the large space suffers from low efficiency and modest feasible region, which could further incur failures to convergence. Generative adversarial networks (GAN), aiming to learn the statistical distribution of existing data, pave a new avenue for shape generation and airfoil parameterization. ...
Joel Bierman, Pawan Poudel, Yuan Liu • Published: 2026-11-13
The Quantum Singular Value Transformation (QSVT) is an algorithmic framework which encompasses a wide range of problems, including Hamiltonian dynamics, ground state preparation, Gibbs state preparation, amplitude amplification, and matrix inversion. For many areas of scientific interest such as quantum chemistry and condensed matter, the circuit depth of the block-encoding subroutine in QSVT can ...