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:1611.02926 · Foundations of Physics

Quantum Teleportation and Grover’s Algorithm Without the Wavefunction

Gerd Niestegge

Published Jan 7, 2017• 5 citations
arXivHTMLPDF
DOI
10.1007/s10701-016-0060-5

Related papers

Quantum teleportation and Grover's algorithm without the wavefunction

Gerd Niestegge

•Nov 9, 2016•4 citations

Teleportation as a quantum computation

Gilles Brassard, Samuel L. Braunstein, Richard Cleve

arXiv:quant-ph/9605035•Physica D Nonlinear Phenomena•Sep 1, 1998•189 citations

On a Grover-Based Quantum Signature Scheme and a Teleportation-Based Design

Guoliang Xu, Songyao Xue, Xiangfu Zou +1 more

Quantum computation, with tools including Grover's algorithm, quantum walks, and quantum teleportation, plays an important role in quantum signature designs. Although such designs offer signature functionality, they sometimes come at the cost of security. This paper first reviews a Grover-based scheme and shows how man-in-the-middle attacks enable complete key recovery, Alice's disavowal, and Bob's forgery. We then propose an arbitrated quantum signature scheme based on quantum teleportation and a strengthened quantum one-time pad. The scheme is designed for quantum messages with known classical descriptions, not for arbitrary unknown quantum states. The security of the proposed scheme is analyzed through a formal adversarial model for unforgeability and non-repudiation, and its resilience against replay, intercept-and-resend, man-in-the-middle, entanglement, and collective or coherent attacks is examined. Numerical simulations and an asymptotic resource analysis further illustrate the practicality of the scheme.

Entropy•Sep 18, 2026•0 citations

Grover search algorithm with Rydberg-blockaded atoms: quantum Monte Carlo simulations

David Petrosyan, Mark E. Saffman, Klaus Mølmer

Abstract We consider the Grover search algorithm implementation for a quantum register of size N = 2 k using k (or k + 1 ) microwave- and laser-driven Rydberg-blockaded atoms, following the proposal by Mølmer et al (2011 J. Phys. B 44 184016 ). We suggest some simplifications for the microwave and laser couplings, and analyze the performance of the algorithm for up to k = 4 multilevel atoms under realistic experimental conditions using quantum stochastic (Monte Carlo) wavefunction simulations.

arXiv:1512.05588•Journal of Physics B Atomic Molecular and Optical Physics•Apr 14, 2016•18 citations

Quantum teleportation and quantum information processing

Furusawa

Conference on Lasers and Electro-Optics•Jan 1, 2010•3 citations

Quantum teleportation and quantum information processing

Akira Furusawa, Timothy C. Ralph, Ping Koy Lam

AIP conference proceedings•Jan 1, 2011•5 citations
Quantum computation, with tools including Grover's algorithm, quantum walks, and quantum teleportation, plays an important role in quantum signature designs. Although such designs offer signature functionality, they sometimes come at the cost of security. This paper first reviews a Grover-based scheme and shows how man-in-the-middle attacks enable complete key recovery, Alice's disavowal, and Bob's forgery. We then propose an arbitrated quantum signature scheme based on quantum teleportation and a strengthened quantum one-time pad. The scheme is designed for quantum messages with known classical descriptions, not for arbitrary unknown quantum states. The security of the proposed scheme is analyzed through a formal adversarial model for unforgeability and non-repudiation, and its resilience against replay, intercept-and-resend, man-in-the-middle, entanglement, and collective or coherent attacks is examined. Numerical simulations and an asymptotic resource analysis further illustrate the practicality of the scheme.