Surface-Code Hardware Hamiltonian

• URL: http://arxiv.org/abs/2507.06201v1
• Date: Tue, 08 Jul 2025 17:27:32 GMT
• Title: Surface-Code Hardware Hamiltonian
• Authors: Xuexin Xu, Kuljeet Kaur, Chloé Vignes, Mohammad H. Ansari, John M. Martinis,
• Abstract summary: We present a framework for accurately modeling many-body interactions in surface-code quantum processor units (QPUs)<n>Our approach efficiently evaluates high-order, long-range Pauli string couplings and maps complete chip layouts onto exact effective Hamiltonians.<n>This framework serves as a powerful guide for optimizing next-generation high-fidelity surface-code hardware.
• Score: 5.411640324412968
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We present a scalable framework for accurately modeling many-body interactions in surface-code quantum processor units (QPUs). Combining a concise diagrammatic formalism with high-precision numerical methods, our approach efficiently evaluates high-order, long-range Pauli string couplings and maps complete chip layouts onto exact effective Hamiltonians. Applying this method to surface-code architectures, such as Google's Sycamore lattice, we identify three distinct operational regimes: computationally stable, error-dominated, and hierarchy-inverted. Our analysis reveals that even modest increases in residual qubit-qubit crosstalk can invert the interaction hierarchy, driving the system from a computationally favorable phase into a topologically ordered regime. This framework thus serves as a powerful guide for optimizing next-generation high-fidelity surface-code hardware and provides a pathway to investigate emergent quantum many-body phenomena.

Related papers

• Untangling Surface Codes: Bridging Braids and Lattice Surgery [51.748182660642776]
  We present a systematic method for translating fault-tolerant quantum circuits between their braiding and lattice surgery representations within the surface code.<n>Our framework provides a foundation for the automated verification, compilation, and benchmarking of large-scale surface code computations.
  arXiv  Detail & Related papers  (2025-11-27T10:12:38Z)
• Unlocking Symbol-Level Precoding Efficiency Through Tensor Equivariant Neural Network [84.22115118596741]
  We propose an end-to-end deep learning (DL) framework with low inference complexity for symbol-level precoding.<n>We show that the proposed framework captures substantial performance gains of optimal SLP, while achieving an approximately 80-times speedup over conventional methods.
  arXiv  Detail & Related papers  (2025-10-02T15:15:50Z)
• Solving the Hubbard model with Neural Quantum States [66.55653324211542]
  We study the state-of-the-art results for the doped two-dimensional (2D) Hubbard model.<n>We find different attention heads in the NQS ansatz can directly encode correlations at different scales.<n>Our work establishes NQS as a powerful tool for solving challenging many-fermions systems.
  arXiv  Detail & Related papers  (2025-07-03T14:08:25Z)
• Hierarchical-embedding autoencoder with a predictor (HEAP) as efficient architecture for learning long-term evolution of complex multi-scale physical systems [41.94295877935867]
  Structures of various scales that dynamically emerge in the system interact with each other only locally.<n>The hierarchical fully-convolutional autoencoder transforms the state of a physical system into a series of embedding layers.<n> Interactions between features of various scales are modeled using a combination of convolutional operators.
  arXiv  Detail & Related papers  (2025-05-24T20:27:16Z)
• An Efficient Quantum Classifier Based on Hamiltonian Representations [50.467930253994155]
  Quantum machine learning (QML) is a discipline that seeks to transfer the advantages of quantum computing to data-driven tasks.<n>We propose an efficient approach that circumvents the costs associated with data encoding by mapping inputs to a finite set of Pauli strings.<n>We evaluate our approach on text and image classification tasks, against well-established classical and quantum models.
  arXiv  Detail & Related papers  (2025-04-13T11:49:53Z)
• Near-Term Spin-Qubit Architecture Design via Multipartite Maximally-Entangled States [1.589509357008938]
  We introduce four metrics which ascertain the quality of genuine multipartite quantum entanglement, along with circuit-level fidelity measures.<n>We devise simulations which combine expected hardware characteristics of spin-qubit devices with appropriate compilation techniques.<n>We find that sparsely-connected spin-qubit lattices can approach comparable values of our metrics to those of the most highly-connected device architecture.
  arXiv  Detail & Related papers  (2024-12-17T12:55:40Z)
