English
Related papers

Related papers: Exchange-Free Computation on an Unknown Qubit at a…

200 papers

Blind quantum computation is a new quantum secure protocol, which enables Alice who does not have enough quantum technology to delegate her computation to Bob who has a fully-fledged quantum power without revealing her input, output and…

Quantum Physics · Physics 2013-06-07 Takahiro Sueki , Takeshi Koshiba , Tomoyuki Morimae

We explicitly show a protocol in which an arbitrary two qubit a|00> + b|01> + c|10> + d|11> is faithfully and deterministically teleported from Alice to Bob. We construct the 16 orthogonal generalized Bell states which can be used to…

Quantum Physics · Physics 2009-11-10 G. Rigolin

We discuss sequential unambiguous state-discrimination measurements performed on the same qubit. Alice prepares a qubit in one of two possible states. The qubit is first sent to Bob, who measures it, and then on to Charlie, who also…

Quantum Physics · Physics 2015-06-16 Janos Bergou , Edgar Feldman , Mark Hillery

We propose a deterministic remote state preparation (RSP) scheme for preparing an arbitrary (including pure and mixed) qubit, where a partially entangled state and finite classical communication are used. To our knowledge, our scheme is the…

Quantum Physics · Physics 2016-05-02 Congyi Hua , Yi-Xin Chen

We study quantum secure direct communication by using a general preshared quantum state and a generalization of dense coding. In this scenario, Alice is allowed to apply a unitary on the preshared state to encode her message, and the set of…

Quantum Physics · Physics 2022-06-08 Jiawei Wu , Gui-Lu Long , Masahito Hayashi

We propose an entanglement sharing protocol based on separable states. Initially, two parties, Alice and Bob, share a two-mode separable Gaussian state. Alice then splits her mode into two separable modes and distributes them between two…

Quantum Physics · Physics 2016-05-04 Ladislav Mišta

The problem of unambiguous state discrimination consists of determining which of a set of known quantum states a particular system is in. One is allowed to fail, but not to make a mistake. The optimal procedure is the one with the lowest…

Quantum Physics · Physics 2009-11-07 Mark Hillery , Jihane Mimih

Oblivious transfer is a cryptographic primitive where Alice has two bits and Bob wishes to learn some function of them. Ideally, Alice should not learn Bob's desired function choice and Bob should not learn any more than what is logically…

Quantum Physics · Physics 2022-06-01 Srijita Kundu , Jamie Sikora , Ernest Y. -Z. Tan

Assume that two distant parties, Alice and Bob, as well as an adversary, Eve, have access to (quantum) systems prepared jointly according to a tripartite state. In addition, Alice and Bob can use local operations and authenticated public…

A new approach to single-qubit operations using exchange interactions of single electrons in gate-defined quantum dots has recently been demonstrated: the resonant exchange qubit. We show that two-qubit operations, specifically the CPHASE…

Mesoscale and Nanoscale Physics · Physics 2013-08-09 Andrew C. Doherty , Matthew P. Wardrop

The prospect of computational hardware with quantum advantage relies critically on the quality of quantum gate operations. Imperfect two-qubit gates is a major bottleneck for achieving scalable quantum information processors. Here, we…

We present many ensembles of states that can be remotely prepared by using minimum classical bits from Alice to Bob and their previously shared entangled state and prove that we have found all the ensembles in two-dimensional case.…

Quantum Physics · Physics 2009-11-10 M. -Y. Ye , Y. -S. Zhang , G. -C. Guo

We study general teleportation scheme with an arbitrary state of the pair of particles (2 and 3) shared by Alice and Bob, and arbitrary measurements on the input particle 1 and one of the members (2) of the pair on Alice's side. We find an…

Quantum Physics · Physics 2009-11-07 J. Rehacek , Z. Hradil , J. Fiurasek , C. Brukner

We propose an efficient quantum protocol performing quantum bit commitment, which is a simple cryptographic primitive involved with two parties, called a committer and a verifier. Our protocol is non-interactive, uses no supplemental shared…

Quantum Physics · Physics 2013-09-03 Tomoyuki Yamakami

We show that it is possible to employ reservoir engineering to turn two distant and relatively bad cavities into one good cavity with a tunable spontaneous decay rate. As a result, quantum computing schemes, that would otherwise require the…

Mesoscale and Nanoscale Physics · Physics 2009-11-13 Jonathan Busch , Elica S. Kyoseva , Michael Trupke , Almut Beige

Quantum gates between spin qubits can be implemented leveraging the natural Heisenberg exchange interaction between two electrons in contact with each other. This interaction is controllable by electrically tailoring the overlap between…

A superconducting qubit device suitable for interacting with a flying electron has recently been proposed [H. Okamoto and Y. Nagatani, Appl. Phys. Lett. \textbf{104}, 062604 (2014)]. Either a clockwise or counter clockwise directed loop of…

Quantum Physics · Physics 2018-04-30 Hiroshi Okamoto

We propose a scheme of quantum secret sharing between Alices' group and Bobs' group with single photons and unitary transformations. In the protocol, one member in Alices' group prepares a sequence of single photons in one of four different…

Quantum Physics · Physics 2009-11-13 Feng-Li Yan , Ting Gao , You-Cheng Li

Since unconditionally secure quantum two-party computations are known to be impossible, most existing quantum private comparison (QPC) protocols adopted a third party. Recently, we proposed a QPC protocol which involves two parties only,…

Quantum Physics · Physics 2018-07-27 Guang Ping He

Quantum computers can solve specific complex tasks for which no reasonable-time classical algorithm is known. Quantum computers do however also offer inherent security of data, as measurements destroy quantum states. Using shared entangled…

Quantum Physics · Physics 2022-08-23 Niels M. P. Neumann , Robert S. Wezeman