Related papers: Verifiable measurement-only blind quantum computin…
It is well known that no quantum bit commitment protocol is unconditionally secure. Nonetheless, there can be non-trivial upper bounds on both Bob's probability of correctly estimating Alice's commitment and Alice's probability of…
Quantum steering has attracted increasing research attention because of its fundamental importance, as well as its applications in quantum information science. Here we leverage the power of the deep learning model to infer the steerability…
Quantum steering refers to the possibility for Alice to remotely steer Bob's state by performing local measurements on her half of a bipartite system. Two necessary ingredients for steering are entanglement and incompatibility of Alice's…
Blind quantum computing protocols enable a client, who can generate or measure single-qubit states, to delegate quantum computing to a remote quantum server protecting the client's privacy (i.e., input, output, and program). With current…
We introduce the task of anonymous metrology, in which a physical parameter of an object may be determined without revealing the object's location. Alice and Bob share a correlated quantum state, with which one of them probes the object.…
Distributed computing is a fastest growing field -- enabling virtual computing, parallel computing, and distributed storage. By exploiting the counterfactual techniques, we devise a distributed blind quantum computation protocol to perform…
In this paper, different from the other existing methods that only the special and limited numbers of qubits transmit between Alice and Bob, a general method is proposed to implement Bidirectional Quantum Controlled/uncontrolled…
We address the task of verifying whether a quantum computer, designed to be protected by a specific stabilizer code, correctly encodes the corresponding logical qubits. To achieve this, we develop a general framework for subspace…
Experimental determination of an unknown quantum state usually requires several incompatible measurements. However, it is also possible to determine the full quantum state from a single, repeated measurement. For this purpose, the quantum…
The notion of incompatibility of measurements in quantum theory is in stark contrast with the corresponding classical perspective, where all physical observables are jointly measurable. It is of interest to examine if the results of two or…
We study sequential state discrimination measurements performed on the same qubit by subsequent observers. Specifically, we focus on the case when the observers perform a kind of a minimum-error type state discriminating measurement where…
The efficient and reliable characterization of quantum states plays a vital role in most, if not all, quantum information processing tasks. In this work, we present a universally optimal protocol for verifying entangled states by employing…
The classical channel remote state preparation (ccRSP) is an important two-party primitive in quantum cryptography. Alice (classical polynomial-time) and Bob (quantum polynomial-time) exchange polynomial rounds of classical messages, and…
One of the primary objectives in the field of quantum state learning is to develop algorithms that are time-efficient for learning states generated from quantum circuits. Earlier investigations have demonstrated time-efficient algorithms…
Non-stabilizerness or magic resource characterizes the amount of non-Clifford operations needed to prepare quantum states. It is a crucial resource for quantum computing and a necessary condition for quantum advantage. However, quantifying…
We present a robust method, based only on measurements, to produce superconducting cluster states. The measurement of the current of a few parallel Josephson-junction qubits realizes a novel type of quantum-state selector. Using this…
With experimental quantum computing technologies now in their infancy, the search for efficient means of testing the correctness of these quantum computations is becoming more pressing. An approach to the verification of quantum computation…
The problem of reliably certifying the outcome of a computation performed by a quantum device is rapidly gaining relevance. We present two protocols for a classical verifier to verifiably delegate a quantum computation to two…
Quantum state verification (QSV) is the task of relying on local measurements only to verify that a given quantum device does produce the desired target state. Up to now, certain types of entangled states can be verified efficiently or even…
We consider graph states generated by the action of controlled phase shift operators on a separable state of a multi-qubit system. The case when all the qubits are initially prepared in arbitrary states is investigated. We obtain the…