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

Symposium on Photonics and Optoelectronics

Application of Quantum Seal Theory on Quantum Repeaters

Guang Ping He

Published Aug 1, 2009• 0 citations
Publisher

Abstract

It is revealed that quantum repeaters and quantum seals have a very close relationship, thus the theory in one field can be applied to the other. We give examples of novel results found by applying the existing theory of quantum seals on quantum repeater problem.
DOI
10.1109/sopo.2009.5230250

Related papers

Relationship between quantum repeating devices and quantum seals

Guang Ping He

It is revealed that quantum repeating devices and quantum seals have a very close relationship, thus the theory in one field can be applied to the other. Consequently, it is shown that the fidelity bounds and optimality of quantum repeating devices for decoding quantum information can be violated when they are used for decoding classical information from quantum states and the security bounds for protocols sealing quantum data exist.

arXiv:0903.4979•Physical Review A•Jul 8, 2009•1 citation

Applications of quantum message sealing

G. Gordon Worley

In 2003, Bechmann-Pasquinucci introduced the concept of quantum seals, a quantum analogue to wax seals used to close letters and envelopes. Since then, some improvements on the method have been found. We first review the current quantum sealing techniques, then introduce and discuss potential applications of quantum message sealing, and conclude with some discussion of the limitations of quantum seals.

arXiv:quant-ph/0504207•Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•May 25, 2005•0 citations

On the generic structures of the protocols for quantum auction and quantum summation and their relation

Kabir Sandhu, Sandeep Mishra, Anirban Pathak

Secure multi-party computation (SMC) addresses the problem of jointly computing global functions of private inputs while revealing minimal information about individual data. Two prominent examples of SMC tasks are sealed-bid auction and secure multi-party summation. Existing schemes for quantum auction and quantum summation have largely been developed independently, motivated by distinct applications and employing different computational primitives. In this work, mutual reductions between the two tasks are established for single-item sealed-bid auctions with first-price payment. In one direction, an auction used as a black box computes a secure sum: each party bids a private random key drawn from its input, so the clearing price depends on the inputs only through their sum $S$. The reduction is perfectly private against colluding semi-honest parties and uses $O(S^2\log(1/δ))$ auction rounds, which is optimal, or $O(S\log(1/δ))$ under coherent access. It can be instantiated with an existing auctioneer-free quantum auction after a one-line change to its disjunction subroutine, which as published leaks occupancy counts. In the other direction, summation with randomized inputs yields threshold disjunctions, and a single search over composite keys locates the highest bid and a winner, revealing nothing else. Because each query consumes the bidders' encodings, a bidder can adapt its effective bid undetected, while a fixed query set restores sealed bidding. Combinatorial auctions and general payment rules lie outside this framework. On a superconducting processor, one instance of each direction is executed, recovering the winner for four-bidder instances with ties and the sum of private inputs from repeated auctions.

quant-pharXiv:2606.27693•Jun 29, 2026•0 citations

Efficient Quantum Repeaters without Entanglement Purification

László Gyöngyösi, Sándor Imre

This paper presents a fundamentally new idea, which enhances the efficiency of the quantum repeaters. It is possible to develop a quantum repeater with the elimination of the very inefficient and expensive purification process.

International Conference on Quantum Information•Jan 1, 2011•2 citations

On the Analysis of Quantum Repeater Chains with Sequential Swaps

Matheus Guedes de Andrade, Emily A. Van Milligen, Leonardo Bacciottini +5 more

We evaluate the performance of two-way quantum repeater chains with sequential entanglement swapping. Within the analysis we consider memory decoherence, gate imperfections, and imperfect link-level entanglement generation. Our main results include closed-form expressions for the average entanglement fidelity of the generated end-to-end entangled states. We generalize previous findings for the one-shot fidelity analysis and study the case where repeater chains serve end-to-end requests continuously. We provide solutions to the continuous request scenario by combining results from quantum information theory and queuing theory. Finally, we apply the formulas obtained to analyze the impacts of hardware parameters, i.e., coherence times and gate fidelity, and distance on the entanglement fidelity and secret key rate of homogeneous quantum repeater chains.

arXiv:2405.18252•May 28, 2024•2 citations

Quantum repeaters: current research trends and latest achievements

Ахмеджанов Ринат Абдулхаевич, Yurii Yu. Balega, Andrey D. Deev +1 more

We present a review of current theoretical and experimental studies focused on the development of a quantum repeater, a key device for extended quantum networks that allows entangled states to be distributed over long distances.We also consider the most promising approaches to designing basic devices for quantum repeaters, including quantum memory, sources of nonclassical states of light, and quantum frequency converters.

Physics-Uspekhi•May 1, 2025•5 citations
Secure multi-party computation (SMC) addresses the problem of jointly computing global functions of private inputs while revealing minimal information about individual data. Two prominent examples of SMC tasks are sealed-bid auction and secure multi-party summation. Existing schemes for quantum auction and quantum summation have largely been developed independently, motivated by distinct applications and employing different computational primitives. In this work, mutual reductions between the two tasks are established for single-item sealed-bid auctions with first-price payment. In one direction, an auction used as a black box computes a secure sum: each party bids a private random key drawn from its input, so the clearing price depends on the inputs only through their sum SSS. The reduction is perfectly private against colluding semi-honest parties and uses O(S2log⁡(1/δ))O(S^2\log(1/δ))O(S2log(1/δ)) auction rounds, which is optimal, or O(Slog⁡(1/δ))O(S\log(1/δ))O(Slog(1/δ)) under coherent access. It can be instantiated with an existing auctioneer-free quantum auction after a one-line change to its disjunction subroutine, which as published leaks occupancy counts. In the other direction, summation with randomized inputs yields threshold disjunctions, and a single search over composite keys locates the highest bid and a winner, revealing nothing else. Because each query consumes the bidders' encodings, a bidder can adapt its effective bid undetected, while a fixed query set restores sealed bidding. Combinatorial auctions and general payment rules lie outside this framework. On a superconducting processor, one instance of each direction is executed, recovering the winner for four-bidder instances with ties and the sum of private inputs from repeated auctions.
We evaluate the performance of two-way quantum repeater chains with sequential entanglement swapping. Within the analysis we consider memory decoherence, gate imperfections, and imperfect link-level entanglement generation. Our main results include closed-form expressions for the average entanglement fidelity of the generated end-to-end entangled states. We generalize previous findings for the one-shot fidelity analysis and study the case where repeater chains serve end-to-end requests continuously. We provide solutions to the continuous request scenario by combining results from quantum information theory and queuing theory. Finally, we apply the formulas obtained to analyze the impacts of hardware parameters, i.e., coherence times and gate fidelity, and distance on the entanglement fidelity and secret key rate of homogeneous quantum repeater chains.