Improved Success Probability with Greater Circuit Depth for the Quantum Approximate Optimization Algorithm

被引：59

作者：

Bengtsson, Andreas ^{[1
]}

Vikstal, Pontus ^{[1
]}

Warren, Christopher ^{[1
]}

Svensson, Marika ^{[2
,3
]}

Gu, Xiu ^{[1
]}

Kockum, Anton Frisk ^{[1
]}

Krantz, Philip ^{[1
]}

Krizan, Christian ^{[1
]}

Shiri, Daryoush ^{[1
]}

Svensson, Ida-Maria ^{[1
]}

Tancredi, Giovanna ^{[1
]}

Johansson, Goran ^{[1
]}

Delsing, Per ^{[1
]}

Ferrini, Giulia ^{[1
]}

Bylander, Jonas ^{[1
]}

机构：

[1] Chalmers Univ Technol, Microtechnol & Nanosci, SE-41296 Gothenburg, Sweden

[2] Chalmers Univ Technol, Comp Sci & Engn, SE-41296 Gothenburg, Sweden

[3] Jeppesen, SE-41103 Gothenburg, Sweden

来源：

PHYSICAL REVIEW APPLIED | 2020年 / 14卷 / 03期

基金：

瑞典研究理事会;

关键词：

SUPREMACY; QUBITS; GATE;

D O I：

10.1103/PhysRevApplied.14.034010

中图分类号：

O59 [应用物理学];

学科分类号：

摘要：

Present-day, noisy, small or intermediate-scale quantum processors-although far from fault tolerant-support the execution of heuristic quantum algorithms, which might enable a quantum advantage, for example, when applied to combinatorial optimization problems. On small-scale quantum processors, validations of such algorithms serve as important technology demonstrators. We implement the quantum approximate optimization algorithm on our hardware platform, consisting of two superconducting transmon qubits and one parametrically modulated coupler. We solve small instances of the NP (nondeterministic polynomial time)-complete exact-cover problem, with 96.6% success probability, by iterating the algorithm up to level two.

引用

页数：9

共 31 条

[1] Quantum supremacy using a programmable superconducting processor [J].

Arute, Frank ;

Arya, Kunal ;

Babbush, Ryan ;

Bacon, Dave ;

Bardin, Joseph C. ;

Barends, Rami ;

Biswas, Rupak ;

Boixo, Sergio ;

Brandao, Fernando G. S. L. ;

Buell, David A. ;

Burkett, Brian ;

Chen, Yu ;

Chen, Zijun ;

Chiaro, Ben ;

Collins, Roberto ;

Courtney, William ;

Dunsworth, Andrew ;

Farhi, Edward ;

Foxen, Brooks ;

Fowler, Austin ;

Gidney, Craig ;

Giustina, Marissa ;

Graff, Rob ;

Guerin, Keith ;

Habegger, Steve ;

Harrigan, Matthew P. ;

Hartmann, Michael J. ;

Ho, Alan ;

Hoffmann, Markus ;

Huang, Trent ;

Humble, Travis S. ;

Isakov, Sergei V. ;

Jeffrey, Evan ;

Jiang, Zhang ;

Kafri, Dvir ;

Kechedzhi, Kostyantyn ;

Kelly, Julian ;

Klimov, Paul V. ;

Knysh, Sergey ;

Korotkov, Alexander ;

Kostritsa, Fedor ;

Landhuis, David ;

Lindmark, Mike ;

Lucero, Erik ;

Lyakh, Dmitry ;

Mandra, Salvatore ;

McClean, Jarrod R. ;

McEwen, Matthew ;

Megrant, Anthony ;

Mi, Xiao .

NATURE, 2019, 574 (7779) :505-+

[2] Characterizing quantum supremacy in near-term devices [J].

Boixo, Sergio ;

Isakov, Sergei, V ;

Smelyanskiy, Vadim N. ;

Babbush, Ryan ;

Ding, Nan ;

Jiang, Zhang ;

Bremner, Michael J. ;

Martinis, John M. ;

Neven, Hartmut .

NATURE PHYSICS, 2018, 14 (06) :595-600

[3] Decoherence benchmarking of superconducting qubits [J].

Burnett, Jonathan J. ;

Bengtsson, Andreas ;

Scigliuzzo, Marco ;

Niepce, David ;

Kudra, Marina ;

Delsing, Per ;

Bylander, Jonas .

NPJ QUANTUM INFORMATION, 2019, 5 (1)

[4] Parametrically Activated Entangling Gates Using Transmon Qubits [J].

Caldwell, S. A. ;

Didier, N. ;

Ryan, C. A. ;

Sete, E. A. ;

Hudson, A. ;

Karalekas, P. ;

Manenti, R. ;

da Silva, M. P. ;

Sinclair, R. ;

Acala, E. ;

Alidoust, N. ;

Angeles, J. ;

Bestwick, A. ;

Block, M. ;

Bloom, B. ;

Bradley, A. ;

Bui, C. ;

Capelluto, L. ;

Chilcott, R. ;

Cordova, J. ;

Crossman, G. ;

Curtis, M. ;

Deshpande, S. ;

El Bouayadi, T. ;

Girshovich, D. ;

Hong, S. ;

Kuang, K. ;

Lenihan, M. ;

Manning, T. ;

Marchenkov, A. ;

Marshall, J. ;

Maydra, R. ;

Mohan, Y. ;

O'Brien, W. ;

Osborn, C. ;

Otterbach, J. ;

Papageorge, A. ;

Paquette, J. -P. ;

Pelstring, M. ;

Polloreno, A. ;

Prawiroatmodjo, G. ;

Rawat, V. ;

Reagor, M. ;

Renzas, R. ;

Rubin, N. ;

Russell, D. ;

Rust, M. ;

Scarabelli, D. ;

Scheer, M. ;

Selvanayagam, M. .

PHYSICAL REVIEW APPLIED, 2018, 10 (03)

[5]

Choi V., 2010, Adiabatic Quantum Algorithms for the NP-Complete Maximum-Weight Independent Set, Exact Cover and 3SAT Problems

[6] Detecting highly entangled states with a joint qubit readout [J].

Chow, J. M. ;

DiCarlo, L. ;

Gambetta, J. M. ;

Nunnenkamp, A. ;

Bishop, Lev S. ;

Frunzio, L. ;

Devoret, M. H. ;

Girvin, S. M. ;

Schoelkopf, R. J. .

PHYSICAL REVIEW A, 2010, 81 (06)

[7] Process verification of two-qubit quantum gates by randomized benchmarking [J].

Corcoles, A. D. ;

Gambetta, Jay M. ;

Chow, Jerry M. ;

Smolin, John A. ;

Ware, Matthew ;

Strand, Joel ;

Plourde, B. L. T. ;

Steffen, M. .

PHYSICAL REVIEW A, 2013, 87 (03)

[8] A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem [J].

Farhi, E ;

Goldstone, J ;

Gutmann, S ;

Lapan, J ;

Lundgren, A ;

Preda, D .

SCIENCE, 2001, 292 (5516) :472-476

[9]

Farhi E, 2016, ARXIV160207674

[10]

Farhi Edward, 2014, arXiv preprint arXiv:1411.4028

← 1 2 3 4 →