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:1911.10001

Quantum Ansible: Telegraph by Cloning a Known Pure State

N. Nikitin, K. S. Toms

Published Nov 22, 2019• 0 citations
arXivHTMLPDF

Abstract

In the framework of non-relativistic quantum mechanics we present a proposal for a gedunken experimental setup of a quantum system allowing information exchange. We discuss the compatibility of the procedure with a few no-go theorems.
DOI
10.48550/arxiv.1911.10001

Related papers

A stronger no-cloning theorem

Richard Jozsa

It is well known that (non-orthogonal) pure states cannot be cloned so one may ask: how much or what kind of additional (quantum) information is needed to supplement one copy of a quantum state in order to be able to produce two copies of that state by a physical operation? For classical information, no supplementary information is required. However for pure quantum (non-orthogonal) states, we show that the supplementary information must always be as large as it can possibly be i.e. the clone must be able to be generated from the additional information alone, independently of the first (given) copy.

arXiv:quant-ph/0204153•Apr 26, 2002•42 citations

Non-classical conditional probability and the quantum no-cloning theorem

Gerd Niestegge

Abstract The quantum mechanical no-cloning theorem for pure states is generalized and transfered to the quantum logics with a conditional probability calculus in a rather abstract, though simple and basic fashion without relying on a tensor product construction or finite dimension as required in other generalizations.

arXiv:1502.02151•Physica Scripta•Aug 11, 2015•6 citations

A New Problem for Quantum Mechanics

Alexander Meehan

In this article I raise a new problem for quantum mechanics, which I call the control problem. Like the measurement problem, the control problem places a fundamental constraint on quantum theories. The characteristic feature of the problem is its focus on state preparation. In particular, whereas the measurement problem turns on a premise about the completeness of the quantum state (‘no hidden variables’), the control problem turns on a premise about our ability to prepare or control quantum states. After raising the problem, I discuss some applications. I suggest that it provides a useful new lens through which to view existing theories or interpretations, in part because it draws attention to aspects of those theories that the measurement problem does not (such as the role of conditional and relative states). I suggest that it also helps clarify the physical significance of the well-known no-go result—the no-cloning theorem—on which it is based.

The British Journal for the Philosophy of Science•Dec 2, 2019•4 citations

How to Beat Restrictions Imposed by no-Cloning Theorem and Relativity Theory?

Dhananjay P. Mehendale

We suggest a way to produce any number of clones of an unknown quantum state. We also suggest a way to transmit information from one place to other far away place exactly and almost instantaneously. This paper thus aims to suggest a method to produce “more than one clone” and a method to achieve “instantaneous and exact information transfer”.

•Feb 1, 2014•0 citations

A Computational Separation Between Quantum No-Cloning and No-Telegraphing

Barak Nehoran, Mark Zhandry

Two of the fundamental no-go theorems of quantum information are the no-cloning theorem (that it is impossible to make copies of general quantum states) and the no-teleportation theorem (the prohibition on telegraphing, or sending quantum states over classical channels without pre-shared entanglement). They are known to be equivalent, in the sense that a collection of quantum states is telegraphable if and only if it is clonable. Our main result suggests that this is not the case when computational efficiency is considered. We give a collection of quantum states and quantum oracles relative to which these states are efficiently clonable but not efficiently telegraphable. Given that the opposite scenario is impossible (states that can be telegraphed can always trivially be cloned), this gives the most complete quantum oracle separation possible between these two important no-go properties. We additionally study the complexity class clonableQMA, a subset of QMA whose witnesses are efficiently clonable. As a consequence of our main result, we give a quantum oracle separation between clonableQMA and the class QCMA, whose witnesses are restricted to classical strings. We also propose a candidate oracle-free promise problem separating these classes. We finally demonstrate an application of clonable-but-not-telegraphable states to cryptography, by showing how such states can be used to protect against key exfiltration.

arXiv:2302.01858•Leibniz international proceedings in informatics•Feb 3, 2023•17 citations

Elementary quantum cloning machines

Думачев Владислав Николаевич

The task of reception of a copy of an arbitrary quantum state with use of a minimum quantity of quantum operations is considered.

arXiv:quant-ph/0602035•Feb 3, 2006•1 citation
It is well known that (non-orthogonal) pure states cannot be cloned so one may ask: how much or what kind of additional (quantum) information is needed to supplement one copy of a quantum state in order to be able to produce two copies of that state by a physical operation? For classical information, no supplementary information is required. However for pure quantum (non-orthogonal) states, we show that the supplementary information must always be as large as it can possibly be i.e. the clone must be able to be generated from the additional information alone, independently of the first (given) copy.
In this article I raise a new problem for quantum mechanics, which I call the control problem. Like the measurement problem, the control problem places a fundamental constraint on quantum theories. The characteristic feature of the problem is its focus on state preparation. In particular, whereas the measurement problem turns on a premise about the completeness of the quantum state (‘no hidden variables’), the control problem turns on a premise about our ability to prepare or control quantum states. After raising the problem, I discuss some applications. I suggest that it provides a useful new lens through which to view existing theories or interpretations, in part because it draws attention to aspects of those theories that the measurement problem does not (such as the role of conditional and relative states). I suggest that it also helps clarify the physical significance of the well-known no-go result—the no-cloning theorem—on which it is based.
Two of the fundamental no-go theorems of quantum information are the no-cloning theorem (that it is impossible to make copies of general quantum states) and the no-teleportation theorem (the prohibition on telegraphing, or sending quantum states over classical channels without pre-shared entanglement). They are known to be equivalent, in the sense that a collection of quantum states is telegraphable if and only if it is clonable. Our main result suggests that this is not the case when computational efficiency is considered. We give a collection of quantum states and quantum oracles relative to which these states are efficiently clonable but not efficiently telegraphable. Given that the opposite scenario is impossible (states that can be telegraphed can always trivially be cloned), this gives the most complete quantum oracle separation possible between these two important no-go properties. We additionally study the complexity class clonableQMA, a subset of QMA whose witnesses are efficiently clonable. As a consequence of our main result, we give a quantum oracle separation between clonableQMA and the class QCMA, whose witnesses are restricted to classical strings. We also propose a candidate oracle-free promise problem separating these classes. We finally demonstrate an application of clonable-but-not-telegraphable states to cryptography, by showing how such states can be used to protect against key exfiltration.