Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2606.20841

Enhancing quantum processor capabilities during idle times

Wolfgang Dür

quant-phSubmitted Jun 18, 2026• Announced Jun 22, 2026• 0 citations
arXivHTMLPDF

Abstract

We advocate an alternative paradigm to operate quantum computers that utilizes multipartite entanglement generated in dedicated auxiliary systems during idle times. This stored entanglement enhances the future capabilities of the quantum processor, as it can be flexibly used to assist and speed-up computations when needed. We identify classes of multipartite entangled resource states whose computational power are related to their entanglement features, and in turn to the complexity to generate them. During idle times, one can thus continuously work towards generating more and more powerful auxiliary multipartite entangled states. Idle times include both times prior to the start of a computation, but also any step during the execution of an algorithm where parts of the processor are not actively involved. To illustrate our approach, we consider architectures with limited connectivity, e.g. corresponding to a 1D geometry. We show that $d$-dimensional cluster states allow one to flexibly perform multiple long-distance two-qubit gates in parallel, where both the complexity to generate them, as well as the number of achievable gates increases with $d$.

Comments
14 pages, 5 figures

Related papers

Quantum Entanglement-Based Distributed Computing Resource Coordination

Jincheng Zhang

This paper explores the potential of utilizing quantum entanglement for coordinating distributed computing resources, aiming to achieve efficient and scalable parallel computation. The core claim is that leveraging entanglement allows for resource coordination exceeding the limitations of classical communication, significantly enhancing computational efficiency. The proposed mechanism involves establishing a quantum network where nodes, each equipped with a quantum processor and an entanglement generator, share entangled states and perform measurements to dynamically perceive the computing status and needs of other nodes. This enables real-time task allocation and resource coordination. The novelty lies in exploiting entanglement's inherent properties to facilitate resource synchronization at speeds potentially exceeding the speed of light, offering a new paradigm for large-scale parallel computing. We present a theoretical framework outlining the key components and operational principles of this system, focusing on the mathematical models underlying entanglement-based communication and resource management. This work lays the groundwork for future research into the practical implementation of entanglement-based distributed computing. ---

•Aug 31, 2026•0 citations

Optimized Quantum Networks

Jorge Miguel-Ramiro, Alexander Pirker, Wolfgang Dür

The topology of classical networks is determined by physical links between nodes, and after a network request the links are used to establish the desired connections. Quantum networks offer the possibility to generate different kinds of entanglement prior to network requests, which can substitute links and allow one to fulfill multiple network requests with the same resource state. We utilize this to design entanglement-based quantum networks tailored to their desired functionality, independent of the underlying physical structure. The kind of entanglement to be stored is chosen to fulfill all desired network requests (i.e. parallel bipartite or multipartite communications between specific nodes chosen from some finite set), but in such a way that the storage requirement is minimized. This can be accomplished by using multipartite entangled states shared between network nodes that can be transformed by local operations to different target states. We introduce a clustering algorithm to identify connected clusters in the network for a given desired functionality, i.e. the required network topology of the entanglement-based network, and a merging algorithm that constructs multipartite entangled resource states with reduced memory requirement to fulfill all desired network requests. This leads to a significant reduction in required time and resources, and provides a powerful tool to design quantum networks that is unique to entanglement-based networks.

arXiv:2107.10275•Quantum•Feb 9, 2023•36 citations

A modular entanglement-based quantum computer architecture

Ferran Riera-Sàbat, Wolfgang Dür

Abstract We propose a modular quantum computation architecture based on utilizing multipartite entanglement. Each module consists of a small-scale quantum computer comprising data, memory and entangling qubits. Entangling qubits are used to selectively couple different modules by harnessing some non-controllable, distance-dependent interaction, which is effectively controlled and enhanced via a proper adjusting of the internal state of the qubits. In this way, multipartite entangled states with different entanglement topologies can be shared between modules. These states are stored in memory qubits where they can be further processed so they can eventually be used to deterministically perform certain classes of gates or circuits between modules on demand, including parallel controlled-Z gates with arbitrary interaction patterns, multi-qubit gates or whole Clifford circuits, depending on their entanglement structure. The usage of different kinds of multipartite entanglement rather than Bell pairs allows for more efficient and flexible coupling between modules, leading to a scalable quantum computation architecture.

