Continuous variable port-based teleportation
- URL: http://arxiv.org/abs/2302.08522v2
- Date: Tue, 21 Nov 2023 19:54:51 GMT
- Title: Continuous variable port-based teleportation
- Authors: Jason L. Pereira, Leonardo Banchi, Stefano Pirandola
- Abstract summary: Port-based teleportation is a generalization of the standard teleportation protocol which does not require unitary operations by the receiver.
This article introduces a general formulation of port-based teleportation in continuous variable systems and study in detail the $N=2$ case.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Port-based teleportation is generalization of the standard teleportation
protocol which does not require unitary operations by the receiver. This comes
at the price of requiring $N>1$ entangled pairs, while $N=1$ for the standard
teleportation protocol. The lack of correction unitaries allows port-based
teleportation to be used as a fundamental theoretical tool to simulate
arbitrary channels with a general resource, with applications to study
fundamental limits of quantum communication, cryptography and sensing, and to
define general programmable quantum computers. Here we introduce a general
formulation of port-based teleportation in continuous variable systems and
study in detail the $N=2$ case. In particular, we interpret the resulting
channel as an energy truncation and analyse the kinds of channels that can be
naturally simulated after this restriction.
Related papers
- Generalised Circuit Partitioning for Distributed Quantum Computing [0.30723404270319693]
This work introduces a graph-based formulation which allows joint optimisation of gate and state teleportation cost.
Using a basic genetic algorithm, improved performance over state-of-the-art methods is obtained in terms of both average e-bit cost and time scaling.
arXiv Detail & Related papers (2024-08-02T17:59:51Z) - Efficient Generation of Multi-partite Entanglement between Non-local Superconducting Qubits using Classical Feedback [14.740159711831723]
In gate-based quantum computing, the creation of entangled states or the distribution of entanglement across a quantum processor often requires circuit depths which grow with the number of entangled qubits.
In teleportation-based quantum computing, one can deterministically generate entangled states with a circuit depth that is constant in the number of qubits.
arXiv Detail & Related papers (2024-03-27T17:06:00Z) - Transversal Injection: A method for direct encoding of ancilla states
for non-Clifford gates using stabiliser codes [55.90903601048249]
We introduce a protocol to potentially reduce this overhead for non-Clifford gates.
Preliminary results hint at high quality fidelities at larger distances.
arXiv Detail & Related papers (2022-11-18T06:03:10Z) - 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) - Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems.
By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
arXiv Detail & Related papers (2021-08-03T17:49:09Z) - Computation-aided classical-quantum multiple access to boost network
communication speeds [61.12008553173672]
We quantify achievable quantum communication rates of codes with computation property for a two-sender cq-MAC.
We show that it achieves the maximum possible communication rate (the single-user capacity), which cannot be achieved with conventional design.
arXiv Detail & Related papers (2021-05-30T11:19:47Z) - Quantifying the performance of bidirectional quantum teleportation [6.345523830122166]
Bidirectional teleportation is a fundamental protocol for exchanging quantum information between two parties.
We develop two ways of quantifying the simulation error of unideal bidirectional teleportation.
We find semi-definite programming lower bounds on the simulation error of unideal bidirectional teleportation.
arXiv Detail & Related papers (2020-10-15T17:36:17Z) - Fault-tolerant Coding for Quantum Communication [71.206200318454]
encode and decode circuits to reliably send messages over many uses of a noisy channel.
For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable.
Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
arXiv Detail & Related papers (2020-09-15T15:10:50Z) - Deterministic Teleportation and Universal Computation Without Particle
Exchange [0.0]
Teleportation is a cornerstone of quantum technologies, and has played a key role in the development of quantum information theory.
Here, we apply a different aspect of quantumness to teleportation -- namely exchange-free computation at a distance.
The controlled-phase universal gate we propose, allows complete Bell detection among two remote parties, and is experimentally feasible.
arXiv Detail & Related papers (2020-09-11T17:51:58Z) - Generalization of port-based teleportation and controlled teleportation
capability [1.6114012813668934]
Port-based teleportation is a variant of the original quantum teleportation.
We construct a concept of the controlled port-based teleportation by combining the controlled teleportation with the port-based teleportation.
arXiv Detail & Related papers (2020-02-28T11:06:16Z) - 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.