• A General Framework for Gradient-Based Optimization of Superconducting Quantum Circuits using Qubit Discovery as a Case Study [0.19528996680336308]
  We present a comprehensive framework for the gradient-based optimization of superconducting quantum circuits. We apply this framework to the qubit discovery problem, demonstrating its effectiveness in identifying qubit designs with superior performance metrics.
  arXiv  Detail & Related papers  (2024-08-22T19:46:50Z)
• Compact Multi-Threshold Quantum Information Driven Ansatz For Strongly Interactive Lattice Spin Models [0.0]
  We introduce a systematic procedure for ansatz building based on approximate Quantum Mutual Information (QMI) Our approach generates a layered-structured ansatz, where each layer's qubit pairs are selected based on their QMI values, resulting in more efficient state preparation and optimization routines. Our results show that the Multi-QIDA method reduces the computational complexity while maintaining high precision, making it a promising tool for quantum simulations in lattice spin models.
  arXiv  Detail & Related papers  (2024-08-05T17:07:08Z)
• A scalable 2-local architecture for quantum annealing of Ising models with arbitrary dimensions [0.0]
  We present a scalable architecture for quantum annealers to realize effective Ising Hamiltonians of arbitrary connectivity.<n>Our proposal consists on a resource-efficient configuration based on a hardware graph where physical qubits are connected to at most other 3 and containing exclusively 2-local interactions.
  arXiv  Detail & Related papers  (2024-04-10T09:38:13Z)
• Comparative study of quantum error correction strategies for the heavy-hexagonal lattice [41.94295877935867]
  Topological quantum error correction is a milestone in the scaling roadmap of quantum computers.<n>The square-lattice surface code has become the workhorse to address this challenge.<n>In some platforms, however, the connectivities are kept even lower in order to minimise gate errors.
  arXiv  Detail & Related papers  (2024-02-03T15:28:27Z)
• Higher-order topological kernels via quantum computation [68.8204255655161]
  Topological data analysis (TDA) has emerged as a powerful tool for extracting meaningful insights from complex data. We propose a quantum approach to defining Betti kernels, which is based on constructing Betti curves with increasing order.
  arXiv  Detail & Related papers  (2023-07-14T14:48:52Z)
• GloptiNets: Scalable Non-Convex Optimization with Certificates [61.50835040805378]
  We present a novel approach to non-cube optimization with certificates, which handles smooth functions on the hypercube or on the torus. By exploiting the regularity of the target function intrinsic in the decay of its spectrum, we allow at the same time to obtain precise certificates and leverage the advanced and powerful neural networks.
  arXiv  Detail & Related papers  (2023-06-26T09:42:59Z)
• Quantum Gate Optimization for Rydberg Architectures in the Weak-Coupling Limit [55.05109484230879]
  We demonstrate machine learning assisted design of a two-qubit gate in a Rydberg tweezer system. We generate optimal pulse sequences that implement a CNOT gate with high fidelity. We show that local control of single qubit operations is sufficient for performing quantum computation on a large array of atoms.
  arXiv  Detail & Related papers  (2023-06-14T18:24:51Z)
• A quantum processor based on coherent transport of entangled atom arrays [44.62475518267084]
  We show a quantum processor with dynamic, nonlocal connectivity, in which entangled qubits are coherently transported in a highly parallel manner. We use this architecture to realize programmable generation of entangled graph states such as cluster states and a 7-qubit Steane code state.
  arXiv  Detail & Related papers  (2021-12-07T19:00:00Z)
• Feasible Architecture for Quantum Fully Convolutional Networks [4.849886707973093]
  We propose a feasible pure quantum architecture that can be operated on noisy intermediate-scale quantum devices. Our study represents the successful training of a pure quantum fully convolutional network and discusses advantages by comparing it with the hybrid solution.
  arXiv  Detail & Related papers  (2021-10-05T01:06:54Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• High-fidelity and Robust Geometric Quantum Gates that Outperform Dynamical Ones [5.781900408390438]
  We propose a general framework of geometric quantum computation with the integration of the time-optimal control technique. Our scheme provides a promising alternative way towards scalable fault-tolerant solid-state quantum computation.
  arXiv  Detail & Related papers  (2020-01-16T13:28:10Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.