arXiv:2406.05735•New Journal of Physics•Dec 1, 2024•6 citations

Quantum Entanglement-Driven Distributed Computing Engine

Jincheng Zhang

This paper proposes a novel distributed computing engine leveraging quantum entanglement for unprecedented computational capabilities. The core idea centers around establishing a network of quantum processors interconnected through precisely engineered entanglement protocols, facilitating instantaneous data transfer and parallel computation across nodes. The engine aims to overcome the limitations imposed by the speed of light in classical distributed systems, offering a pathway to solving complex problems with significantly reduced latency and increased processing speed. We introduce a theoretical framework outlining the engine's architecture and operational principles, focusing on the utilization of entangled states for data parallelism and the elimination of communication bottlenecks. The proposed system represents a fundamental shift in distributed computing, moving beyond classical constraints towards a quantum-enhanced paradigm. Key performance metrics, such as computational speedup and latency reduction, are analyzed within the framework, demonstrating the potential of this technology. The exploration is primarily theoretical, focusing on the design principles and potential benefits of such an engine.

•Sep 4, 2026•0 citations

Quantum Entanglement-Based Distributed Computing Architecture

Jincheng Zhang

This paper proposes a novel distributed computing architecture predicated on the precise control of quantum entanglement. The core claim is that by leveraging entanglement, it is possible to design a computing paradigm that surpasses the limitations of classical parallel computing. The proposed architecture utilizes entangled states to connect multiple quantum processors, enabling instantaneous state transfer and information sharing. This approach involves the development of new entanglement generation and control algorithms, optimized to manipulate quantum superposition and interference, thereby enhancing computational efficiency. The key innovation lies in moving beyond the bottleneck of classical communication inherent in traditional distributed systems. This architecture promises a fundamentally different approach to parallel computation, exploiting the unique properties of quantum mechanics. The presented framework offers a potential pathway towards scalable and highly efficient quantum computation, though significant technological challenges remain. The theoretical framework outlines the key components and operational principles of this new architecture.

•Aug 31, 2026•0 citations

Autonomous multipartite entanglement engines

Armin Tavakoli, Géraldine Haack, Nicolas Brunner +1 more

The generation of genuine multipartite entangled states is challenging in practice. Here we explore an alternative route to this task, via autonomous entanglement engines which use only incoherent coupling to thermal baths and time-independent interactions. We present a general machine architecture, which allows for the generation of a broad range of multipartite entangled states in a heralded manner. Specifically, given a target multiple-qubit state, we give a sufficient condition ensuring that it can be generated by our machine. We discuss the cases of Greenberger-Horne-Zeilinger, Dicke, and cluster states in detail. These results demonstrate the potential of purely thermal resources for creating multipartite entangled states useful for quantum information processing.

