Exchange-Free Computation on an Unknown Qubit at a Distance
- URL: http://arxiv.org/abs/2008.00841v4
- Date: Mon, 18 Jan 2021 15:44:21 GMT
- Title: Exchange-Free Computation on an Unknown Qubit at a Distance
- Authors: Hatim Salih, Jonte R. Hance, Will McCutcheon, Terry Rudolph, and John
Rarity
- Abstract summary: We present a way of directly manipulating an arbitrary qubit, without the exchange of any particles.
This includes as an application the exchange-free preparation of an arbitrary quantum state at Alice by a remote classical Bob.
We show how to use this for the exchange-free control of a universal two-qubit gate.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: We present a way of directly manipulating an arbitrary qubit, without the
exchange of any particles. This includes as an application the exchange-free
preparation of an arbitrary quantum state at Alice by a remote classical Bob.
As a result, we are able to propose a protocol that allows one party to
directly enact, by means of a suitable program, any computation exchange-free
on a remote second party's unknown qubit. Further, we show how to use this for
the exchange-free control of a universal two-qubit gate, thus opening the
possibility of directly enacting any desired algorithm remotely on a
programmable quantum circuit.
Related papers
- Heralded quantum entangling gate for distributed quantum computation in
a decoherence-free subspace [3.711307820430257]
We propose a heralded nonlocal protocol for implementing an entangling gate on two stationary qubits coupled to spatially separated cavities.
By dynamically controlling the evolution of the composite system, the entangling gate can be achieved without real excitations of cavity modes nor atoms.
arXiv Detail & Related papers (2023-05-01T03:19:07Z) - 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) - A Quantum Algorithm for Computing All Diagnoses of a Switching Circuit [73.70667578066775]
Faults are by nature while most man-made systems, and especially computers, work deterministically.
This paper provides such a connecting via quantum information theory which is an intuitive approach as quantum physics obeys probability laws.
arXiv Detail & Related papers (2022-09-08T17:55:30Z) - Reversing Unknown Qubit-Unitary Operation, Deterministically and Exactly [0.9208007322096532]
We consider the most general class of protocols transforming unknown unitary operations within the quantum circuit model.
In the proposed protocol, the input qubit-unitary operation is called 4 times to achieve the inverse operation.
We show a method to reduce the large search space representing all possible protocols.
arXiv Detail & Related papers (2022-09-07T03:33:09Z) - Nontraditional Deterministic Remote State Preparation Using a
Non-Maximally Entangled Channel without Additional Quantum Resources [10.351739012146378]
We have developed a nontraditional remote state preparation protocol that allows for deterministically transferring information encoded in quantum states.
With an auxiliary particle and a simple measurement method, the success probability of preparing a d-dimensional quantum state is increased to 1 without spending additional quantum resources in advance to improve quantum channels.
arXiv Detail & Related papers (2022-03-16T08:59:49Z) - 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) - Quantum thermodynamic methods to purify a qubit on a quantum processing
unit [68.8204255655161]
We report on a quantum thermodynamic method to purify a qubit on a quantum processing unit equipped with identical qubits.
Our starting point is a three qubit design that emulates the well known two qubit swap engine.
We implement it on a publicly available superconducting qubit based QPU, and observe a purification capability down to 200 mK.
arXiv Detail & Related papers (2022-01-31T16:13:57Z) - Software mitigation of coherent two-qubit gate errors [55.878249096379804]
Two-qubit gates are important components of quantum computing.
But unwanted interactions between qubits (so-called parasitic gates) can degrade the performance of quantum applications.
We present two software methods to mitigate parasitic two-qubit gate errors.
arXiv Detail & Related papers (2021-11-08T17:37:27Z) - Deterministic one-way logic gates on a cloud quantum computer [1.4615254965614237]
One-way quantum computing is a promising candidate for fault-tolerant quantum computing.
We propose new protocols to realize a deterministic one-way CNOT gate and one-way $X$-rotations on quantum-computing platforms.
arXiv Detail & Related papers (2021-08-09T08:20:44Z) - Counterfactual Concealed Telecomputation [22.577469136318836]
We devise a distributed blind quantum computation protocol to perform a universal two-qubit controlled unitary operation.
It is shown that the protocol is valid for general input states and that single-qubit unitary teleportation is a special case of CCT.
The protocol becomes deterministic with simplified circuit implementation if the initial composite state of Alice and Bob is a Bell-type state.
arXiv Detail & Related papers (2020-12-09T10:07:58Z) - Secure Two-Party Quantum Computation Over Classical Channels [63.97763079214294]
We consider the setting where the two parties (a classical Alice and a quantum Bob) can communicate only via a classical channel.
We show that it is in general impossible to realize a two-party quantum functionality with black-box simulation in the case of malicious quantum adversaries.
We provide a compiler that takes as input a classical proof of quantum knowledge (PoQK) protocol for a QMA relation R and outputs a zero-knowledge PoQK for R that can be verified by classical parties.
arXiv Detail & Related papers (2020-10-15T17:55:31Z)
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.