Block-encoding has emerged as a core primitive in many quantum algorithms, including quantum simulation. In this work, we design efficient and extensible methods for generating low-frustration block encodings of frustrated lattice Hamiltonians built from repeated local interaction patches through a technique we call "patch routing". We construct block encodings for a full Hamiltonian by first block-encoding a small local patch and then using a SWAP-style routing network to coherently apply the local patch encoding across the lattice. The expensive, local block-encoding cost is paid only once per query and is independent of lattice size, whereas the comparatively inexpensive routing network grows linearly with the lattice size, dominating at large sizes. Our method allows for a hierarchical structure in which larger patches can be block-encoded with small normalization factors, albeit at a higher (local, non-extensive) block-encoding cost, thereby reducing overall query complexity in an algorithm. We exploit symmetries and algebraic structures in local interactions to construct efficient block encodings, and we apply these techniques to the Heisenberg, Fermi-Hubbard, and honeycomb spin-liquid models. For a $120\times 120$ square-lattice $J_1$-$J_2$ Heisenberg model near maximal frustration ($J_2/J_1=0.4-0.6$), our methods result in a $15-17\times$ reduction in the leading $T$ cost per qubitized-QPE run (ignoring initial state preparation and overlap) relative to prior state-of-the-art Pauli LCU constructions. Corresponding reductions are approximately $3\times$ for the $120\times120$ Fermi-Hubbard model at half-filling. For time evolution of the honeycomb spin-liquid model on $120\times120$ unit cells, the leading cost is reduced by $5\times$. Our framework provides a systematic way forward for larger and more accurate fault-tolerant simulations of real-world quantum systems.
AI Summary
The paper addresses how to reduce both normalization and implementation costs of block encodings for frustrated lattice Hamiltonians. Grouping interactions into patches gives tighter spectral bounds, but directly applying a sophisticated local encoding at every lattice location multiplies its circuit cost by system size.
“Patch routing” coherently moves the addressed patch to a fixed register, applies one local encoding, and reverses the routing. For repeated patches, the query cost is $T_{\mathrm{BE}}=2T_{\mathrm{Prep}}+T_R+T_{\mathrm{BE}}^p$, with leading routing cost $T_R=8N_s$ for $N_s$ system qubits; at fixed patch size, the local cost is independent of lattice size. Explicit constructions cover spin and Jordan–Wigner fermionic systems. Local encodings use spectral decompositions, symmetry reduction, anticommuting Pauli groups, and quantum eigenvalue transformation to approach tighter patch normalizations. These feed into global spectral bounds and qubitized phase-estimation or time-evolution resource estimates.
Against product-wise Pauli-LCU baselines, the estimated leading $T$ cost at $120\times120$ is reduced by $15$–$17\times$ for the $J_1$–$J_2$ Heisenberg model at $J_2/J_1=0.4$–$0.6$, approximately $3\times$ for half-filled Fermi–Hubbard simulations, and $5\times$ for honeycomb spin-model time evolution.
The estimates exclude initial-state preparation and overlap costs and do not establish execution-time improvements: $T$ depth, connectivity, magic-state supply, and measurement latency remain unassessed. Larger patches require more expensive local circuits, so tighter normalization need not lower total cost. The reported constructions exploit repeated interactions and model-specific structure; the honeycomb time-evolution comparison retains the evolution-time-dominated leading contribution.
Little sign of AI-generated textAI use disclosed
AI models were used in the development of code for numerical calculations, ideation of technical results, and for initial drafting and editing of the manuscript.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
Block-encoding has emerged as a core primitive in many quantum algorithms, including quantum simulation. In this work, we design efficient and extensible methods for generating low-frustration block encodings of frustrated lattice Hamiltonians built from repeated local interaction patches through a technique we call "patch routing". We construct block encodings for a full Hamiltonian by first block-encoding a small local patch and then using a SWAP-style routing network to coherently apply the local patch encoding across the lattice. The expensive, local block-encoding cost is paid only once per query and is independent of lattice size, whereas the comparatively inexpensive routing network grows linearly with the lattice size, dominating at large sizes. Our method allows for a hierarchical structure in which larger patches can be block-encoded with small normalization factors, albeit at a higher (local, non-extensive) block-encoding cost, thereby reducing overall query complexity in an algorithm. We exploit symmetries and algebraic structures in local interactions to construct efficient block encodings, and we apply these techniques to the Heisenberg, Fermi-Hubbard, and honeycomb spin-liquid models. For a 120×120 square-lattice J1-J2 Heisenberg model near maximal frustration (J2/J1=0.4−0.6), our methods result in a 15−17× reduction in the leading T cost per qubitized-QPE run (ignoring initial state preparation and overlap) relative to prior state-of-the-art Pauli LCU constructions. Corresponding reductions are approximately 3× for the 120×120 Fermi-Hubbard model at half-filling. For time evolution of the honeycomb spin-liquid model on 120×120 unit cells, the leading cost is reduced by 5×. Our framework provides a systematic way forward for larger and more accurate fault-tolerant simulations of real-world quantum systems.
The paper addresses how to reduce both normalization and implementation costs of block encodings for frustrated lattice Hamiltonians. Grouping interactions into patches gives tighter spectral bounds, but directly applying a sophisticated local encoding at every lattice location multiplies its circuit cost by system size.
“Patch routing” coherently moves the addressed patch to a fixed register, applies one local encoding, and reverses the routing. For repeated patches, the query cost is TBE=2TPrep+TR+TBEp, with leading routing cost TR=8Ns for Ns system qubits; at fixed patch size, the local cost is independent of lattice size. Explicit constructions cover spin and Jordan–Wigner fermionic systems. Local encodings use spectral decompositions, symmetry reduction, anticommuting Pauli groups, and quantum eigenvalue transformation to approach tighter patch normalizations. These feed into global spectral bounds and qubitized phase-estimation or time-evolution resource estimates.
Against product-wise Pauli-LCU baselines, the estimated leading T cost at 120×120 is reduced by 15–17× for the J1–J2 Heisenberg model at J2/J1=0.4–0.6, approximately 3× for half-filled Fermi–Hubbard simulations, and 5× for honeycomb spin-model time evolution.
The estimates exclude initial-state preparation and overlap costs and do not establish execution-time improvements: T depth, connectivity, magic-state supply, and measurement latency remain unassessed. Larger patches require more expensive local circuits, so tighter normalization need not lower total cost. The reported constructions exploit repeated interactions and model-specific structure; the honeycomb time-evolution comparison retains the evolution-time-dominated leading contribution.
In fault-tolerant block encodings of structured Hamiltonians, the support geometry can set how the non-Clifford cost of SELECT scales with the system size, however many operators act on each support. We construct permute-act-unpermute circuits: a CSWAP network fixed by this geometry brings a selected support to a fixed target register, a shared local circuit acts there, and the permutation is undone. The operators add only an XZ mask on this register, at a cost independent of the system size, and one query can mix several support geometries. For two-site supports, we establish and attain the minimum CSWAP count within address-controlled networks of site transpositions. Compiled for Pauli terms, these circuits use 8SN+o(N)T gates with O(logN) permutation work qubits, where N is the number of system qubits and S is determined by the support geometry, with S=1 for nearest-neighbour interactions and S=3/2 for all-to-all pairs; in both cases the correction is O(logN). We also introduce a bridged CSWAP, which remembers the logical value of its temporary AND across the target action and repairs it from the prepared labels, so that the inverse CSWAP undoes the exchange without recomputing the value. When the repair is Clifford, it halves the T count of a matched forward-inverse CSWAP pair at the cost of one retained work qubit. For a Heisenberg ring, the complete block-encoding query reduces the T count by a factor approaching 3 as the system size grows, relative to flat and product-wise Pauli walks. For a five-orbital Anderson impurity model, which combines nearest-neighbour and all-to-all support geometries, the reduction is about 1.7 at large bath sizes, relative to the cheapest of three comparators, each built from the methods of the references it follows.
Efficient block encoding of many-body Hamiltonians is a central requirement for quantum algorithms in scientific computing, particularly in the early fault-tolerant era. In this work, we introduce new explicit constructions for block encoding second-quantized Hamiltonians that substantially reduce Clifford+T gate complexity and ancilla overhead. By utilizing a data lookup strategy based on the SWAP architecture for the sparsity oracle OC, and a direct sampling method for the amplitude oracle OA with SELECT-SWAP architecture, we achieve a T count that scales as O~(L) with respect to the number of interaction terms L in general second-quantized Hamiltonians. We also achieve an improved constant factor in the Clifford gate count of our oracle. Furthermore, we design a block encoding that directly targets the η-particle subspace, thereby reducing the subnormalization factor from O(L) to O(L), and improving fault-tolerant efficiency when simulating systems with fixed particle numbers. Building on the block encoding framework developed for general many-body Hamiltonians, we extend our approach to electronic Hamiltonians whose coefficient tensors exhibit translation invariance or possess decaying structures. Our results provide a practical path toward early fault-tolerant quantum simulation of many-body systems, substantially lowering resource overheads compared to previous methods.
Quantum low-density parity-check (qLDPC) codes are promising candidates for realizing large-scale fault-tolerant quantum computing. Although many codes with favorable theoretical parameters have been developed, their practical adoption must take hardware implementability into account. For mainstream quantum platforms such as superconductors and neutral atoms, the connectivity, the length of non-local couplings, and the complexity of wiring or atom rearrangement are key factors that dictate the difficulty of hardware realization. Here, we propose a new family of qLDPC codes, termed routing codes. Within this family, we find explicit instances whose encoding rates are competitive to those of bivariate bicycle (BB) codes, while systematically reducing qubit connectivity, shortening the length of non-local couplings, and, crucially, making all non-local couplings mutually parallel. This parallelism translates into quantifiable benefits, substantially reducing wiring crossings in superconducting multi-layer architectures and simplifying the scheduling of atom movement in neutral-atom arrays. The weight-7 routing codes maintain a high threshold of 0.7\% and reduce the physical qubit overhead by approximately a factor of 8, compared to surface codes achieving a same logical error rate. Further increasing the weight to 11 yields a [[200, 24, 14]] and [[200, 16, 17]] codes with an encoding rate over 23 times that of the surface code, at the cost of a higher logical error rate. These results establish routing codes as a hardware-centric qLDPC family that bridges the gap between theoretical optimality and near-term physical feasibility.
Near-Term Quantum Spin Simulation of the Spin-21 Square J1−J2 Heisenberg Model
Simulating complex spin systems, known for high frustration and entanglement, presents significant challenges due to their intricate energy landscapes. This study focuses on the J1−J2 Heisenberg model, renowned for its rich phase behavior on the square lattice, to investigate strongly correlated spin systems. We conducted the first experimental quantum computing study of this model using the 127-qubit IBM Rensselear Eagle processor and the Variational Quantum Eigensolver (VQE) algorithm. By employing classical warm-starting (+40% ground state energy approximation) and a newly developed ansatz (+9.31% improvement compared to prior best), we improved ground state approximation accuracy on the 16-site variant, achieving usable results with approximately 103 iterations, significantly fewer than the 104−105 steps proposed by previous theoretical studies. We utilized existing error mitigation strategies and introduced a novel Classically-Reinforced VQE error mitigation scheme, achieving 93% ground state accuracy, compared to 83.7% with the Quantum Moments algorithm and 60% with standard error mitigation. These strategies reduced the average error of observable prediction from ≈20% to 5%, enhancing phase prediction from qualitative to quantitative alignment. Additionally, we explored an experimental implementation of the Quantum Lanczos (QLanczos) algorithm using Variational-Fast Forwarding (VFF) on a 4-qubit site, achieving ≈97% ground state approximation. Theoretical simulations indicated that Krylov-based methods outperform VQE, with the Lanczos basis converging faster than the real-time basis. Our study demonstrates that near-term quantum devices can predict phase-relevant observables for the J1−J2 Heisenberg model, transitioning focus from theoretical to experimental, and suggesting general improvements to VQE-based methods.
Simulation of molecular vibrations is emerging as a promising application of quantum computing in quantum chemistry. In this work, we develop new strategies for block-encoding the second-quantized n-mode representation of the vibrational Hamiltonian, whose algebraic structure closely parallels that of the second-quantized electronic Hamiltonian. We derive linear-combination-of-unitaries (LCU) representations of this Hamiltonian based on Pauli decomposition and tensor hypercontraction (THC) and construct efficient circuits for the corresponding block encodings. We also extend the Block-Invariant Symmetry Shift (BLISS) technique to vibrational Hamiltonians, yielding a lower LCU 1-norm and, consequently, a lower overall circuit cost. For the molecules considered here, BLISS-THC reduces the Toffoli cost of quantum phase estimation by more than two orders of magnitude relative to existing block-encoding approaches. In comparison with recent Trotter-based methods, it shows up to a ninefold reduction in the T-gate count, with the relative savings tending to increase with system size. Asymptotically, and up to polylogarithmic factors, both the Pauli and THC LCUs trade additional ancillas for a quadratic improvement in scaling with the number of modes, while THC provides an additional quadratic improvement in scaling with the number of modals. These results highlight the importance of Hamiltonian factorizations and Toffoli-qubit tradeoffs for reducing the computational cost of quantum simulations of molecular vibrations.
Block Encoding (BE) is a crucial subroutine in many modern quantum algorithms, including those with near-optimal scaling for simulating quantum many-body systems, which often rely on Quantum Signal Processing (QSP). Currently, the primary methods for constructing BEs are the Linear Combination of Unitaries (LCU) and the sparse oracle approach. In this work, we demonstrate that QSP-based techniques, such as Quantum Singular Value Transformation (QSVT) and Quantum Eigenvalue Transformation for Unitary Matrices (QETU), can themselves be efficiently utilized for BE implementation. Specifically, we present several examples of using QSVT and QETU algorithms, along with their combinations, to block encode Hamiltonians for lattice bosons, an essential ingredient in simulations of high-energy physics. We also introduce a straightforward approach to BE based on the exact implementation of Linear Operators Via Exponentiation and LCU (LOVE-LCU). We find that, while using QSVT for BE results in the best asymptotic gate count scaling with the number of qubits per site, LOVE-LCU outperforms all other methods for operators acting on up to ≲ 11 qubits, highlighting the importance of concrete circuit constructions over mere comparisons of asymptotic scalings. Using LOVE-LCU to implement the BE, we simulate the time evolution of single-site and two-site systems in the lattice φ 4 theory using the Generalized QSP algorithm and compare the gate counts to those required for Trotter simulation.