Related papers: Verifiable measurement-only blind quantum computin…

We consider the problem of teleporting an unknown information state within a quantum network by a sender, say, Alice to any given receiver out of several receivers, say, Bob(1), Bob(2), ...., Bob(n). For this task, we suggest two schemes…

In the Gaussian-modulated coherent states (GMCS) quantum key distribution (QKD) protocol, Alice prepares quantum states \emph{actively}: for each transmission, Alice generates a pair of Gaussian-distributed random numbers, encodes them on a…

We propose and analyze quantum state estimation (tomography) using continuous quantum measurements with resource limitations, allowing the global state of many qubits to be constructed from only measuring a few. We give a proof-of-principle…

We investigate sharing of bipartite entanglement in a scenario where half of an entangled pair is possessed and projectively measured by one observer, called Alice, while the other half is subjected to measurements performed sequentially,…

We consider measurement-based quantum computation using the state of a spin-lattice system in equilibrium with a thermal bath and free to evolve under its own Hamiltonian. Any single qubit measurements disturb the system from equilibrium…

The question of whether a fully classical client can delegate a quantum computation to an untrusted quantum server while fully maintaining privacy (blindness) is one of the big open questions in quantum cryptography. Both yes and no answers…

We propose a scheme for the sharing of quantum steering among three observers, Alice, Bob, and Charlie using standard projective measurements. We show that in the unilateral sequential scenario, Alice can steer Bob's and Charlie's states…

Current quantum computers have the potential to overcome classical computational methods, however, the capability of the algorithms that can be executed on noisy intermediate-scale quantum devices is limited due to hardware imperfections.…

Entanglement-based attacks, which are subtle and powerful, are usually believed to render quantum bit commitment insecure. We point out that the no-go argument leading to this view implicitly assumes the evidence-of-commitment to be a…

Cluster states and graph states in general offer a useful model of the stabilizer formalism and a path toward the development of measurement-based quantum computation. Their defining structure - the stabilizer group - encodes all possible…

Graph states are special entangled states advantageous for many quantum technologies, including quantum error correction, multiparty quantum communication and measurement-based quantum computation. Yet, their fidelity is often disrupted by…

After quantum computers come out, governments and rich companies will have the abilities to buy these useful quantum computers, meanwhile they are familiar with these technologies proficiently. If a client wants to perform quantum computing…

We report the first hybrid matter-photon implementation of verifiable blind quantum computing. We use a trapped-ion quantum server and a client-side photonic detection system networked via a fibre-optic quantum link. The availability of…

In this work, we consider the task of faithfully simulating a quantum measurement, acting on a joint bipartite quantum state, in a distributed manner. In the distributed setup, the constituent sub-systems of the joint quantum state are…

When a universal quantum computer is used by the public, it is assumed that it will be in the form of a quantum cloud server that exists in a few bases due to its cost. In this cloud server, privacy will be a crucial issue, and a blind…

We revisit the problem of detection of entanglement of an unknown two-qubit state using minimal resources. Using weak values and just two copies of an arbitrary two-qubit state, we present a protocol where a post selection measurement in…

In the seminal paper [Metger and Vidick, Quantum '21], they proposed a computational self-testing protocol for Bell states in a single quantum device. Their protocol relies on the fact that the target states are stabilizer states, and hence…

We propose a teleportation protocol involving beam splitting operations and binary-outcome measurements, such as parity measurements. These operations have a straightforward implementation using the dispersive regime of the Jaynes-Cummings…

Blind quantum computation is a scheme that adds unconditional security to cloud quantum computation. In the protocol proposed by Broadbent, Fitzsimons, and Kashefi, the ability to prepare and transmit a single qubit is required for a user…

Oblivious transfer is a fundamental cryptographic primitive which is useful for secure multiparty computation. There are several variants of oblivious transfer. We consider 1 out of 2 oblivious transfer, where a sender sends two bits of…