Searcharxiv⌕ Search

arXiv subjects

Shuaifan Cao

Publications and source records attributed to Shuaifan Cao.

6 recordsLinked to original sources

A Universal Fault-Tolerant Quantum Computing Architecture with Globally Driven Atom Arrays

Scalable quantum computation requires reconciling programmability with simple, high-fidelity control. Here, we propose a universal fault-tolerant architecture using globally driven dual-species atom arrays. In a hybrid neutral-atom system, interspecies Rydberg interactions enable qubit addressability without locally addressed quantum gates. We construct a universal native instruction set, Global Rydberg Atom Instruction Language (GRAIL), and show that crosstalk errors can be suppressed to the $10^{-4}$ level. We compile surface-code error correction and magic state cultivation into GRAIL, and parallelize the compilation to suppress crosstalk. Under a hardware-inferred circuit-level noise model, we obtain an error-correction threshold of $1.43\%$ for the resulting quantum memory and a logical error rate below $10^{-9}$ for magic states cultivated at an experimentally accessible Rydberg Rabi frequency. By replacing local gate addressing with atom-mediated selectivity, this architecture removes the associated calibration requirements, offering a route to simpler control for large-scale fault-tolerant neutral-atom computation.

quant-ph↗

Efficient Quantum Optimization via Dissipative False Vacuum Decay

Efficient quantum solvers for computationally hard problems are highly desirable for near-term quantum platforms. Here, we propose a cavity-based dissipative quantum solver for a class of NP-hard combinatorial optimization problems encoded in atomic-spin Hamiltonians with a few discrete single-spin-flip transition energies. We show that the cavity-based quantum solver exploits dissipative false-vacuum decay in configuration space to facilitate escape from metastable local minima in rugged energy landscapes. Numerical studies of MaxCut and Maximum Independent Set identify favorable parameter regions for ground-state preparation. Based on the finite-size scalings of the median mixing time and instance-averaged ground-state preparation probability, we estimate time complexities for our solver that are more favorable than those of standard Grover search. These results highlight cavity dissipation as a controllable resource for quantum optimization.

quant-ph↗

Theory of the Edge-of-Chaos Advantage in Quantum Reservoir Computing

Numerical studies suggest that quantum reservoir computing performs optimally near the edge of chaos, a behavior commonly attributed to a balance between memory retention and nonlinear information processing. Here we develop an explicit quantum reservoir model and rigorously analyze its chaotic regime and integrable point. In the chaotic regime, we show that Gaussian-unitary-ensemble statistics lead to rapid memory loss: learning performance decays exponentially with the storage time required by a temporal task. This decay limits the ability of chaotic reservoirs to learn long-range temporal dependencies. At the integrable point, described by a free-fermion model, we prove that amplitude encoding and a linear readout of fermionic two-point correlations cannot learn a representative class of nonlinear tasks coupling present and past inputs. Introducing interactions alleviates this obstruction. By identifying distinct limitations on memory retention in the chaotic regime and nonlinear processing at the integrable point, our analysis provides a theoretical basis for the observed edge-of-chaos advantage and guides the design of quantum reservoirs for temporal learning.

quant-ph↗

Fault-tolerant quantum computing with a microwave Cat Bus

The scalability of fault-tolerant neutral-atom quantum computers is constrained by the latency of shuttling with optical tweezers, imposing a stringent trade-off between qubit overhead and circuit depth in quantum algorithm compilation. Here we propose a hardware-efficient, shuttling-free architecture that achieves all-to-all connectivity. Remote Rydberg atoms are resonantly entangled through a microwave ``Cat Bus''---a cavity mode autonomously stabilized in a bosonic cat state. The Cat Bus natively supports the highly parallelized execution of one-to-many $\mathrm{CZ}^n$ gates with exponentially suppressed crosstalk. We derive the resulting cat--atom error channel from the underlying interactions and physical constraints. For fault-tolerant operation, we develop a hardware-aware scheduling scheme that exploits the native cat--atom $\mathrm{CZ}^{n}$ gate to construct a syndrome-extraction circuit with minimum depth. We benchmark the architecture using hypergraph-product (HGP) codes and estimate a 180-fold reduction in syndrome-extraction cycle time at $N=10^5$ data qubits compared with an atom-rearrangement-based architecture. Under matched two-qubit depolarizing noise, the corresponding error threshold increases from $0.55\%$ to $0.72\%$. Under the hardware-derived error model, we obtain a threshold of $0.80\%$, corresponding to a threshold cooperativity of $C_{\mathrm{th}}=7.8 \times 10^4$, compatible with experimentally accessible parameters for Rydberg-coupled microwave-cavity systems. By avoiding atom transport, the Cat Bus provides a route towards high-speed, fault-tolerant neutral-atom quantum computation.

quant-ph↗

Quantum magic and non-commutativity as computational resources in quantum reservoir computing

Quantum reservoir computing (QRC) provides a hardware-efficient paradigm for temporal information processing on near-term quantum devices. Despite rapid experimental progress, a rigorous understanding of the structural conditions required for its scalable quantum-enhanced performance remains lacking. Here, we develop a theoretical framework in Pauli-Liouville space that provides a unified analytical treatment of the echo state property (ESP), nonlinear expressive power, and quantum resources. We first analyze the widely used qubit-resetting scheme and establish that quantum magic generated by reservoir dynamics is a necessary condition for effective computation, a requirement more fundamental than ESP. However, we prove that this architecture faces inherent expressivity limitations: all nonlinear processing originates exclusively from the classical encoding map, imposing an unavoidable trade-off between nonlinearity and memory capacity. To circumvent this structural bottleneck, we rigorously analyze Hamiltonian encoding, in which temporal inputs are embedded directly into the continuous dynamics generator. We show that the ESP is natively guaranteed by the Liouvillian spectral gap, decoupling it from quantum magic. Crucially, for any non-trivial drive Hamiltonian, the discrete-time update map exhibits a transcendental, infinite-order nonlinear dependence on the instantaneous input. Moreover, the intrinsic non-commutativity of the open-system generators governs the temporal coupling of these nonlinearities, producing highly non-separable processing of the input history. Our results establish a rigorous theoretical hierarchy of QRC architectures and provide prescriptive design principles for experiments targeting genuine quantum advantages in temporal processing.

quant-ph↗

Hardware-Efficient Rydberg Atomic Quantum Solvers for NP Problems

Developing hardware-efficient implementations of quantum algorithms is crucial in the NISQ era to achieve practical quantum advantage. Here, we construct a generic quantum solver for NP problems based on Grover's search algorithm, specifically tailored for Rydberg-atom quantum computing platforms. We design the quantum oracles in the search algorithm using parallelizable single-qubit and multi-qubit entangling gates in the Rydberg atom system, yielding a unified framework for solving a broad class of NP problems with provable quadratic quantum speedup. We analyze the experimental resource requirements considering the unique qubit connectivity of the dynamically reconfigurable qubits in the optical tweezer array. The required qubit number scales linearly with the problem size, representing a significant improvement over existing Rydberg-based quantum annealing approaches that incur quadratic overhead. These results provide a concrete roadmap for future experimental efforts towards demonstrating quantum advantage in NP problem solving using Rydberg atomic systems. Our construction indicates that atomic qubits offer favorable circuit depth scaling compared to quantum processors with fixed local connectivity.

quant-ph↗