Blind Oracular Quantum Computation
- URL: http://arxiv.org/abs/2010.13840v1
- Date: Mon, 26 Oct 2020 18:53:11 GMT
- Title: Blind Oracular Quantum Computation
- Authors: Cica Gustiani and David P. DiVincenzo
- Abstract summary: We introduce the Blind Quantum Computation scheme, in which the oracle is a distinct node in a quantum network.
In BOQC, an oracle is another client cooperates with the main client so that an oracular quantum algorithm is run on the server.
We prove BOQC be blind: the server cannot learn anything about the clients' computation.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: In the standard oracle model, an oracle efficiently evaluates an unknown
classical function independent of the quantum algorithm itself. Quantum
algorithms have a complex interrelationship to their oracles; for example the
possibility of quantum speedup is affected by the manner by which oracles are
implemented. Therefore, it is physically meaningful to separate oracles from
their quantum algorithms, and we introduce one such separation here. We define
the Blind Oracular Quantum Computation (BOQC) scheme, in which the oracle is a
distinct node in a quantum network. Our work augments the client-server setting
of quantum computing, in which a powerful quantum computer server is available
on the network for discreet use by clients on the network with low quantum
power. In BOQC, an oracle is another client that cooperates with the main
client so that an oracular quantum algorithm is run on the server. The
cooperation between the main client and the oracle takes place (almost) without
communication. We prove BOQC to be blind: the server cannot learn anything
about the clients' computation. This proof is performed within the composable
security definitions provided by the formalism of Abstract Cryptography. We
enhance the BOQC scheme to be runnable with minimal physical qubits when run on
a solid-state quantum network; we prove that this scheme, which we refer to as
BOQCo (BOQC-optimized), possesses the same security as BOQC.
Related papers
- A Quantum-Classical Collaborative Training Architecture Based on Quantum
State Fidelity [50.387179833629254]
We introduce a collaborative classical-quantum architecture called co-TenQu.
Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting.
It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
arXiv Detail & Related papers (2024-02-23T14:09:41Z) - Multi-client distributed blind quantum computation with the Qline
architecture [0.0]
Universal blind quantum computing allows users with minimal quantum resources to delegate a quantum computation to a remote quantum server.
We propose and experimentally demonstrate a lightweight multi-client blind quantum computation protocol based on a novel linear quantum network configuration.
arXiv Detail & Related papers (2023-06-08T13:50:02Z) - Delegated variational quantum algorithms based on quantum homomorphic
encryption [69.50567607858659]
Variational quantum algorithms (VQAs) are one of the most promising candidates for achieving quantum advantages on quantum devices.
The private data of clients may be leaked to quantum servers in such a quantum cloud model.
A novel quantum homomorphic encryption (QHE) scheme is constructed for quantum servers to calculate encrypted data.
arXiv Detail & Related papers (2023-01-25T07:00:13Z) - Verifiable blind quantum computation with identity authentication for
different types of clients [3.0058005235097123]
Blind quantum computing (BQC) provides a solution for clients with limited quantum capabilities to delegate their quantum computation to remote quantum servers while keeping input, output, and even algorithm private.
In this paper, we propose three multi-party verifiable blind quantum computing (VBQC) protocols with identity authentication to handle clients with varying quantum capabilities in quantum networks.
arXiv Detail & Related papers (2022-10-18T13:21:34Z) - Quantum Entanglement with Self-stabilizing Token Ring for Fault-tolerant
Distributed Quantum Computing System [0.0]
This paper shows how to construct quantum entanglement states of n qubits based on a self-stabilizing token ring algorithm.
The entangled states can be applied to the fields of the quantum network, quantum Internet, distributed quantum computing, and quantum cloud.
arXiv Detail & Related papers (2022-09-23T01:20:36Z) - Iterative Qubits Management for Quantum Index Searching in a Hybrid
System [56.39703478198019]
IQuCS aims at index searching and counting in a quantum-classical hybrid system.
We implement IQuCS with Qiskit and conduct intensive experiments.
Results demonstrate that it reduces qubits consumption by up to 66.2%.
arXiv Detail & Related papers (2022-09-22T21:54:28Z) - Entanglement and coherence in Bernstein-Vazirani algorithm [58.720142291102135]
Bernstein-Vazirani algorithm allows one to determine a bit string encoded into an oracle.
We analyze in detail the quantum resources in the Bernstein-Vazirani algorithm.
We show that in the absence of entanglement, the performance of the algorithm is directly related to the amount of quantum coherence in the initial state.
arXiv Detail & Related papers (2022-05-26T20:32:36Z) - An Evolutionary Pathway for the Quantum Internet Relying on Secure
Classical Repeaters [64.48099252278821]
We conceive quantum networks using secure classical repeaters combined with the quantum secure direct communication principle.
In these networks, the ciphertext gleaned from a quantum-resistant algorithm is transmitted using QSDC along the nodes.
We have presented the first experimental demonstration of a secure classical repeater based hybrid quantum network.
arXiv Detail & Related papers (2022-02-08T03:24:06Z) - Quantum Federated Learning with Quantum Data [87.49715898878858]
Quantum machine learning (QML) has emerged as a promising field that leans on the developments in quantum computing to explore large complex machine learning problems.
This paper proposes the first fully quantum federated learning framework that can operate over quantum data and, thus, share the learning of quantum circuit parameters in a decentralized manner.
arXiv Detail & Related papers (2021-05-30T12:19:27Z) - Delegating Multi-Party Quantum Computations vs. Dishonest Majority in
Two Quantum Rounds [0.0]
Multi-Party Quantum Computation (MPQC) has attracted a lot of attention as a potential killer-app for quantum networks.
We present a composable protocol achieving blindness and verifiability even in the case of a single honest client.
arXiv Detail & Related papers (2021-02-25T15:58:09Z) - Relaxation to Equilibrium in a Quantum Network [0.0]
We study the relaxation to equilibrium for a fully connected quantum network with CNOT gates.
We give a number of results for the equilibration in these systems, including analytic estimates.
arXiv Detail & Related papers (2020-09-28T22:15:35Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.