2520:
2510:
27:
243:
qubits, from reliably encoding and retaining this information for long enough to be useful. Therefore, current attempts to produce scalable quantum computers require quantum error correction, and multiple (currently many) physical qubits must be used to create a single, error-tolerant logical qubit.
201:
In 2024, IBM researchers created a quantum error correction code 10 times more efficient than previous research, protecting 12 logical qubits for roughly a million cycles of error checks using 288 qubits. The work demonstrates error correction on near-term devices while reducing overhead – the number
197:
In 2023, Google researchers showed how quantum error correction can improve logical qubit performance by increasing the physical qubit count. These results found that a larger logical qubit (49 physical qubits) had a lower error rate, about 2.9 percent per round of error correction, compared to a
210:
hardware to use 30 physical qubits to form four logical qubits. Scientists used a qubit virtualization system and active syndrome extraction—also called repeated error correction to accomplish this. This work defines how to achieve logical qubits within quantum computation.
205:
In 2024, Microsoft and
Quantinuum announced experimental results that showed logical qubits could be created with significantly fewer physical qubits. The team used quantum error correction techniques developed by Microsoft and Quantinuum’s
756:
Nigg, Daniel; Mueller, Markus; Martinez, Esteban A.; Schindler, Philipp; Hennrich, Markus; Monz, Thomas; Martin-Delgado, Miguel A.; Blatt, Rainer (2014-07-18). "Experimental
Quantum Computations on a Topologically Encoded Qubit".
234:
qubit specifies how a single qubit should behave in a quantum algorithm, subject to quantum logic operations which can be built out of quantum logic gates. However, issues in current technologies preclude single
1122:
885:
Jones, Cody; Fogarty, Michael A.; Morello, Andrea; Gyure, Mark F.; Dzurak, Andrew S.; Ladd, Thaddeus D. (2018-06-01). "A logical qubit in a linear array of semiconductor quantum dots".
300:, which has desirable properties for the stability of qubits. Notably, anyons must exist in systems constrained to two spatial dimensions or fewer, according to the
244:
Depending on the error-correction scheme used, and the error rates of each physical qubit, a single logical qubit could be formed of up to 1,000 physical qubits.
1564:
Fowler, Austin G.; Mariantoni, Matteo; Martinis, John M.; Cleland, Andrew N. (2012). "Surface codes: Towards practical large-scale quantum computation".
379:
Shaw, Bilal; Wilde, Mark M.; Oreshkov, Ognyan; Kremsky, Isaac; Lidar, Daniel A. (2008-07-18). "Encoding One
Logical Qubit Into Six Physical Qubits".
260:, has been proposed as needing many fewer or even a single physical qubit per logical qubit. Topological qubits rely on a class of particles called
1709:
1147:
1671:
507:
Heeres, Reinier W.; Reinhold, Philip; Ofek, Nissim; Frunzio, Luigi; Jiang, Liang; Devoret, Michel H.; Schoelkopf, Robert J. (2016-08-08).
2401:
47:
1222:
2302:
1963:
156:
1197:
1864:
1482:
Yazdani, Maryam; Zamani, Morteza Saheb; Sedighi, Mehdi (2013-06-09). "A Quantum
Physical Design Flow Using ILP and Graph Drawing".
829:
170:
Since the development of the first quantum computer in 1998, most technologies used to implement qubits face issues of stability,
2189:
1173:"Microsoft Tests New Path to Reliable Quantum Computers - 1,000 physical qubits for each logical one? Try a dozen, says Redmond"
186:
to produce an entity which behaves logically as a single qubit would in a quantum circuit or algorithm; this is the subject of
2513:
1699:
2471:
1629:
2047:
194:
many physical qubits to provide stability, error-correction and fault tolerance needed to perform useful computations.
2523:
2411:
1664:
327:
101:
65:
2339:
1997:
257:
1123:"IBM Reports 10 Times More Efficient Error-Correcting Method Brings Practical Quantum Computers Closer To Reality"
2334:
2062:
2042:
1022:
2329:
858:
1841:
2362:
2184:
2087:
1748:
354:
339:
97:
2367:
2235:
1826:
1657:
289:
2391:
2147:
2007:
1781:
1680:
625:
Ristè, D.; Poletto, S.; Huang, M.-Z.; Bruno, A.; Vesterinen, V.; Saira, O.-P.; DiCarlo, L. (2014-10-20).
598:
574:
301:
37:
2544:
2263:
2135:
2032:
1908:
1836:
1743:
285:
2072:
2037:
1933:
1876:
317:
1307:
Deutsch, David; Barenco, Adriano; Ekert, Artur (1995-06-08). "Universality in
Quantum Computation".
2245:
2218:
2194:
2157:
1948:
1881:
1816:
1801:
1771:
1694:
1339:
313:
236:
187:
140:
1172:
2396:
2130:
2022:
1992:
1791:
164:
2466:
2230:
2223:
1970:
1334:
322:
2386:
2012:
1938:
1903:
443:; Knill, Emanuel; Laflamme, Raymond (2001-09-07). "Constructing Qubits in Physical Systems".
125:
304:, which states that in 3 or more spatial dimensions, only fermions and bosons are possible.
2176:
1925:
1776:
1583:
1501:
1448:
1397:
1326:
1265:
1069:
969:
904:
776:
462:
398:
105:
1246:
DiVincenzo, David P. (1995-02-01). "Two-bit gates are universal for quantum computation".
8:
2495:
2448:
2278:
2052:
1806:
1786:
1721:
1716:
223:
operations have been shown to be universal. A quantum algorithm can be instantiated as a
171:
121:
93:
1587:
1505:
1452:
1401:
1330:
1269:
1098:
1073:
1047:
973:
908:
780:
466:
402:
2211:
2057:
1859:
1796:
1607:
1573:
1544:
1517:
1491:
1421:
1387:
1360:
1316:
1289:
1255:
1059:
998:
959:
947:
928:
894:
808:
766:
738:
704:
669:
638:
626:
551:
520:
508:
486:
452:
422:
388:
332:
220:
474:
191:
2475:
2120:
2027:
1984:
1915:
1831:
1811:
1766:
1726:
1704:
1611:
1599:
1464:
1425:
1413:
1352:
1281:
1103:
1085:
1003:
985:
932:
920:
800:
792:
742:
730:
722:
674:
656:
556:
538:
478:
414:
253:
152:
117:
79:
1521:
1364:
490:
426:
2142:
2092:
1869:
1591:
1509:
1456:
1405:
1378:
Barenco, Adriano (1995-06-08). "A Universal Two-Bit Gate for
Quantum Computation".
1344:
1293:
1273:
1093:
1077:
993:
977:
912:
812:
784:
718:
714:
664:
648:
546:
530:
470:
406:
183:
109:
1535:
Whitney, Mark; Isailovic, Nemanja; Patel, Yatish; Kubiatowicz, John (2007-04-02).
2268:
2206:
1896:
1891:
224:
175:
144:
113:
108:
which allow qubits to be in some ways more powerful than classical bits for some
1380:
Proceedings of the Royal
Society of London A: Mathematical and Physical Sciences
1309:
Proceedings of the Royal
Society of London A: Mathematical and Physical Sciences
2377:
2354:
2321:
2125:
2002:
1595:
1460:
1081:
981:
534:
509:"Implementing a Universal Gate Set on a Logical Qubit Encoded in an Oscillator"
410:
293:
265:
160:
1649:
1536:
1513:
916:
198:
rate of about 3.0 percent for the smaller logical qubit (17 physical qubits).
2538:
2199:
2017:
1943:
1603:
1417:
1356:
1277:
1089:
989:
924:
796:
726:
660:
542:
482:
440:
418:
788:
627:"Detecting bit-flip errors in a logical qubit using stabilizer measurements"
2419:
2344:
1468:
1409:
1348:
1223:"Quantum in Context: Microsoft & Quantinuum Create Real Logical Qubits"
1107:
1007:
804:
734:
678:
560:
269:
129:
1285:
2429:
2283:
1821:
1392:
1321:
1260:
457:
347:
207:
179:
1439:
Lloyd, Seth (1995-07-10). "Almost Any
Quantum Logic Gate is Universal".
2490:
2424:
2288:
652:
297:
182:. Because of this, many physical qubits are needed for the purposes of
2273:
948:"Suppressing quantum errors by scaling a surface code logical qubit"
2458:
2434:
2293:
2258:
1630:"How 'Anyon' Particles Emerge From Quantum Knots | Quanta Magazine"
1064:
964:
899:
709:
525:
1578:
1549:
1496:
771:
643:
393:
2485:
2102:
1537:"Automated Generation of Layout and Control for Quantum Circuits"
1148:"IBM has just made error correction easier for quantum computers"
1023:"Google's quantum computer reached an error-correcting milestone"
277:
273:
1534:
151:
is a physical or abstract qubit that performs as specified in a
2462:
1958:
1563:
1048:"High-threshold and low-overhead fault-tolerant quantum memory"
1039:
1731:
281:
261:
84:
755:
690:
688:
2480:
1953:
1886:
620:
618:
1198:"Quantum error correction used to actually correct errors"
939:
2097:
2082:
695:
Kapit, Eliot (2016-04-12). "A Very Small
Logical Qubit".
685:
506:
89:
884:
615:
378:
624:
1557:
1481:
852:
850:
1924:
1306:
374:
372:
370:
502:
500:
439:
1623:
1621:
847:
2536:
579:Intelligence Advanced Research Projects Activity
367:
247:
202:of physical qubits required to keep errors low.
1679:
497:
1618:
856:
445:Journal of Physics A: Mathematical and General
1665:
857:Mishmash, Ryan; Alicea, Jason (2017-08-16).
830:"Achieving scalability in quantum computing"
1672:
1658:
1245:
163:to be usable by quantum logic gates (c.f.
48:remove low-quality or irrelevant citations
1577:
1548:
1495:
1391:
1338:
1320:
1259:
1097:
1063:
997:
963:
898:
770:
708:
668:
642:
550:
524:
456:
392:
66:Learn how and when to remove this message
43:No need for multiple citations per claim.
258:topological effects in quantum mechanics
88:is a unit of information analogous to a
2190:Continuous-variable quantum information
1627:
1377:
1020:
945:
859:"Topological qubits: Arriving in 2018?"
139:is a physical device that behaves as a
2537:
1484:Quantum Information Processing Journal
1195:
1120:
1045:
344:Semiconductor-based quantum computing
1653:
1438:
1220:
1145:
880:
878:
694:
292:of particle behavior. Anyons exhibit
1170:
824:
822:
190:. Thus, contemporary logical qubits
20:
13:
875:
323:Quantum computing § Obstacles
284:), and therefore obey neither the
14:
2556:
819:
328:Superconductive quantum computing
2519:
2518:
2509:
2508:
25:
1528:
1475:
1432:
1371:
1300:
1239:
1214:
1189:
1164:
1139:
1114:
1014:
132:and intermediate computations.
946:Acharya, Rajeev (2023-02-22).
749:
719:10.1103/PhysRevLett.116.150501
591:
567:
433:
155:or quantum circuit subject to
1:
2185:Adiabatic quantum computation
1628:Wilczek, Frank (2018-02-27).
1046:Bravyi, Sergei (2024-03-27).
1021:Conover, Emily (2023-02-22).
360:
355:Topological quantum computing
340:Trapped-ion quantum computing
248:Topological quantum computing
98:quantum mechanical properties
38:excessive number of citations
2236:Topological quantum computer
1171:Choi, Charles (2024-04-03).
167:for classical logic gates).
16:Types of quantum information
7:
2514:Quantum information science
1681:Quantum information science
1196:Timmer, John (2024-04-03).
1121:Swayne, Matt (2024-03-28).
475:10.1088/0305-4470/34/35/331
307:
256:, which takes advantage of
214:
143:, used as a component of a
10:
2561:
1909:quantum gate teleportation
1596:10.1103/PhysRevA.86.032324
1461:10.1103/PhysRevLett.75.346
1146:Crane, Leah (2023-08-18).
1082:10.1038/s41586-024-07107-7
982:10.1038/s41586-022-05434-1
535:10.1038/s41467-017-00045-1
411:10.1103/PhysRevA.78.012337
128:, where they are used for
2504:
2447:
2410:
2376:
2353:
2320:
2311:
2244:
2173:
2111:
2071:
2038:Quantum Fourier transform
1983:
1934:Post-quantum cryptography
1877:Entanglement distillation
1850:
1759:
1687:
1514:10.1007/s11128-013-0597-6
1221:Sutor, Bob (2024-04-05).
917:10.1103/PhysRevX.8.021058
318:quantum threshold theorem
237:two-state quantum systems
41:. The details given are:
2524:Quantum mechanics topics
2219:Quantum machine learning
2195:One-way quantum computer
2048:Quantum phase estimation
1949:Quantum key distribution
1882:Monogamy of entanglement
1278:10.1103/PhysRevA.51.1015
599:"Logical Qubits (LogiQ)"
575:"Logical Qubits (LogiQ)"
314:Quantum error correction
290:Bose–Einstein statistics
188:quantum error correction
141:two-state quantum system
96:, but it is affected by
2131:Randomized benchmarking
1993:Amplitude amplification
1541:ACM Computing Frontiers
1441:Physical Review Letters
836:. Microsoft. 2018-05-16
789:10.1126/science.1253742
697:Physical Review Letters
302:spin–statistics theorem
239:, which can be used as
157:unitary transformations
2231:Quantum Turing machine
2224:quantum neural network
1971:Quantum secret sharing
1410:10.1098/rspa.1995.0066
1349:10.1098/rspa.1995.0065
286:Fermi–Dirac statistics
126:computational problems
2303:Entanglement-assisted
2264:quantum convolutional
1939:Quantum coin flipping
1904:Quantum teleportation
1865:entanglement-assisted
1695:DiVincenzo's criteria
834:Microsoft Cloud Blogs
631:Nature Communications
513:Nature Communications
112:. Qubits are used in
2114:processor benchmarks
2043:Quantum optimization
1926:Quantum cryptography
1737:physical vs. logical
192:typically consist of
159:, has a long enough
1827:Quantum speed limit
1722:Quantum programming
1717:Quantum information
1588:2012PhRvA..86c2324F
1506:2013QuIP...12.3239Y
1453:1995PhRvL..75..346L
1402:1995RSPSA.449..679B
1331:1995RSPSA.449..669D
1270:1995PhRvA..51.1015D
1127:The Quantum Insider
1074:2024Natur.627..778B
974:2023Natur.614..676G
909:2018PhRvX...8b1058J
781:2014Sci...345..302N
467:2001JPhA...34.7067V
403:2008PhRvA..78a2337S
122:quantum logic gates
94:classical computing
2476:Forest/Rigetti QCS
2212:quantum logic gate
1998:Bernstein–Vazirani
1985:Quantum algorithms
1860:Classical capacity
1744:Quantum processors
1727:Quantum simulation
653:10.1038/ncomms7983
333:Josephson junction
254:topological qubits
118:quantum algorithms
92:(binary digit) in
2545:Quantum computing
2532:
2531:
2443:
2442:
2340:Linear optical QC
2121:Quantum supremacy
2075:complexity theory
2028:Quantum annealing
1979:
1978:
1916:Superdense coding
1705:Quantum computing
1566:Physical Review A
1386:(1937): 679–683.
1315:(1937): 669–677.
1248:Physical Review A
1227:The Futurum Group
1058:(8005): 778–782.
958:(7949): 676–681.
887:Physical Review X
863:Quantum Frontiers
765:(6194): 302–305.
451:(35): 7067–7079.
381:Physical Review A
165:propagation delay
153:quantum algorithm
80:quantum computing
76:
75:
68:
2552:
2522:
2521:
2512:
2511:
2318:
2317:
2248:error correction
2177:computing models
2143:Relaxation times
2033:Quantum counting
1922:
1921:
1870:quantum capacity
1817:No-teleportation
1802:No-communication
1674:
1667:
1660:
1651:
1650:
1644:
1643:
1641:
1640:
1625:
1616:
1615:
1581:
1561:
1555:
1554:
1552:
1532:
1526:
1525:
1499:
1479:
1473:
1472:
1436:
1430:
1429:
1395:
1393:quant-ph/9505016
1375:
1369:
1368:
1342:
1324:
1322:quant-ph/9505018
1304:
1298:
1297:
1263:
1261:cond-mat/9407022
1254:(2): 1015–1022.
1243:
1237:
1236:
1234:
1233:
1218:
1212:
1211:
1209:
1208:
1193:
1187:
1186:
1184:
1183:
1168:
1162:
1161:
1159:
1158:
1143:
1137:
1136:
1134:
1133:
1118:
1112:
1111:
1101:
1067:
1043:
1037:
1036:
1034:
1033:
1018:
1012:
1011:
1001:
967:
943:
937:
936:
902:
882:
873:
872:
870:
869:
854:
845:
844:
842:
841:
826:
817:
816:
774:
753:
747:
746:
712:
692:
683:
682:
672:
646:
622:
613:
612:
610:
609:
595:
589:
588:
586:
585:
571:
565:
564:
554:
528:
504:
495:
494:
460:
458:quant-ph/0101090
437:
431:
430:
396:
376:
268:that is neither
252:The approach of
219:1-bit and 2-bit
184:error-correction
114:quantum circuits
71:
64:
60:
57:
51:
29:
28:
21:
2560:
2559:
2555:
2554:
2553:
2551:
2550:
2549:
2535:
2534:
2533:
2528:
2500:
2450:
2439:
2412:Superconducting
2406:
2372:
2363:Neutral atom QC
2355:Ultracold atoms
2349:
2314:implementations
2313:
2307:
2247:
2240:
2207:Quantum circuit
2175:
2169:
2163:
2153:
2113:
2107:
2074:
2067:
2023:Hidden subgroup
1975:
1964:other protocols
1920:
1897:quantum network
1892:Quantum channel
1852:
1846:
1792:No-broadcasting
1782:Gottesman–Knill
1755:
1683:
1678:
1648:
1647:
1638:
1636:
1634:Quanta Magazine
1626:
1619:
1562:
1558:
1533:
1529:
1480:
1476:
1437:
1433:
1376:
1372:
1305:
1301:
1244:
1240:
1231:
1229:
1219:
1215:
1206:
1204:
1194:
1190:
1181:
1179:
1169:
1165:
1156:
1154:
1144:
1140:
1131:
1129:
1119:
1115:
1044:
1040:
1031:
1029:
1019:
1015:
944:
940:
883:
876:
867:
865:
855:
848:
839:
837:
828:
827:
820:
754:
750:
693:
686:
623:
616:
607:
605:
597:
596:
592:
583:
581:
573:
572:
568:
505:
498:
438:
434:
377:
368:
363:
310:
250:
225:quantum circuit
217:
176:fault tolerance
145:computer system
72:
61:
55:
52:
45:
36:may contain an
30:
26:
17:
12:
11:
5:
2558:
2548:
2547:
2530:
2529:
2527:
2526:
2516:
2505:
2502:
2501:
2499:
2498:
2496:many others...
2493:
2488:
2483:
2478:
2469:
2455:
2453:
2445:
2444:
2441:
2440:
2438:
2437:
2432:
2427:
2422:
2416:
2414:
2408:
2407:
2405:
2404:
2399:
2394:
2389:
2383:
2381:
2374:
2373:
2371:
2370:
2368:Trapped-ion QC
2365:
2359:
2357:
2351:
2350:
2348:
2347:
2342:
2337:
2332:
2326:
2324:
2322:Quantum optics
2315:
2309:
2308:
2306:
2305:
2300:
2299:
2298:
2291:
2286:
2281:
2276:
2271:
2266:
2261:
2252:
2250:
2242:
2241:
2239:
2238:
2233:
2228:
2227:
2226:
2216:
2215:
2214:
2204:
2203:
2202:
2192:
2187:
2181:
2179:
2171:
2170:
2168:
2167:
2166:
2165:
2161:
2155:
2151:
2140:
2139:
2138:
2128:
2126:Quantum volume
2123:
2117:
2115:
2109:
2108:
2106:
2105:
2100:
2095:
2090:
2085:
2079:
2077:
2069:
2068:
2066:
2065:
2060:
2055:
2050:
2045:
2040:
2035:
2030:
2025:
2020:
2015:
2010:
2005:
2003:Boson sampling
2000:
1995:
1989:
1987:
1981:
1980:
1977:
1976:
1974:
1973:
1968:
1967:
1966:
1961:
1956:
1946:
1941:
1936:
1930:
1928:
1919:
1918:
1913:
1912:
1911:
1901:
1900:
1899:
1889:
1884:
1879:
1874:
1873:
1872:
1867:
1856:
1854:
1848:
1847:
1845:
1844:
1839:
1837:Solovay–Kitaev
1834:
1829:
1824:
1819:
1814:
1809:
1804:
1799:
1794:
1789:
1784:
1779:
1774:
1769:
1763:
1761:
1757:
1756:
1754:
1753:
1752:
1751:
1741:
1740:
1739:
1729:
1724:
1719:
1714:
1713:
1712:
1702:
1697:
1691:
1689:
1685:
1684:
1677:
1676:
1669:
1662:
1654:
1646:
1645:
1617:
1556:
1527:
1474:
1447:(2): 346–349.
1431:
1370:
1340:10.1.1.54.2646
1299:
1238:
1213:
1188:
1163:
1138:
1113:
1038:
1013:
938:
874:
846:
818:
748:
703:(15): 150501.
684:
614:
590:
566:
496:
441:Viola, Lorenza
432:
365:
364:
362:
359:
358:
357:
352:
351:
350:
342:
337:
336:
335:
325:
320:
309:
306:
294:braid symmetry
249:
246:
216:
213:
161:coherence time
137:physical qubit
74:
73:
33:
31:
24:
15:
9:
6:
4:
3:
2:
2557:
2546:
2543:
2542:
2540:
2525:
2517:
2515:
2507:
2506:
2503:
2497:
2494:
2492:
2489:
2487:
2484:
2482:
2479:
2477:
2473:
2470:
2468:
2464:
2460:
2457:
2456:
2454:
2452:
2446:
2436:
2433:
2431:
2428:
2426:
2423:
2421:
2418:
2417:
2415:
2413:
2409:
2403:
2400:
2398:
2395:
2393:
2392:Spin qubit QC
2390:
2388:
2385:
2384:
2382:
2379:
2375:
2369:
2366:
2364:
2361:
2360:
2358:
2356:
2352:
2346:
2343:
2341:
2338:
2336:
2333:
2331:
2328:
2327:
2325:
2323:
2319:
2316:
2310:
2304:
2301:
2297:
2296:
2292:
2290:
2287:
2285:
2282:
2280:
2277:
2275:
2272:
2270:
2267:
2265:
2262:
2260:
2257:
2256:
2254:
2253:
2251:
2249:
2243:
2237:
2234:
2232:
2229:
2225:
2222:
2221:
2220:
2217:
2213:
2210:
2209:
2208:
2205:
2201:
2200:cluster state
2198:
2197:
2196:
2193:
2191:
2188:
2186:
2183:
2182:
2180:
2178:
2172:
2164:
2160:
2156:
2154:
2150:
2146:
2145:
2144:
2141:
2137:
2134:
2133:
2132:
2129:
2127:
2124:
2122:
2119:
2118:
2116:
2110:
2104:
2101:
2099:
2096:
2094:
2091:
2089:
2086:
2084:
2081:
2080:
2078:
2076:
2070:
2064:
2061:
2059:
2056:
2054:
2051:
2049:
2046:
2044:
2041:
2039:
2036:
2034:
2031:
2029:
2026:
2024:
2021:
2019:
2016:
2014:
2011:
2009:
2008:Deutsch–Jozsa
2006:
2004:
2001:
1999:
1996:
1994:
1991:
1990:
1988:
1986:
1982:
1972:
1969:
1965:
1962:
1960:
1957:
1955:
1952:
1951:
1950:
1947:
1945:
1944:Quantum money
1942:
1940:
1937:
1935:
1932:
1931:
1929:
1927:
1923:
1917:
1914:
1910:
1907:
1906:
1905:
1902:
1898:
1895:
1894:
1893:
1890:
1888:
1885:
1883:
1880:
1878:
1875:
1871:
1868:
1866:
1863:
1862:
1861:
1858:
1857:
1855:
1853:communication
1849:
1843:
1840:
1838:
1835:
1833:
1830:
1828:
1825:
1823:
1820:
1818:
1815:
1813:
1810:
1808:
1805:
1803:
1800:
1798:
1795:
1793:
1790:
1788:
1785:
1783:
1780:
1778:
1775:
1773:
1770:
1768:
1765:
1764:
1762:
1758:
1750:
1747:
1746:
1745:
1742:
1738:
1735:
1734:
1733:
1730:
1728:
1725:
1723:
1720:
1718:
1715:
1711:
1708:
1707:
1706:
1703:
1701:
1698:
1696:
1693:
1692:
1690:
1686:
1682:
1675:
1670:
1668:
1663:
1661:
1656:
1655:
1652:
1635:
1631:
1624:
1622:
1613:
1609:
1605:
1601:
1597:
1593:
1589:
1585:
1580:
1575:
1572:(3): 032324.
1571:
1567:
1560:
1551:
1546:
1542:
1538:
1531:
1523:
1519:
1515:
1511:
1507:
1503:
1498:
1493:
1489:
1485:
1478:
1470:
1466:
1462:
1458:
1454:
1450:
1446:
1442:
1435:
1427:
1423:
1419:
1415:
1411:
1407:
1403:
1399:
1394:
1389:
1385:
1381:
1374:
1366:
1362:
1358:
1354:
1350:
1346:
1341:
1336:
1332:
1328:
1323:
1318:
1314:
1310:
1303:
1295:
1291:
1287:
1283:
1279:
1275:
1271:
1267:
1262:
1257:
1253:
1249:
1242:
1228:
1224:
1217:
1203:
1199:
1192:
1178:
1177:IEEE Spectrum
1174:
1167:
1153:
1152:New Scientist
1149:
1142:
1128:
1124:
1117:
1109:
1105:
1100:
1095:
1091:
1087:
1083:
1079:
1075:
1071:
1066:
1061:
1057:
1053:
1049:
1042:
1028:
1024:
1017:
1009:
1005:
1000:
995:
991:
987:
983:
979:
975:
971:
966:
961:
957:
953:
949:
942:
934:
930:
926:
922:
918:
914:
910:
906:
901:
896:
893:(2): 021058.
892:
888:
881:
879:
864:
860:
853:
851:
835:
831:
825:
823:
814:
810:
806:
802:
798:
794:
790:
786:
782:
778:
773:
768:
764:
760:
752:
744:
740:
736:
732:
728:
724:
720:
716:
711:
706:
702:
698:
691:
689:
680:
676:
671:
666:
662:
658:
654:
650:
645:
640:
636:
632:
628:
621:
619:
604:
600:
594:
580:
576:
570:
562:
558:
553:
548:
544:
540:
536:
532:
527:
522:
518:
514:
510:
503:
501:
492:
488:
484:
480:
476:
472:
468:
464:
459:
454:
450:
446:
442:
436:
428:
424:
420:
416:
412:
408:
404:
400:
395:
390:
387:(1): 012337.
386:
382:
375:
373:
371:
366:
356:
353:
349:
346:
345:
343:
341:
338:
334:
331:
330:
329:
326:
324:
321:
319:
315:
312:
311:
305:
303:
299:
295:
291:
287:
283:
279:
275:
271:
270:half-integral
267:
263:
259:
255:
245:
242:
238:
233:
228:
226:
222:
212:
209:
203:
199:
195:
193:
189:
185:
181:
177:
173:
168:
166:
162:
158:
154:
150:
149:logical qubit
146:
142:
138:
133:
131:
127:
123:
119:
115:
111:
107:
103:
102:superposition
99:
95:
91:
87:
86:
81:
70:
67:
59:
56:November 2018
49:
44:
40:
39:
34:This article
32:
23:
22:
19:
2420:Charge qubit
2345:KLM protocol
2294:
2158:
2148:
1842:Purification
1772:Eastin–Knill
1736:
1637:. Retrieved
1633:
1569:
1565:
1559:
1540:
1530:
1490:(10): 3239.
1487:
1483:
1477:
1444:
1440:
1434:
1383:
1379:
1373:
1312:
1308:
1302:
1251:
1247:
1241:
1230:. Retrieved
1226:
1216:
1205:. Retrieved
1202:Ars Technica
1201:
1191:
1180:. Retrieved
1176:
1166:
1155:. Retrieved
1151:
1141:
1130:. Retrieved
1126:
1116:
1055:
1051:
1041:
1030:. Retrieved
1026:
1016:
955:
951:
941:
890:
886:
866:. Retrieved
862:
838:. Retrieved
833:
762:
758:
751:
700:
696:
634:
630:
606:. Retrieved
602:
593:
582:. Retrieved
578:
569:
516:
512:
448:
444:
435:
384:
380:
251:
240:
231:
229:
221:quantum gate
218:
204:
200:
196:
169:
148:
136:
134:
130:input/output
120:composed of
106:entanglement
83:
77:
62:
53:
46:Please help
42:
35:
18:
2451:programming
2430:Phase qubit
2335:Circuit QED
1807:No-deleting
1749:cloud-based
1027:ScienceNews
637:(1): 6983.
348:Quantum dot
298:world lines
264:which have
208:trapped ion
180:scalability
172:decoherence
2491:libquantum
2425:Flux qubit
2330:Cavity QED
2279:Bacon–Shor
2269:stabilizer
1797:No-cloning
1639:2018-09-18
1232:2024-07-09
1207:2024-07-09
1182:2024-07-09
1157:2024-07-09
1132:2024-07-09
1065:2308.07915
1032:2024-07-09
965:2207.06431
900:1608.06335
868:2018-09-17
840:2018-09-18
710:1510.06117
608:2018-10-04
584:2018-09-18
526:1608.02430
361:References
2397:NV center
1832:Threshold
1812:No-hiding
1777:Gleason's
1612:119277773
1604:1050-2947
1579:1208.0928
1550:0704.0268
1497:1306.2037
1426:119447556
1418:1471-2946
1357:1471-2946
1335:CiteSeerX
1090:1476-4687
990:1476-4687
933:119108989
925:2160-3308
797:0036-8075
772:1403.5426
743:118476207
727:0031-9007
661:2041-1723
644:1411.5542
603:iarpa.gov
543:2041-1723
519:(1): 94.
483:0305-4470
419:1050-2947
394:0803.1495
296:in their
124:to solve
2539:Category
2459:OpenQASM
2435:Transmon
2312:Physical
2112:Quantum
2013:Grover's
1787:Holevo's
1760:Theorems
1710:timeline
1700:NISQ era
1522:12195937
1469:10059671
1365:15088854
1108:38538939
1099:10972743
1008:36813892
805:24925911
735:27127945
679:25923318
561:28733580
491:14713492
427:40040752
316:and the
308:See also
288:nor the
278:integral
274:fermions
241:physical
215:Overview
100:such as
2449:Quantum
2387:Kane QC
2246:Quantum
2174:Quantum
2103:PostBQP
2073:Quantum
2058:Simon's
1851:Quantum
1688:General
1584:Bibcode
1502:Bibcode
1449:Bibcode
1398:Bibcode
1327:Bibcode
1294:2317415
1286:9911679
1266:Bibcode
1070:Bibcode
999:9946823
970:Bibcode
905:Bibcode
813:9677048
777:Bibcode
759:Science
670:4421804
552:5522494
463:Bibcode
399:Bibcode
232:logical
2467:IBM QX
2463:Qiskit
2402:NMR QC
2380:-based
2284:Steane
2255:Codes
2053:Shor's
1959:SARG04
1767:Bell's
1610:
1602:
1520:
1467:
1424:
1416:
1363:
1355:
1337:
1292:
1284:
1106:
1096:
1088:
1052:Nature
1006:
996:
988:
952:Nature
931:
923:
811:
803:
795:
741:
733:
725:
677:
667:
659:
559:
549:
541:
489:
481:
425:
417:
282:bosons
276:) nor
262:anyons
2289:Toric
1732:Qubit
1608:S2CID
1574:arXiv
1545:arXiv
1518:S2CID
1492:arXiv
1422:S2CID
1388:arXiv
1361:S2CID
1317:arXiv
1290:S2CID
1256:arXiv
1060:arXiv
960:arXiv
929:S2CID
895:arXiv
809:S2CID
767:arXiv
739:S2CID
705:arXiv
639:arXiv
521:arXiv
487:S2CID
453:arXiv
423:S2CID
389:arXiv
110:tasks
85:qubit
2481:Cirq
2472:Quil
2378:Spin
2274:Shor
1954:BB84
1887:LOCC
1600:ISSN
1465:PMID
1414:ISSN
1353:ISSN
1282:PMID
1104:PMID
1086:ISSN
1004:PMID
986:ISSN
921:ISSN
801:PMID
793:ISSN
731:PMID
723:ISSN
675:PMID
657:ISSN
557:PMID
539:ISSN
479:ISSN
415:ISSN
266:spin
178:and
147:. A
116:and
104:and
82:, a
2295:gnu
2259:CSS
2136:XEB
2098:QMA
2093:QIP
2088:EQP
2083:BQP
2063:VQE
2018:HHL
1822:PBR
1592:doi
1510:doi
1457:doi
1406:doi
1384:449
1345:doi
1313:449
1274:doi
1094:PMC
1078:doi
1056:627
994:PMC
978:doi
956:614
913:doi
785:doi
763:345
715:doi
701:116
665:PMC
649:doi
547:PMC
531:doi
471:doi
407:doi
90:bit
78:In
2541::
2486:Q#
1632:.
1620:^
1606:.
1598:.
1590:.
1582:.
1570:86
1568:.
1543:.
1539:.
1516:.
1508:.
1500:.
1488:12
1486:.
1463:.
1455:.
1445:75
1443:.
1420:.
1412:.
1404:.
1396:.
1382:.
1359:.
1351:.
1343:.
1333:.
1325:.
1311:.
1288:.
1280:.
1272:.
1264:.
1252:51
1250:.
1225:.
1200:.
1175:.
1150:.
1125:.
1102:.
1092:.
1084:.
1076:.
1068:.
1054:.
1050:.
1025:.
1002:.
992:.
984:.
976:.
968:.
954:.
950:.
927:.
919:.
911:.
903:.
889:.
877:^
861:.
849:^
832:.
821:^
807:.
799:.
791:.
783:.
775:.
761:.
737:.
729:.
721:.
713:.
699:.
687:^
673:.
663:.
655:.
647:.
633:.
629:.
617:^
601:.
577:.
555:.
545:.
537:.
529:.
515:.
511:.
499:^
485:.
477:.
469:.
461:.
449:34
447:.
421:.
413:.
405:.
397:.
385:78
383:.
369:^
230:A
227:.
174:,
135:A
2474:–
2465:–
2461:–
2162:2
2159:T
2152:1
2149:T
1673:e
1666:t
1659:v
1642:.
1614:.
1594::
1586::
1576::
1553:.
1547::
1524:.
1512::
1504::
1494::
1471:.
1459::
1451::
1428:.
1408::
1400::
1390::
1367:.
1347::
1329::
1319::
1296:.
1276::
1268::
1258::
1235:.
1210:.
1185:.
1160:.
1135:.
1110:.
1080::
1072::
1062::
1035:.
1010:.
980::
972::
962::
935:.
915::
907::
897::
891:8
871:.
843:.
815:.
787::
779::
769::
745:.
717::
707::
681:.
651::
641::
635:6
611:.
587:.
563:.
533::
523::
517:8
493:.
473::
465::
455::
429:.
409::
401::
391::
280:(
272:(
69:)
63:(
58:)
54:(
50:.
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.