Client-friendly continuous-variable blind and verifiable quantum computing

@article{Liu2019ClientfriendlyCB,
  title={Client-friendly continuous-variable blind and verifiable quantum computing},
  author={Nana Liu and Tommaso F. Demarie and Si-Hui Tan and Leandro Aolita and Joseph Fitzsimons},
  journal={Physical Review A},
  year={2019}
}
We present a verifiable and blind protocol for assisted universal quantum computing on continuous-variable (CV) platforms. This protocol is highly experimentally-friendly to the client, as it only requires Gaussian-operation capabilities from the latter. Moreover, the server is not required universal quantum-computational power either, its only function being to supply the client with copies of a single-mode non-Gaussian state. Universality is attained based on state-injection of the server's… 
Building Trust for Continuous Variable Quantum States
We first introduce heterodyne quantum state tomography, a reliable method for continuous variable quantum state certification which directly yields the elements of the density matrix of the state
Resource-efficient verification of quantum computing using Serfling’s bound
TLDR
A significantly more resource-efficient verification protocol for graph states that only requires O(n5 log n) copies is constructed, and the key idea is to employ Serfling’s bound, which is a probability inequality in classical statistics.
Average channel-fidelity witnesses for benchmarking continuous-variable gates.
TLDR
This work introduces witnesses for the average channel fidelity between a known target gate and an arbitrary unknown channel, for continuous-variable (CV) systems, and relies on an improved measurement scheme for Gaussian state-fidelity witnesses, which is polynomially and exponentially more efficient in $m$ and $\Delta$.
Efficient verification of entangled continuous-variable quantum states with local measurements
TLDR
This work establishes a systematic framework for verifying entangled continuous-variable quantum states by employing local measurements only and is able to achieve the unconditionally high verification efficiency which is quadratically better than quantum tomography as well as other nontomographic methods.
Feasible measurement-based entanglement purification in linear optics.
TLDR
This work presents an alternative measurement-based entanglement purification protocol (MB-EPP) that does not require local two-qubit gates or single-particle measurements on the noisy pairs and may offer significant advantages compared with the gate-based EPPs.
Time complexity analysis of quantum difference methods for linear high dimensional and multiscale partial differential equations
TLDR
The detailed analyses show that for the heat and linear hyperbolic equations the quantum difference methods provide exponential speedup over the classical difference method with respect to the spatial dimension.
Logic W-state concentration with parity check

References

SHOWING 1-10 OF 64 REFERENCES
Measurement-only verifiable blind quantum computing with quantum input verification
TLDR
This work introduces a protocol of measurement-only verifiable blind quantum computing where the correctness of the quantum input is also verifiable.
Robustness and device independence of verifiable blind quantum computing
TLDR
The robustness of the single server verifiable universal blind quantum computing protocol of Fitzsimons and Kashefi is proved in the most general scenario and the composition of this protocol with a device-independent state tomography protocol that is based on the rigidity of CHSH games as proposed by Reichardt et al.
Blind quantum computing with weak coherent pulses.
TLDR
The concept of ϵ blindness for UBQC is introduced, in analogy to the concept ofπ security developed for other cryptographic protocols, allowing us to characterize the robustness and security properties of the protocol under possible imperfections.
Unconditionally verifiable blind quantum computation
TLDR
It is rigorously proved that the probability of failing to detect an incorrect output is exponentially small in a security parameter, while resource overhead remains polynomial in this parameter, which allows entangling gates to be performed between arbitrary pairs of logical qubits with only constant overhead.
Self-guaranteed measurement-based quantum computation
TLDR
A "self-guaranteed" protocol for verification of quantum computation under the scheme of measurement-based quantum computation where no prior-trusted devices (measurement basis nor entangled state) are needed.
Continuous-variable blind quantum computation.
  • T. Morimae
  • Computer Science, Physics
    Physical review letters
  • 2012
TLDR
It is shown that blind quantum computation is possible for the infinite squeezing case and that the finite squeezing causes no additional problem in the blind setup apart from the one inherent to the continuous-variable measurement-based quantum computation.
Demonstration of Blind Quantum Computing
TLDR
An experimental demonstration of blind quantum computing in which the input, computation, and output all remain unknown to the computer is presented and the conceptual framework of measurement-based quantum computation that enables a client to delegate a computation to a quantum server is exploited.
Verifiable Measurement-Only Blind Quantum Computing with Stabilizer Testing.
We introduce a simple protocol for verifiable measurement-only blind quantum computing. Alice, a client, can perform only single-qubit measurements, whereas Bob, a server, can generate and store
Resource-efficient verification of quantum computing using Serfling’s bound
TLDR
A significantly more resource-efficient verification protocol for graph states that only requires O(n5 log n) copies is constructed, and the key idea is to employ Serfling’s bound, which is a probability inequality in classical statistics.
Continuous-Variable Instantaneous Quantum Computing is Hard to Sample.
TLDR
This proof is extended to the continuous-variable (CV) domain by using squeezed states and homodyne detection, and by exploring the properties of postselected circuits, showing that, in order to render postselected computational classes in CVs meaningful, a logarithmic scaling of the squeezing parameter with the circuit size is necessary.
...
1
2
3
4
5
...