Related papers: Testing honesty of quantum server
We analyze the security of a quantum secure direct communication protocol equipped with authentication. We first propose a specifc attack on the protocol by which, an adversary can break the secret already shared between Alice and Bob, when…
Multi-Party Quantum Computation (MPQC) has attracted a lot of attention as a potential killer-app for quantum networks through it's ability to preserve privacy and integrity of the highly valuable computations they would enable.…
We consider the task of faithfully simulating a distributed quantum measurement, wherein we provide a protocol for the three parties, Alice, Bob and Eve, to simulate a repeated action of a distributed quantum measurement using a pair of…
In blind quantum computation (BQC), a client delegates her quantum computation to a server with universal quantum computers who learns nothing about the client's private information. In measurement-based BQC model, entangled states are…
Designing quantum processors is a complex task that demands advanced verification methods to ensure their correct functionality. However, traditional methods of comprehensively verifying quantum devices, such as quantum process tomography,…
A user who does not have a quantum computer but wants to perform quantum computations may delegate his computation to a quantum cloud server. In order that the delegation works, it must be assured that no evil server can obtain any…
Quantum technology is full of figurative and literal noise obscuring its promise. In this overview, we will attempt to provide a sober assessment of the promise of quantum technology with a focus on computing. We provide a tour of quantum…
This paper presents two unconventional links between quantum and classical physics. The first link appears in the study of quantum cryptography. In the presence of a spy, the quantum correlations shared by Alice and Bob are imperfect. One…
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…
This is a brief review of the experimental and theoretical quantum computing. The hopes for eventually building a useful quantum computer rely entirely on the so-called "threshold theorem". In turn, this theorem is based on a number of…
In two-party quantum communication complexity, Alice and Bob receive some classical inputs and wish to compute some function that depends on both these inputs, while minimizing the communication. This model has found numerous applications…
A quantum computer promises efficient processing of certain computational tasks that are intractable with classical computer technology. While basic principles of a quantum computer have been demonstrated in the laboratory, scalability of…
We further study the security of the quantum bit commitment (QBC) protocol we previously proposed [Phys. Rev. A 74, 022332 (2006).], by analyzing the reduced density matrix \rho_{b}^{B} which describes the quantum state at Bob's side…
Quantum computers are on the brink of surpassing the capabilities of even the most powerful classical computers. This naturally raises the question of how one can trust the results of a quantum computer when they cannot be compared to…
Quantum direct coding or Schumacher compression generalised the ideas of Shannon theory, gave an operational meaning to the von Neumann entropy and established the term qubit. But remembering that information processing is carried out by…
A quantum mirror is a device whose optical response, that is, transmission and reflection, can be controlled by a single qubit. Here, we propose the use of quantum mirrors as nodes in quantum networks. Propagating coherent states mediate…
In order to guarantee the output of a quantum computation, we usually assume that the component devices are trusted. However, when the total computation process is large, it is not easy to guarantee the whole system when we have scaling…
In coin tossing two remote participants want to share a uniformly distributed random bit. At the least in the quantum version, each participant test whether or not the other has attempted to create a bias on this bit. It is requested that,…
Secure communication protocols are becoming increasingly important, e.g. for internet-based communication. Quantum key distribution allows two parties, commonly called Alice and Bob, to generate a secret sequence of 0s and 1s called a key…
It had been widely claimed that quantum mechanics can protect private information during public decision in for example the so-called two-party secure computation. If this were the case, quantum smart-cards could prevent fake teller…