Client-friendly continuous-variable blind and verifiable quantum computing

Abstract

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 non-Gaussian supplies. The protocol is automatically blind because the non-Gaussian resource requested to the server is always the same, regardless of the specific computation. Verification, in turn, is possible thanks to an efficient non-Gaussian state fidelity test where we assume identical state preparation by the server. It is based on Gaussian measurements by the client on the injected states, which is potentially interesting on its own. The division of quantum hardware between client and server assumed here is in agreement with the experimental constraints expected in realistic schemes for CV cloud quantum computing.

References in corpus (61)

• Quantum Machine Learning
• Quantum Mechanics helps in searching for a needle in a haystack
• Quantum information with continuous variables
• Gaussian Quantum Information
• Quantum algorithm for solving linear systems of equations
• Quantum Simulation
• Encoding a qubit in an oscillator
• Continuous variable quantum cryptography using coherent states
• Quantum computation over continuous variables
• Continuous-variable optical quantum state tomography
• Universal Quantum Computation with Continuous-Variable Cluster States
• Continuous variable quantum information: Gaussian states and beyond
• Efficient quantum state tomography
• Quantum Data Fitting
• Direct Fidelity Estimation from Few Pauli Measurements
• Experimental Demonstration of Blind Quantum Computing
• Efficient Classical Simulation of Continuous Variable Quantum Information Processes
• A de Finetti representation theorem for infinite dimensional quantum systems and applications to quantum cryptography
• Experimental demonstration of Shor's algorithm with quantum entanglement
• Symmetry implies independence
• Practical characterization of quantum devices without tomography
• Unconditionally verifiable blind computation
• Verifiable measurement-only blind quantum computing with stabilizer testing
• Blind quantum computation protocol in which Alice only makes measurements
• Verification of quantum computation: An overview of existing approaches
• Experimental verification of quantum computations
• A de Finetti representation for finite symmetric quantum states
• Implementation of a quantum cubic gate by adaptive non-Gaussian measurement
• Reliable quantum certification for photonic quantum technologies
• Universal Blind Quantum Computing with Weak Coherent Pulses
• Robustness and device independence of verifiable blind quantum computing
• Quantum machine learning over infinite dimensions
• Experimental Blind Quantum Computing for a Classical Client
• Non-Gaussian states for continuous variable quantum computation via Gaussian maps
• Interactive Proofs For Quantum Computations
• Interactive proofs for BQP via self-tested graph states
• Verification of Many-Qubit States
• Demonstration of measurement-only blind quantum computing
• Repeat-until-success cubic phase gate for universal continuous-variable quantum computation
• Generation and characterization of resource state for nonlinear cubic phase gate
• Quantum simulation of quantum field theory using continuous variables
• Continuous-variable blind quantum computation
• Direct certification of a class of quantum simulations
• Practical quantum computing on encrypted data
• Continuous-Variable Instantaneous Quantum Computing is hard to sample
• Universal quantum computation with temporal-mode bilayer square lattices
• How to Verify a Quantum Computation
• Self-guaranteed measurement-based quantum computation
• Resource-efficient verification of quantum computing using Serfling's bound
• General implementation of arbitrary nonlinear quadrature phase gates
• Fidelity witnesses for fermionic quantum simulations
• Machine learning \& artificial intelligence in the quantum domain
• Device-Independent Verifiable Blind Quantum Computation
• Efficient measurement-based quantum computing with continuous-variable systems
• The power of one qumode for quantum computation
• Measurement-only verifiable blind quantum computing with quantum input verification
• Flow Ambiguity: A Path Towards Classically Driven Blind Quantum Computation
• Anonymous broadcasting of classical information with a continuous-variable topological quantum code
• Detecting Topological Entanglement Entropy in a Lattice of Quantum Harmonic Oscillators
• A Finite de Finetti Theorem for Infinite-Dimensional Systems
• Verified Delegated Quantum Computing with One Pure Qubit

Cited by in corpus (6)

• Time complexity analysis of quantum algorithms via linear representations for nonlinear ordinary and partial differential equations
• Time complexity analysis of quantum difference methods for linear high dimensional and multiscale partial differential equations
• Efficient verification of continuous-variable quantum states and devices without assuming identical and independent operations
• Efficient verification of entangled continuous-variable quantum states with local measurements
• Continuous Variable Quantum Advantages and Applications in Quantum Optics
• Certification of continuous-variable gates using average channel-fidelity witnesses