Building globally-controlled quantum processors with ZZ interactions

• URL: http://arxiv.org/abs/2509.09271v1
• Date: Thu, 11 Sep 2025 09:01:38 GMT
• Title: Building globally-controlled quantum processors with ZZ interactions
• Abstract summary: We present a comprehensive framework for building globally driven quantum computers.<n>Our approach leverages static inhomogeneities in the Rabi frequencies of qubits controlled by a common classical pulse.<n>This framework offers a scalable pathway toward quantum processors by striking a balance between wiring complexity and computational efficiency.
• Score: 0.6157382820537719
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present a comprehensive framework for constructing various architectures of globally driven quantum computers, with a focus on superconducting qubits. Our approach leverages static inhomogeneities in the Rabi frequencies of qubits controlled by a common classical pulse -- a technique we refer to as the "crossed-qubit" method. We detail the essential components and design principles required to realize such systems, highlighting how global control can be harnessed to perform local operations, enabling universal quantum computation. This framework offers a scalable pathway toward quantum processors by striking a balance between wiring complexity and computational efficiency, with potential applications in addressing current challenges to scalability.

Related papers

• Global control via quantum actuators [0.6524460254566904]
  Auxiliary quantum systems act as controllable elements that transiently store and release interaction energy.<n>During compilation they remain passive and require no fine-grained local control, while during operation they allow for controlled activation of interactions and directional flow of quantum information.
  arXiv  Detail & Related papers  (2026-03-24T15:58:00Z)
• Universal Dynamics with Globally Controlled Analog Quantum Simulators [9.43766597189957]
  We show that a broad class of analog quantum simulators is, in fact, universal.<n>We introduce a new control technique into the experiment - direct quantum optimal control.<n>This method enables the synthesis of complex effective Hamiltonians and allows us to incorporate realistic hardware constraints.
  arXiv  Detail & Related papers  (2025-08-26T14:36:32Z)
• Quantum circuit complexity and unsupervised machine learning of topological order [0.579425658200206]
  We explore quantum circuit complexity, an important concept in quantum computation and quantum information science.<n>We build interpretable and efficient unsupervised machine learning for topological order in quantum many-body systems.<n>Our results establish connections between key concepts and tools of quantum circuit computation, quantum complexity, and machine learning of topological quantum order.
  arXiv  Detail & Related papers  (2025-08-06T14:36:10Z)
• A Superconducting Qubit-Resonator Quantum Processor with Effective All-to-All Connectivity [44.72199649564072]
  This architecture can be used as a test-bed for algorithms that benefit from high connectivity.<n>We show that the central resonator can be used as a computational element.<n>We achieve a genuinely multi-qubit entangled Greenberger-Horne-Zeilinger (GHZ) state over all six qubits with a readout-error mitigated fidelity of $0.86$.
  arXiv  Detail & Related papers  (2025-03-13T21:36:18Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [62.46800898243033]
  Recent progress in quantum learning theory prompts a question: can linear properties of a large-qubit circuit be efficiently learned from measurement data generated by varying classical inputs?<n>We prove that the sample complexity scaling linearly in $d$ is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.<n>We propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Characterizing the Inter-Core Qubit Traffic in Large-Scale Quantum Modular Architectures [2.465579331213113]
  We present a pioneering characterization of the era of monolithic-temporal inter-core qubit traffic in large-scale circuits. The programs are executed on an all-to-all connected-core architecture that supports up to around 1000 qubits. Based on the showcased results, we provide a set of guidelines to improve mapping quantum circuits to multi-core processors, and lay the foundations of benchmarking large-scale multi-core architectures.
  arXiv  Detail & Related papers  (2023-10-03T09:54:41Z)
• Determining the ability for universal quantum computing: Testing controllability via dimensional expressivity [39.58317527488534]
  Controllability tests can be used in the design of quantum devices to reduce the number of external controls. We devise a hybrid quantum-classical algorithm based on a parametrized quantum circuit.
  arXiv  Detail & Related papers  (2023-08-01T15:33:41Z)
• Silicon edge-dot architecture for quantum computing with global control and integrated trimming [0.0]
  A quantum information processing architecture based on silicon metal-oxide-semiconductor technology is presented. This architecture is expressed in the unit cell'' approach, where tiling cells in two dimensions and allowing inter-cellular nearest-neighbour interactions makes the architecture compatible with the surface code for fault tolerant quantum computation.
  arXiv  Detail & Related papers  (2022-08-19T06:36:34Z)
• 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)
• Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
  Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks. Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts. We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
  arXiv  Detail & Related papers  (2021-06-11T18:00:09Z)
• Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
  We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor. We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
  arXiv  Detail & Related papers  (2021-01-21T22:18:49Z)
• Entanglement Classification via Neural Network Quantum States [58.720142291102135]
  In this paper we combine machine-learning tools and the theory of quantum entanglement to perform entanglement classification for multipartite qubit systems in pure states. We use a parameterisation of quantum systems using artificial neural networks in a restricted Boltzmann machine (RBM) architecture, known as Neural Network Quantum States (NNS)
  arXiv  Detail & Related papers  (2019-12-31T07:40:23Z)

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.