scholarly journals Coherent router for quantum networks with superconducting qubits

2020 ◽  
Vol 2 (1) ◽  
Author(s):  
K. S. Christensen ◽  
S. E. Rasmussen ◽  
D. Petrosyan ◽  
N. T. Zinner
2021 ◽  
pp. 1-1
Author(s):  
Shengyu Zhang ◽  
Shouqian Shi ◽  
Chen Qian ◽  
Kwan L. Yeung
Keyword(s):  

2021 ◽  
Vol 118 (23) ◽  
pp. 232602
Author(s):  
C. R. Conner ◽  
A. Bienfait ◽  
H.-S. Chang ◽  
M.-H. Chou ◽  
É. Dumur ◽  
...  

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 ◽  
Vol 103 (4) ◽  
Author(s):  
J. Novotný ◽  
A. Mariano ◽  
S. Pascazio ◽  
A. Scardicchio ◽  
I. Jex

Nature ◽  
2021 ◽  
Vol 595 (7867) ◽  
pp. 383-387
Author(s):  
◽  
Zijun Chen ◽  
Kevin J. Satzinger ◽  
Juan Atalaya ◽  
Alexander N. Korotkov ◽  
...  

AbstractRealizing the potential of quantum computing requires sufficiently low logical error rates1. Many applications call for error rates as low as 10−15 (refs. 2–9), but state-of-the-art quantum platforms typically have physical error rates near 10−3 (refs. 10–14). Quantum error correction15–17 promises to bridge this divide by distributing quantum logical information across many physical qubits in such a way that errors can be detected and corrected. Errors on the encoded logical qubit state can be exponentially suppressed as the number of physical qubits grows, provided that the physical error rates are below a certain threshold and stable over the course of a computation. Here we implement one-dimensional repetition codes embedded in a two-dimensional grid of superconducting qubits that demonstrate exponential suppression of bit-flip or phase-flip errors, reducing logical error per round more than 100-fold when increasing the number of qubits from 5 to 21. Crucially, this error suppression is stable over 50 rounds of error correction. We also introduce a method for analysing error correlations with high precision, allowing us to characterize error locality while performing quantum error correction. Finally, we perform error detection with a small logical qubit using the 2D surface code on the same device18,19 and show that the results from both one- and two-dimensional codes agree with numerical simulations that use a simple depolarizing error model. These experimental demonstrations provide a foundation for building a scalable fault-tolerant quantum computer with superconducting qubits.


2021 ◽  
Vol 118 (10) ◽  
pp. 100502
Author(s):  
Christian Schimpf ◽  
Marcus Reindl ◽  
Francesco Basso Basset ◽  
Klaus D. Jöns ◽  
Rinaldo Trotta ◽  
...  

2019 ◽  
Vol 5 (1) ◽  
Author(s):  
Ming-Xing Luo

Abstract Nonlocal game as a witness of the nonlocality of entanglement is of fundamental importance in various fields. The well-known nonlocal games or equivalent linear Bell inequalities are only useful for Bell networks consisting of single entanglement. Our goal in this paper is to propose a unified method for constructing cooperating games in network scenarios. We propose an efficient method to construct multipartite nonlocal games from any graphs. The main idea is the graph representation of entanglement-based quantum networks. We further specify these graphic games with quantum advantages by providing a simple sufficient and necessary condition. The graphic games imply a linear Bell testing of the nonlocality of general quantum networks consisting of EPR states. It also allows generating new instances going beyond CHSH game. These results have interesting applications in quantum networks, Bell theory, computational complexity, and theoretical computer science.


2015 ◽  
Vol 87 (4) ◽  
pp. 1379-1418 ◽  
Author(s):  
Andreas Reiserer ◽  
Gerhard Rempe

Sign in / Sign up

Export Citation Format

Share Document