相关论文: Quantum Computation Relative to Oracles

This paper has been withdrawn.

The paper has been withdrawn due to numerical error.

This paper has been withdrawn by the author due to a crucial error in the submission action.

This paper has been withdrawn by the authors,because the proposed protocol is still coverd by the no-go theorem of Mayers, Lo and Chau. We thank H-K. Lo and HF Chau for helpful correspondences.

This paper has been withdrawn by the authors, due to a flaw in the proof of Theorem 1. This preprint is superseded by quant-ph/0610027, where a correct proof can be found. Thanks to Rainer Siegmund-Schultze for spotting the error.

We show that there exists an oracle relative to which quantum commitments exist but no (efficiently verifiable) one-way state generators exist. Both have been widely considered candidates for replacing one-way functions as the minimal…

This paper has been withdrawn by the authors, due to the requirement of the Journal where a modified version will be published.

Errors in the published version of the paper are corrected, and new figures are provided.

The accelerated development of quantum technology has reached a pivotal point. Early in 2014, several results were published demonstrating that several experimental technologies are now accurate enough to satisfy the requirements of…

This paper has been withdrawn. See quant-ph/0408115: G. M. D'Ariano, P. Perinotti and P. Lo Presti, "Classical randomness in quantum measurements"

This paper has been withdrawn by the author(s).The scheme presented is insecure.

This paper has been withdrawn. See published paper http://arxiv.org/math.HO/0512390

In recent years, the quantum oracle model introduced by Aaronson and Kuperberg (2007) has found a lot of use in showing oracle separations between complexity classes and cryptographic primitives. It is generally assumed that proof…

The paper is withdrawn due to an error in Section 2.

The classical PCP theorem is arguably the most important achievement of classical complexity theory in the past quarter century. In recent years, researchers in quantum computational complexity have tried to identify approaches and develop…

The complexity of quantum computation remains poorly understood. While physicists attempt to find ways to create quantum computers, we still do not have much evidence one way or the other as to how useful these machines will be. The tools…

The paper has been withdrawn by the author due to unhappy mistake in the initial scope of the work.

Quantum computers hold the promise to solve certain computational task much more efficiently than classical computers. We review the recent experimental advancements towards a quantum computer with trapped ions. In particular, various…

This paper has been withdrawn by the authors due to crucial error in the main proof (located in Section 2.4). The authors apologize for any inconveniences.

This paper has been withdrawn by the author due to a crucial argument error at p.10.