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:1006.1780 · Physical Review A

Minimal computational-space implementation of multiround quantum protocols

Alessandro Bisio, Giacomo Mauro D’Ariano, Paolo Perinotti, Giulio Chiribella

Published Feb 24, 2011• 23 citations
arXivHTMLPDF

Abstract

A single-party strategy in a multiround quantum protocol can be implemented by sequential networks of quantum operations connected by internal memories. Here, we provide an efficient realization in terms of computational-space resources.
DOI
10.1103/physreva.83.022325

Related papers

Minimal Protocols for Entanglement Distribution with Finite Memory Coherence Time

Shahrooz Pouryousef, Hassan Shapourian, Don Towsley

The distribution of entanglement in quantum networks is typically approached under idealized assumptions such as perfect synchronization and centralized control, while classical communication is often neglected. However, these assumptions prove impractical in large-scale networks. In this paper, we present a pragmatic perspective by exploring two minimal asynchronous protocols: a parallel scheme generating entanglement independently at the link level, and a sequential scheme extending entanglement iteratively from one party to the other. Our analysis incorporates non-uniform repeater spacings and classical communications and accounts for quantum memory decoherence. We evaluate network performance using metrics such as entanglement bit rate, end-to-end fidelity, and secret key rate for entanglement-based quantum key distribution. Our findings suggest the sequential scheme's superiority due to comparable performance with the parallel scheme, coupled with simpler implementation. Additionally, we impose a cutoff strategy to improve performance by discarding attempts with prolonged memory idle time, effectively eliminating low-quality entanglement links. Finally, we apply our methods to the real-world topology of SURFnet and report the performance as a function of memory coherence time.

International Conference on Quantum Communications, Networking, and Computing (QCNC)•Jul 1, 2024•0 citations

How to implement a quantum algorithm on a large number of qubits by controlling one central qubit

Alexandre M. Zagoskin, Sahel Ashhab, J. R. Johansson +1 more

Bulletin of the American Physical Society•Mar 18, 2010•0 citations

Time-series quantum reservoir computing with weak and projective measurements

Pere Mujal, Rodrigo Martínez‐Peña, Gian Luca Giorgi +2 more

Abstract Time-series processing is a major challenge in machine learning with enormous progress in the last years in tasks such as speech recognition and chaotic series prediction. A promising avenue for sequential data analysis is quantum machine learning, with computational models like quantum neural networks and reservoir computing. An open question is how to efficiently include quantum measurement in realistic protocols while retaining the needed processing memory and preserving the quantum advantage offered by large Hilbert spaces. In this work, we propose different measurement protocols and assess their efficiency in terms of resources, through theoretical predictions and numerical analysis. We show that it is possible to exploit the quantumness of the reservoir and to obtain ideal performance both for memory and forecasting tasks with two successful measurement protocols. One repeats part of the experiment after each projective measurement while the other employs weak measurements operating online at the trade-off where information can be extracted accurately and without hindering the needed memory, in spite of back-action effects. Our work establishes the conditions for efficient time-series processing paving the way to its implementation in different quantum technologies.

arXiv:2205.06809•npj Quantum Information•Feb 23, 2023•114 citations

An efficient scheme for multi-party quantum state sharing of an arbitrary multi-qubit state with one GHZ channel

Min Jiang, Daoyi Dong

Quantum Information Processing•Jun 18, 2012•10 citations

Representation Matching For Remote Quantum Computing

Yuxiang Yang, Masahito Hayashi

A probabilistic protocol that reduces the communication cost associated with remote quantum computations in a quantum network is developed, suggesting a path towards building an enhanced quantum internet.

arXiv:2009.06667•PRX Quantum•May 26, 2021•4 citations

Analysis of Asynchronous Protocols for Entanglement Distribution in Quantum Networks

Shahrooz Pouryousef, Hassan Shapourian, Don Towsley

