Quantum State Transfer: Interplay between Gate and Readout Errors
- URL: http://arxiv.org/abs/2209.07021v1
- Date: Thu, 15 Sep 2022 03:22:40 GMT
- Title: Quantum State Transfer: Interplay between Gate and Readout Errors
- Authors: Bharat Thotakura, Tzu-Chieh Wei
- Abstract summary: We simulate quantum state transfer between two nodes connected in a linear geometry through other nodes.
We find that the nominal success probability is not necessarily a monotonic function of the two error rates.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Quantum networks consist of quantum nodes that are linked by entanglement and
quantum information can be transferred from one node to another. Operations can
be applied to qubits of local nodes coordinated by classical communication to
manipulate quantum states and readout/measurement will be employed to obtain
results. Here, we use quantum circuits to simulate quantum state transfer
between two nodes connected in a linear geometry through other nodes. We
explore the interplay between gate and readout errors on the performance of
state transfer. We find that the nominal success probability is not necessarily
a monotonic function of the two error rates and employ numerical simulations
and analytic tools to understand their interplay.
Related papers
- Quantum state transfer between superconducting cavities via exchange-free interactions [20.561557006177914]
We propose and experimentally demonstrate a novel protocol for transferring quantum states between superconducting cavities.
This approach resembles quantum teleportation, where quantum information is transferred between different nodes without directly transmitting carrier photons.
We experimentally realize coherent and bidirectional transfer of arbitrary quantum states, including bosonic quantum error correction codes.
arXiv Detail & Related papers (2024-08-26T07:57:39Z) - Quantum networks using counterfactual quantum communication [0.0]
We propose a new counterfactual quantum communication protocol for transmitting an entangled state from a pair of electrons to two independent photons.
We show that the protocol finds uses in building quantum repeaters leading to a counterfactual quantum network.
arXiv Detail & Related papers (2024-01-30T19:27:09Z) - Success probabilities in time-reversal based hybrid quantum state transfer [0.0]
We consider two memory nodes of a quantum network connected by flying qubits.
We show how and why the probability of interfacing successfully is determined by the overlap of the spectral shape of the actual flying qubit and the ideal shape.
arXiv Detail & Related papers (2024-01-16T04:38:10Z) - Secured Quantum Identity Authentication Protocol for Quantum Networks [2.3317857568404032]
This paper proposes a quantum identity authentication protocol that protects quantum networks from malicious entanglements.
Unlike the existing protocols, the proposed quantum authentication protocol does not require periodic refreshments of the shared secret keys.
arXiv Detail & Related papers (2023-12-10T05:36:49Z) - QuanGCN: Noise-Adaptive Training for Robust Quantum Graph Convolutional
Networks [124.7972093110732]
We propose quantum graph convolutional networks (QuanGCN), which learns the local message passing among nodes with the sequence of crossing-gate quantum operations.
To mitigate the inherent noises from modern quantum devices, we apply sparse constraint to sparsify the nodes' connections.
Our QuanGCN is functionally comparable or even superior than the classical algorithms on several benchmark graph datasets.
arXiv Detail & Related papers (2022-11-09T21:43:16Z) - 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) - Cavity-enhanced quantum network nodes [0.0]
A future quantum network will consist of quantum processors that are connected by quantum channels.
I will describe how optical resonators facilitate quantum network nodes.
arXiv Detail & Related papers (2022-05-30T18:50:35Z) - 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) - 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) - Quantum information spreading in a disordered quantum walk [50.591267188664666]
We design a quantum probing protocol using Quantum Walks to investigate the Quantum Information spreading pattern.
We focus on the coherent static and dynamic disorder to investigate anomalous and classical transport.
Our results show that a Quantum Walk can be considered as a readout device of information about defects and perturbations occurring in complex networks.
arXiv Detail & Related papers (2020-10-20T20:03:19Z) - Genuine quantum networks: superposed tasks and addressing [68.8204255655161]
We show how to make quantum networks, both standard and entanglement-based, genuine quantum.
We provide them with the possibility of handling superposed tasks and superposed addressing.
arXiv Detail & Related papers (2020-04-30T18:00:06Z)
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.