Constant-round Multi-party Quantum Computation for Constant Parties
- URL: http://arxiv.org/abs/2011.12061v1
- Date: Tue, 24 Nov 2020 12:28:06 GMT
- Title: Constant-round Multi-party Quantum Computation for Constant Parties
- Authors: Zhu Cao
- Abstract summary: We propose the first constant-round multi-party quantum computation protocol for a fixed number of parties against specious adversaries.
Our work has wide implications to quantum fidelity evaluation, quantum machine learning, quantum voting, and distributed quantum information processing.
- Score: 1.3706331473063877
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: One of the central themes in classical cryptography is multi-party
computation, which performs joint computation on multiple participants' data
while maintaining data privacy. The extension to the quantum regime was
proposed in 2002, but despite two decades of research, the current
state-of-the-art multi-party quantum computation protocol for a fixed number of
parties (even 2 parties) requires unbounded rounds of communication, which
greatly limit its practical usage. In this work, we propose the first
constant-round multi-party quantum computation protocol for a fixed number of
parties against specious adversaries, thereby significantly reducing the
required number of rounds. Our work constitutes a key step towards practical
implementation of secure multi-party quantum computation, and opens the door
for practitioners to be involved in this exciting field. The result of our work
has wide implications to quantum fidelity evaluation, quantum machine learning,
quantum voting, and distributed quantum information processing.
Related papers
- 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) - Multipartite Entanglement for Multi-node Quantum Networks [0.0]
Scaling the number of entangled nodes in a quantum network is a challenge with significant implications for quantum computing, clock synchronisation, secure communications, and quantum sensing.
Here, we analyse various schemes that achieve multipartite entanglement between nodes in a single step, bypassing the need for multiple rounds of bipartite entanglement.
We demonstrate that different schemes can produce distinct multipartite entangled states, with varying fidelity and generation rates.
arXiv Detail & Related papers (2024-07-31T20:23:28Z) - 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) - Scalable multiparty steering based on a single pair of entangled qubits [0.6553834611557042]
We show that multiparty loophole-free quantum steering is achievable by constructing a quantum network from a set of qubits of which only one pair is entangled.
This work introduces a scalable approach to rigorously verify quantum nonlocality across multiple parties, thus providing a practical tool towards developing the future quantum internet.
arXiv Detail & Related papers (2023-08-04T13:01:51Z) - 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) - Optimal Stochastic Resource Allocation for Distributed Quantum Computing [50.809738453571015]
We propose a resource allocation scheme for distributed quantum computing (DQC) based on programming to minimize the total deployment cost for quantum resources.
The evaluation demonstrates the effectiveness and ability of the proposed scheme to balance the utilization of quantum computers and on-demand quantum computers.
arXiv Detail & Related papers (2022-09-16T02:37:32Z) - Efficient Bipartite Entanglement Detection Scheme with a Quantum
Adversarial Solver [89.80359585967642]
Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits.
We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
arXiv Detail & Related papers (2022-03-15T09:46:45Z) - Computable and operationally meaningful multipartite entanglement
measures [0.0]
Multipartite entanglement is an essential resource for quantum communication, quantum computing, quantum sensing, and quantum networks.
We introduce a family of multipartite entanglement measures, called Concentratable Entanglements.
We show that these quantities can be efficiently estimated on a quantum computer by implementing a parallelized SWAP test.
arXiv Detail & Related papers (2021-04-14T15:22:56Z) - 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) - Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor.
We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
arXiv Detail & Related papers (2021-01-21T22:18:49Z)
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.