Fidelity analysis of cyclic three-level system-based quantum routing

2017 ◽  
Vol 31 (27) ◽  
pp. 1750190 ◽  
Author(s):  
Hua Lu ◽  
Guo-An Yan

A quantum router can guide information from one quantum channel to another; thus, it has an increasingly important role in complex quantum networks. Here, we verify that the quantum router proposed by [L. Zhou et al., Phys. Rev. Lett 111, 103604 (2013)] achieves quantum-state high fidelity. When the transition strengths match [Formula: see text], the fidelity of the atom decreases from the maximum value after a period of time and then rises to a maximum value of 1; if the transition strengths do not match, the fidelity will not be able to reach 1.

2021 ◽  
Vol 7 (1) ◽  
Author(s):  
Tomáš Neuman ◽  
Matt Eichenfield ◽  
Matthew E. Trusheim ◽  
Lisa Hackett ◽  
Prineha Narang ◽  
...  

AbstractWe introduce a method for high-fidelity quantum state transduction between a superconducting microwave qubit and the ground state spin system of a solid-state artificial atom, mediated via an acoustic bus connected by piezoelectric transducers. Applied to present-day experimental parameters for superconducting circuit qubits and diamond silicon-vacancy centers in an optimized phononic cavity, we estimate quantum state transduction with fidelity exceeding 99% at a MHz-scale bandwidth. By combining the complementary strengths of superconducting circuit quantum computing and artificial atoms, the hybrid architecture provides high-fidelity qubit gates with long-lived quantum memory, high-fidelity measurement, large qubit number, reconfigurable qubit connectivity, and high-fidelity state and gate teleportation through optical quantum networks.


2021 ◽  
Author(s):  
Yuan Lee ◽  
Eric Bersin ◽  
Wenhan Dai ◽  
Dirk Englund

2018 ◽  
Vol 98 (6) ◽  
Author(s):  
Zichen Yang ◽  
Ze-Yang Fan ◽  
Liang-Zhu Mu ◽  
Heng Fan

2011 ◽  
Vol 09 (06) ◽  
pp. 1437-1448
Author(s):  
YI-BAO LI ◽  
KUI HOU ◽  
SHOU-HUA SHI

We propose two kinds of schemes for multiparty remote state preparation (MRSP) of the multiparticle d-dimensional equatorial quantum states by using partial entangled state as the quantum channel. Unlike more remote state preparation scheme which only one sender knows the original state to be remotely prepared, the quantum state is shared by two-party or multiparty in this scheme. We show that if and only if all the senders agree to collaborate with each other, the receiver can recover the original state with certain probability. It is found that the total success probability of MRSP is only by means of the smaller coefficients of the quantum channel and the dimension d.


2001 ◽  
Vol 1 (Special) ◽  
pp. 7-12
Author(s):  
H. Mabuchi ◽  
M. Armen ◽  
B. Lev ◽  
M. Loncar ◽  
J. Vuckovic ◽  
...  

We review an ongoing program of interdisciplinary research aimed at developing hardware and protocols for quantum communication networks. Our primary experimental goals are to demonstrate quantum state mapping from storage/processing media (internal states of trapped atoms) to transmission media (optical photons), and to investigate a nanotechnology paradigm for cavity QED that would involve the integration of magnetic microtraps with photonic bandgap structures.


Author(s):  
Chuangtao Chen ◽  
Zhimin He ◽  
Zhiming Huang ◽  
Haozhen Situ

Quantum state tomography (QST) is an important and challenging task in the field of quantum information, which has attracted a lot of attentions in recent years. Machine learning models can provide a classical representation of the quantum state after trained on the measurement outcomes, which are part of effective techniques to solve QST problem. In this work, we use a variational autoencoder (VAE) to learn the measurement distribution of two quantum states generated by MPS circuits. We first consider the Greenberger–Horne–Zeilinger (GHZ) state which can be generated by a simple MPS circuit. Simulation results show that a VAE can reconstruct 3- to 8-qubit GHZ states with a high fidelity, i.e., 0.99, and is robust to depolarizing noise. The minimum number ([Formula: see text]) of training samples required to reconstruct the GHZ state up to 0.99 fidelity scales approximately linearly with the number of qubits ([Formula: see text]). However, for the quantum state generated by a complex MPS circuit, [Formula: see text] increases exponentially with [Formula: see text], especially for the quantum state with high entanglement entropy.


Entropy ◽  
2019 ◽  
Vol 21 (3) ◽  
pp. 325 ◽  
Author(s):  
Nicolas Gisin

Twenty-five years after the invention of quantum teleportation, the concept of entanglement gained enormous popularity. This is especially nice to those who remember that entanglement was not even taught at universities until the 1990s. Today, entanglement is often presented as a resource, the resource of quantum information science and technology. However, entanglement is exploited twice in quantum teleportation. Firstly, entanglement is the “quantum teleportation channel”, i.e., entanglement between distant systems. Second, entanglement appears in the eigenvectors of the joint measurement that Alice, the sender, has to perform jointly on the quantum state to be teleported and her half of the “quantum teleportation channel”, i.e., entanglement enabling entirely new kinds of quantum measurements. I emphasize how poorly this second kind of entanglement is understood. In particular, I use quantum networks in which each party connected to several nodes performs a joint measurement to illustrate that the quantumness of such joint measurements remains elusive, escaping today’s available tools to detect and quantify it.


2019 ◽  
Vol 5 (1) ◽  
Author(s):  
Christa Zoufal ◽  
Aurélien Lucchi ◽  
Stefan Woerner

AbstractQuantum algorithms have the potential to outperform their classical counterparts in a variety of tasks. The realization of the advantage often requires the ability to load classical data efficiently into quantum states. However, the best known methods require $${\mathcal{O}}\left({2}^{n}\right)$$O2n gates to load an exact representation of a generic data structure into an $$n$$n-qubit state. This scaling can easily predominate the complexity of a quantum algorithm and, thereby, impair potential quantum advantage. Our work presents a hybrid quantum-classical algorithm for efficient, approximate quantum state loading. More precisely, we use quantum Generative Adversarial Networks (qGANs) to facilitate efficient learning and loading of generic probability distributions - implicitly given by data samples - into quantum states. Through the interplay of a quantum channel, such as a variational quantum circuit, and a classical neural network, the qGAN can learn a representation of the probability distribution underlying the data samples and load it into a quantum state. The loading requires $${\mathcal{O}}\left(poly\left(n\right)\right)$$Opolyn gates and can thus enable the use of potentially advantageous quantum algorithms, such as Quantum Amplitude Estimation. We implement the qGAN distribution learning and loading method with Qiskit and test it using a quantum simulation as well as actual quantum processors provided by the IBM Q Experience. Furthermore, we employ quantum simulation to demonstrate the use of the trained quantum channel in a quantum finance application.


Author(s):  
Yuan Lee ◽  
Eric Bersin ◽  
Axel Dahlberg ◽  
Stephanie Wehner ◽  
Dirk Englund

Sign in / Sign up

Export Citation Format

Share Document