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:quant-ph/0412212

And what if Bohm was right? The fundamental problem of quantum cryptography and a way to circumvent it

Marek Czachor, Marcin Pawłowski

Published Dec 29, 2004• 0 citations
arXivHTMLPDF

Abstract

This paper has been withdrawn. The main technical result will reappear in the new version of quant-ph/0501003.
DOI
10.48550/arxiv.quant-ph/0412212

Related papers

Quantum cryptography without a quantum channel

Marcos Curty, David J. Santos

This paper has been withdrawn by the authors because the results obtained have been reported earlier by other authors.

arXiv:quant-ph/0101079•Jan 17, 2001•0 citations

Mach Zehnder Interferometry with NOON Quantum States

Luca Pezzè, Augusto Smerzi

The paper has been withdrawn by the authors. See newer and expanded version quant-ph/0606221, published in Europhysics Letters 78, 30004 (2007).

arXiv:quant-ph/0606221•Aug 22, 2005•0 citations

Bright tripartite entanglement in triply concurrent parametric oscillation

Ashton S. Bradley, M. K. Olsen, Olivier Pfister +1 more

This paper has been withdrawn since it was an inadvertant double submission. An updated version of the original submission can be found at quant-ph/0505131

arXiv:quant-ph/0508013•Aug 2, 2005•0 citations

On the Underlying Mathematical and Quantum Structure of Quantum Cryptography

Ajey Dilip Gotkhindikar

International Journal Of Engineering And Computer Science•Feb 9, 2016•0 citations

A complete algorithm to find flows in the one-way measurement model

Niel de Beaudrap

This article is the complement to [quant-ph/0611284], which proves that flows (as introduced by [quant-ph/0506062]) can be found efficiently for patterns in the one-way measurement model which have non-empty input and output subsystems of the same size. This article presents a complete algorithm for finding flows, and a proof of its' correctness, without assuming any knowledge of graph-theoretic algorithms on the part of the reader. This article is a revised version of [quant-ph/0603072v2], where the results of [quant-ph/0611284] also first appeared.

arXiv:quant-ph/0603072•Mar 8, 2006•6 citations

New results in fundamental quantum cryptography

Gerald N. Gilbert, Michael Hamrick

•Jan 5, 2004•0 citations
This article is the complement to [quant-ph/0611284], which proves that flows (as introduced by [quant-ph/0506062]) can be found efficiently for patterns in the one-way measurement model which have non-empty input and output subsystems of the same size. This article presents a complete algorithm for finding flows, and a proof of its' correctness, without assuming any knowledge of graph-theoretic algorithms on the part of the reader. This article is a revised version of [quant-ph/0603072v2], where the results of [quant-ph/0611284] also first appeared.