Quantum autoencoders for communication-efficient quantum cloud computing
- URL: http://arxiv.org/abs/2112.12369v1
- Date: Thu, 23 Dec 2021 05:32:38 GMT
- Title: Quantum autoencoders for communication-efficient quantum cloud computing
- Authors: Yan Zhu, Ge Bai, Yuexuan Wang, Tongyang Li, Giulio Chiribella
- Abstract summary: We propose quantum autoencoders for quantum gates (QAEGate) as a method for compressing quantum computations.
A bonus of our method is it does not reveal any information about the server's computation other than the information present in the output.
- Score: 10.158186323912291
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: In the model of quantum cloud computing, the server executes a computation on
the quantum data provided by the client. In this scenario, it is important to
reduce the amount of quantum communication between the client and the server. A
possible approach is to transform the desired computation into a compressed
version that acts on a smaller number of qubits, thereby reducing the amount of
data exchanged between the client and the server. Here we propose quantum
autoencoders for quantum gates (QAEGate) as a method for compressing quantum
computations. We illustrate it in concrete scenarios of single-round and
multi-round communication and validate it through numerical experiments. A
bonus of our method is it does not reveal any information about the server's
computation other than the information present in the output.
Related papers
- On-Chip Verified Quantum Computation with an Ion-Trap Quantum Processing Unit [0.5497663232622965]
We present and experimentally demonstrate a novel approach to verification and benchmarking of quantum computing.
Unlike previous information-theoretically secure verification protocols, our approach is implemented entirely on-chip.
Our results pave the way for more accessible and efficient verification and benchmarking strategies in near-term quantum devices.
arXiv Detail & Related papers (2024-10-31T16:54:41Z) - The curse of random quantum data [62.24825255497622]
We quantify the performances of quantum machine learning in the landscape of quantum data.
We find that the training efficiency and generalization capabilities in quantum machine learning will be exponentially suppressed with the increase in qubits.
Our findings apply to both the quantum kernel method and the large-width limit of quantum neural networks.
arXiv Detail & Related papers (2024-08-19T12:18:07Z) - Supervised binary classification of small-scale digits images with a trapped-ion quantum processor [56.089799129458875]
We show that a quantum processor can correctly solve the basic classification task considered.
With the increase of the capabilities quantum processors, they can become a useful tool for machine learning.
arXiv Detail & Related papers (2024-06-17T18:20:51Z) - Hardware requirements for trapped-ion based verifiable blind quantum computing with a measurement-only client [0.0]
In blind quantum computing, a user with a simple client device can perform a quantum computation on a remote quantum server.
We numerically investigate hardware requirements for verifiable blind quantum computing using an ion trap as server and a distant measurement-only client.
arXiv Detail & Related papers (2024-03-05T05:03:38Z) - 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) - Oblivious Quantum Computation and Delegated Multiparty Quantum
Computation [61.12008553173672]
We propose a new concept, oblivious computation quantum computation, where secrecy of the input qubits and the program to identify the quantum gates are required.
Exploiting quantum teleportation, we propose a two-server protocol for this task.
Also, we discuss delegated multiparty quantum computation, in which, several users ask multiparty quantum computation to server(s) only using classical communications.
arXiv Detail & Related papers (2022-11-02T09:01:33Z) - 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) - Quantum k-means algorithm based on Trusted server in Quantum Cloud
Computing [4.825895794318393]
In the quantum k-means algorithm, the core subroutine is the Quantum minimization algorithm (GroverOptim)
We use quantum homomorphic encryption scheme (QHE) to encrypt the data and upload it to the cloud for computing.
This paper also proposes a T-gate update scheme based on trusted server in quantum ciphertext environment.
arXiv Detail & Related papers (2020-11-09T13:06:27Z) - Blind Quantum Computation Using a Circuit-Based Quantum Computer [0.0]
We put forward a protocol that achieves blindness using the quantum one-time pad for encryption and a T-like gate, and while verifying computation using trap qubits.
arXiv Detail & Related papers (2020-06-11T08:37:45Z) - Communication Cost of Quantum Processes [49.281159740373326]
A common scenario in distributed computing involves a client who asks a server to perform a computation on a remote computer.
An important problem is to determine the minimum amount of communication needed to specify the desired computation.
We analyze the total amount of (classical and quantum) communication needed by a server in order to accurately execute a quantum process chosen by a client.
arXiv Detail & Related papers (2020-02-17T08:51:42Z)
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.