Quantum information processing with superconducting circuits: a review

被引:702
作者
Wendin, G. [1 ]
机构
[1] Chalmers Univ Technol, Dept Microtechnol & Nanosci MC2, SE-41296 Gothenburg, Sweden
关键词
superconducting circuits; quantum simulation; quantum information processing; quantum control; quantum error correction; Josephson junctions; microwave resonators; POLYNOMIAL-TIME; COMPUTATIONAL-COMPLEXITY; ERROR-CORRECTION; ELECTRON SPINS; SINGLE-PHOTON; GROUND-STATE; COHERENT MANIPULATION; SILICON-CARBIDE; DICKE MODELS; FLUX QUBIT;
D O I
10.1088/1361-6633/aa7e1a
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
During the last ten years, superconducting circuits have passed from being interesting physical devices to becoming contenders for near-future useful and scalable quantum information processing (QIP). Advanced quantum simulation experiments have been shown with up to nine qubits, while a demonstration of quantum supremacy with fifty qubits is anticipated in just a few years. Quantum supremacy means that the quantum system can no longer be simulated by the most powerful classical supercomputers. Integrated classical-quantum computing systems are already emerging that can be used for software development and experimentation, even via web interfaces. Therefore, the time is ripe for describing some of the recent development of superconducting devices, systems and applications. As such, the discussion of superconducting qubits and circuits is limited to devices that are proven useful for current or near future applications. Consequently, the centre of interest is the practical applications of QIP, such as computation and simulation in Physics and Chemistry.
引用
收藏
页数:50
相关论文
共 537 条
[1]  
Aaronson S, 2013, COMPUTABILITY GODEL
[2]   The limits of quantum computers [J].
Aaronson, Scott .
SCIENTIFIC AMERICAN, 2008, 298 (03) :62-69
[3]   Read the fine print [J].
Aaronson, Scott .
NATURE PHYSICS, 2015, 11 (04) :291-293
[4]   Why quantum chemistry is hard [J].
Aaronson, Scott .
NATURE PHYSICS, 2009, 5 (10) :707-708
[5]   Milestones Toward Majorana-Based Quantum Computing [J].
Aasen, David ;
Hell, Michael ;
Mishmash, Ryan V. ;
Higginbotham, Andrew ;
Danon, Jeroen ;
Leijnse, Martin ;
Jespersen, Thomas S. ;
Folk, Joshua A. ;
Marcus, Charles M. ;
Flensberg, Karsten ;
Alicea, Jason .
PHYSICAL REVIEW X, 2016, 6 (03)
[6]   Simulations of many-body Fermi systems on a universal quantum computer [J].
Abrams, DS ;
Lloyd, S .
PHYSICAL REVIEW LETTERS, 1997, 79 (13) :2586-2589
[7]   Quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors [J].
Abrams, DS ;
Lloyd, S .
PHYSICAL REVIEW LETTERS, 1999, 83 (24) :5162-5165
[8]   MOLECULAR COMPUTATION OF SOLUTIONS TO COMBINATORIAL PROBLEMS [J].
ADLEMAN, LM .
SCIENCE, 1994, 266 (5187) :1021-1024
[9]   Realization of the Hofstadter Hamiltonian with Ultracold Atoms in Optical Lattices [J].
Aidelsburger, M. ;
Atala, M. ;
Lohse, M. ;
Barreiro, J. T. ;
Paredes, B. ;
Bloch, I. .
PHYSICAL REVIEW LETTERS, 2013, 111 (18)
[10]   Reexamining classical and quantum models for the D-Wave One processor [J].
Albash, T. ;
Ronnow, T. F. ;
Troyer, M. ;
Lidar, D. A. .
EUROPEAN PHYSICAL JOURNAL-SPECIAL TOPICS, 2015, 224 (01) :111-129