arXiv:1906.00022•Physical Review A•Jan 13, 2020•45 citations
We advocate an alternative paradigm to operate quantum computers that utilizes multipartite entanglement generated in dedicated auxiliary systems during idle times. This stored entanglement enhances the future capabilities of the quantum processor, as it can be flexibly used to assist and speed-up computations when needed. We identify classes of multipartite entangled resource states whose computational power are related to their entanglement features, and in turn to the complexity to generate them. During idle times, one can thus continuously work towards generating more and more powerful auxiliary multipartite entangled states. Idle times include both times prior to the start of a computation, but also any step during the execution of an algorithm where parts of the processor are not actively involved. To illustrate our approach, we consider architectures with limited connectivity, e.g. corresponding to a 1D geometry. We show that ddd-dimensional cluster states allow one to flexibly perform multiple long-distance two-qubit gates in parallel, where both the complexity to generate them, as well as the number of achievable gates increases with ddd.
This paper explores the potential of utilizing quantum entanglement for coordinating distributed computing resources, aiming to achieve efficient and scalable parallel computation. The core claim is that leveraging entanglement allows for resource coordination exceeding the limitations of classical communication, significantly enhancing computational efficiency. The proposed mechanism involves establishing a quantum network where nodes, each equipped with a quantum processor and an entanglement generator, share entangled states and perform measurements to dynamically perceive the computing status and needs of other nodes. This enables real-time task allocation and resource coordination. The novelty lies in exploiting entanglement's inherent properties to facilitate resource synchronization at speeds potentially exceeding the speed of light, offering a new paradigm for large-scale parallel computing. We present a theoretical framework outlining the key components and operational principles of this system, focusing on the mathematical models underlying entanglement-based communication and resource management. This work lays the groundwork for future research into the practical implementation of entanglement-based distributed computing. ---
The topology of classical networks is determined by physical links between nodes, and after a network request the links are used to establish the desired connections. Quantum networks offer the possibility to generate different kinds of entanglement prior to network requests, which can substitute links and allow one to fulfill multiple network requests with the same resource state. We utilize this to design entanglement-based quantum networks tailored to their desired functionality, independent of the underlying physical structure. The kind of entanglement to be stored is chosen to fulfill all desired network requests (i.e. parallel bipartite or multipartite communications between specific nodes chosen from some finite set), but in such a way that the storage requirement is minimized. This can be accomplished by using multipartite entangled states shared between network nodes that can be transformed by local operations to different target states. We introduce a clustering algorithm to identify connected clusters in the network for a given desired functionality, i.e. the required network topology of the entanglement-based network, and a merging algorithm that constructs multipartite entangled resource states with reduced memory requirement to fulfill all desired network requests. This leads to a significant reduction in required time and resources, and provides a powerful tool to design quantum networks that is unique to entanglement-based networks.
Abstract We propose a modular quantum computation architecture based on utilizing multipartite entanglement. Each module consists of a small-scale quantum computer comprising data, memory and entangling qubits. Entangling qubits are used to selectively couple different modules by harnessing some non-controllable, distance-dependent interaction, which is effectively controlled and enhanced via a proper adjusting of the internal state of the qubits. In this way, multipartite entangled states with different entanglement topologies can be shared between modules. These states are stored in memory qubits where they can be further processed so they can eventually be used to deterministically perform certain classes of gates or circuits between modules on demand, including parallel controlled-Z gates with arbitrary interaction patterns, multi-qubit gates or whole Clifford circuits, depending on their entanglement structure. The usage of different kinds of multipartite entanglement rather than Bell pairs allows for more efficient and flexible coupling between modules, leading to a scalable quantum computation architecture.
This paper proposes a novel distributed computing engine leveraging quantum entanglement for unprecedented computational capabilities. The core idea centers around establishing a network of quantum processors interconnected through precisely engineered entanglement protocols, facilitating instantaneous data transfer and parallel computation across nodes. The engine aims to overcome the limitations imposed by the speed of light in classical distributed systems, offering a pathway to solving complex problems with significantly reduced latency and increased processing speed. We introduce a theoretical framework outlining the engine's architecture and operational principles, focusing on the utilization of entangled states for data parallelism and the elimination of communication bottlenecks. The proposed system represents a fundamental shift in distributed computing, moving beyond classical constraints towards a quantum-enhanced paradigm. Key performance metrics, such as computational speedup and latency reduction, are analyzed within the framework, demonstrating the potential of this technology. The exploration is primarily theoretical, focusing on the design principles and potential benefits of such an engine.
This paper proposes a novel distributed computing architecture predicated on the precise control of quantum entanglement. The core claim is that by leveraging entanglement, it is possible to design a computing paradigm that surpasses the limitations of classical parallel computing. The proposed architecture utilizes entangled states to connect multiple quantum processors, enabling instantaneous state transfer and information sharing. This approach involves the development of new entanglement generation and control algorithms, optimized to manipulate quantum superposition and interference, thereby enhancing computational efficiency. The key innovation lies in moving beyond the bottleneck of classical communication inherent in traditional distributed systems. This architecture promises a fundamentally different approach to parallel computation, exploiting the unique properties of quantum mechanics. The presented framework offers a potential pathway towards scalable and highly efficient quantum computation, though significant technological challenges remain. The theoretical framework outlines the key components and operational principles of this new architecture.
The generation of genuine multipartite entangled states is challenging in practice. Here we explore an alternative route to this task, via autonomous entanglement engines which use only incoherent coupling to thermal baths and time-independent interactions. We present a general machine architecture, which allows for the generation of a broad range of multipartite entangled states in a heralded manner. Specifically, given a target multiple-qubit state, we give a sufficient condition ensuring that it can be generated by our machine. We discuss the cases of Greenberger-Horne-Zeilinger, Dicke, and cluster states in detail. These results demonstrate the potential of purely thermal resources for creating multipartite entangled states useful for quantum information processing.