The distribution of entanglement in quantum networks is typically approached under idealized assumptions such as perfect synchronization and centralized control, while classical communication is often neglected. However, these assumptions prove impractical in large-scale networks. In this paper, we present a pragmatic perspective by exploring two minimal asynchronous protocols: a parallel scheme generating entanglement independently at the link level, and a sequential scheme extending entanglement iteratively from one party to the other. Our analysis incorporates non-uniform repeater spacings and classical communications and accounts for quantum memory decoherence. We evaluate network performance using metrics such as entanglement bit rate, end-to-end fidelity, and secret key rate for entanglement-based quantum key distribution. Our findings suggest the sequential scheme's superiority due to comparable performance with the parallel scheme, coupled with simpler implementation. Additionally, we impose a cutoff strategy to improve performance by discarding attempts with prolonged memory idle time, effectively eliminating low-quality entanglement links. Finally, we apply our methods to the real-world topology of SURFnet and report the performance as a function of memory coherence time.

arXiv:2405.02406•May 3, 2024•3 citations
The distribution of entanglement in quantum networks is typically approached under idealized assumptions such as perfect synchronization and centralized control, while classical communication is often neglected. However, these assumptions prove impractical in large-scale networks. In this paper, we present a pragmatic perspective by exploring two minimal asynchronous protocols: a parallel scheme generating entanglement independently at the link level, and a sequential scheme extending entanglement iteratively from one party to the other. Our analysis incorporates non-uniform repeater spacings and classical communications and accounts for quantum memory decoherence. We evaluate network performance using metrics such as entanglement bit rate, end-to-end fidelity, and secret key rate for entanglement-based quantum key distribution. Our findings suggest the sequential scheme's superiority due to comparable performance with the parallel scheme, coupled with simpler implementation. Additionally, we impose a cutoff strategy to improve performance by discarding attempts with prolonged memory idle time, effectively eliminating low-quality entanglement links. Finally, we apply our methods to the real-world topology of SURFnet and report the performance as a function of memory coherence time.
Abstract Time-series processing is a major challenge in machine learning with enormous progress in the last years in tasks such as speech recognition and chaotic series prediction. A promising avenue for sequential data analysis is quantum machine learning, with computational models like quantum neural networks and reservoir computing. An open question is how to efficiently include quantum measurement in realistic protocols while retaining the needed processing memory and preserving the quantum advantage offered by large Hilbert spaces. In this work, we propose different measurement protocols and assess their efficiency in terms of resources, through theoretical predictions and numerical analysis. We show that it is possible to exploit the quantumness of the reservoir and to obtain ideal performance both for memory and forecasting tasks with two successful measurement protocols. One repeats part of the experiment after each projective measurement while the other employs weak measurements operating online at the trade-off where information can be extracted accurately and without hindering the needed memory, in spite of back-action effects. Our work establishes the conditions for efficient time-series processing paving the way to its implementation in different quantum technologies.
The distribution of entanglement in quantum networks is typically approached under idealized assumptions such as perfect synchronization and centralized control, while classical communication is often neglected. However, these assumptions prove impractical in large-scale networks. In this paper, we present a pragmatic perspective by exploring two minimal asynchronous protocols: a parallel scheme generating entanglement independently at the link level, and a sequential scheme extending entanglement iteratively from one party to the other. Our analysis incorporates non-uniform repeater spacings and classical communications and accounts for quantum memory decoherence. We evaluate network performance using metrics such as entanglement bit rate, end-to-end fidelity, and secret key rate for entanglement-based quantum key distribution. Our findings suggest the sequential scheme's superiority due to comparable performance with the parallel scheme, coupled with simpler implementation. Additionally, we impose a cutoff strategy to improve performance by discarding attempts with prolonged memory idle time, effectively eliminating low-quality entanglement links. Finally, we apply our methods to the real-world topology of SURFnet and report the performance as a function of memory coherence time.