Robust and optimal loading of general classical data into quantum computers

Abstract

As standard data loading processes, quantum state preparation and block-encoding are critical and necessary processes for quantum computing applications, including quantum machine learning, Hamiltonian simulation, and many others. Yet, existing protocols suffer from poor robustness under device imperfection, thus limiting their practicality for real-world applications. Here, this limitation is overcome based on a fanin process designed in a tree-like bucket-brigade architecture. It suppresses the error propagation between different branches, thus exponentially improving the robustness compared to existing depth-optimal methods. Moreover, the approach here simultaneously achieves the state-of-the-art fault-tolerant circuit depth, gate count, and STA. As an example of application, we show that for quantum simulation of geometrically local Hamiltonian, the code distance of each logic qubit can potentially be reduced exponentially using our technique. We believe that our technique can significantly enhance the power of quantum computing in the near-term and fault-tolerant regimes.

18 pages, 8 figures. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (2025)

References in corpus (27)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Surface codes: Towards practical large-scale quantum computation
• Characterizing Quantum Supremacy in Near-Term Devices
• Strong quantum computational advantage using a superconducting quantum processor
• Logical quantum processor based on reconfigurable atom arrays
• Quantum random access memory
• Hamiltonian Simulation by Qubitization
• Efficient quantum algorithms for simulating sparse Hamiltonians
• A Race Track Trapped-Ion Quantum Processor
• Quantum-state preparation with universal gate decompositions
• Architectures for a quantum random access memory
• Deterministic teleportation of a quantum gate between two logical qubits
• The General Quantum Interference Principle and the Duality Computer
• Near-optimal ground state preparation
• Hardware-efficient quantum random access memory with hybrid quantum acoustic systems
• Quantum advantage with noisy shallow circuits in 3D
• On the robustness of bucket brigade quantum RAM
• Trading T gates for dirty qubits in state preparation and unitary synthesis
• Resilience of quantum random access memory to generic noise
• A Robust Quantum Random Access Memory
• Circuit-based quantum random access memory for classical data with continuous amplitudes
• Optimal (controlled) quantum state preparation and improved unitary synthesis by quantum circuits with any number of ancillary qubits
• Scalable and High-Fidelity Quantum Random Access Memory in Spin-Photon Networks
• Quantum Resources Required to Block-Encode a Matrix of Classical Data
• Data centers with quantum random access memory and quantum networks
• Circuit complexity of quantum access models for encoding classical data
• Spacetime-Efficient Low-Depth Quantum State Preparation with Applications