GCRI · 양자기술
양자 컴퓨팅
Quantum computers use qubits that can be in superpositions and become entangled, which in principle lets some problems be solved far faster than on classical computers. Current machines are noisy and small, and useful fault-tolerant computing requires error correction that is only beginning to be demonstrated. This page sets out how quantum computers work and fail, how progress is measured honestly, and what evidence serves the institutions deciding how to engage.
Quantum computing on the record.
Quantum computing: how the risk develops.
Hardware, algorithms and actual maturity. The dossier below sets out how the risk develops, what is measured, where the data come from, how it is modelled and who decides.
Qubits are fragile
Qubits lose their quantum state through interaction with their environment. Gate errors and decoherence limit how long a computation can run before results become noise.
Error correction needs overhead
Fault-tolerant computing encodes each logical qubit in many physical qubits and corrects errors continuously. It only helps once physical error rates fall below a threshold.
Advantage is problem-specific
Quantum algorithms speed up particular problems, such as simulating quantum 시스템 or factoring. For many tasks classical computers remain as good or better.
Claims need classical comparison
Demonstrations of quantum advantage are often followed by improved classical methods. Honest comparison requires the best classical approach, not a convenient one.
Quantum testbed.
팀이 이 주제를 따라가는 데 사용할 화면으로, 그 지표, 상태, 결정을 보여 줍니다. 이름은 예시이며 값은 설명용입니다.
Quantum testbed
Quantum computing · Testbed lab · Device QD-28
큐비트
| Q0 | 121 | 49 | 0.03 | Drifting |
| Q1 | 118 | 24 | 0.03 | Drifting |
| Q2 | 94 | 41 | 0.03 | Drifting |
| Q3 | 73 | 93 | 0.05 | Drifting |
| Q4 | 50 | 48 | 0.02 | Drifting |
Device
- Topology
- heavy-hex, illustrative
- 2Q fidelity
- 0.994
- 이용
- by committee
- 라벨
- 관측
Quantum computing matters to the domains through simulation and through cryptography.
- 에너지연계Simulation of battery and catalyst chemistry is a proposed early use.What to watchDemonstrated against classical baselines
- 보건연계Future cryptanalysis threatens long-lived health data.What to watchMigration of health systems
- 식량연계Fertiliser catalysis is often cited as a target problem.What to watchClaims separated from results
Status reviews are designed for the 기하급수적 기술 시리즈, separating demonstrations from roadmaps. No date for a 암호학적으로 유의미한 양자 컴퓨터 의 시기를 알려진 것으로 제시하지 않습니다.
- Peer-reviewed results with classical comparisons.
- Corrections to over-stated claims.
How quantum computing is modelled, measured and tested.
모형, 그 가정, 데이터, 불확실성을 과학자나 엔지니어가 확인할 형태로 제시합니다. 구조는 발행된 방법을 따릅니다. 제시된 값은 예시이며 결과가 아닙니다.
시스템 모형
The couplings between the systems in quantum computing: signs of influence, a reinforcing and a balancing loop, and cross-links where stress jumps.
측정되는 것과 그 정확도.
각 지표에는 단위, 주기, 그 뒤의 출처 종류, 값에 붙을 근거 표시가 있습니다. 값은 표시하지 않습니다. 값은 프로그램이 자체 권한으로 제공합니다.
| 지표 | 단위 | 주기 | 출처 유형 | 라벨 |
|---|---|---|---|---|
| Physical qubit count | qubits | per announcement | Published device results | 보고됨 |
| Two-qubit gate fidelity | percent | per device | Benchmark results | 보고됨 |
| Logical qubit error rate | errors per logical operation | per experiment | Peer-reviewed experiments | 관측 |
| Coherence time | microseconds | per device | Device characterisation | 보고됨 |
| Quantum volume or similar holistic benchmark | benchmark score | per device | Published benchmarks | 보고됨 |
| Demonstrations surviving classical challenge | 건수 | 검토별 | Literature review | 추정 |
근거의 출처.
이름이 명시된 공개 데이터셋과 기관 기록으로, 각각 라이선스 등급이 있습니다. 협약에 따른 출처는 그 조건에 따라서만 사용하며 결코 재게시하지 않습니다.
| 출처 | 제공하는 것 | 라이선스 등급 |
|---|---|---|
| arXiv quant-ph and peer-reviewed journals | Primary experimental and theoretical results | Open access preprints; journal licence per article |
| Metriq benchmark platform (Unitary Foundation) | Community-submitted quantum benchmark results | Open, licence to check |
| Vendor technical documentation and roadmaps | Device specifications and stated targets | Public documents, terms per vendor |
| National academies and agency assessments of quantum computing | Independent assessments of progress and prospects | Public, terms per publisher |
| QED-C reports | Industry consortium analyses of use cases and benchmarks | Public reports, terms to check |
누가 결정하며 근거는 무엇에 쓰이는지.
Quantum Technologies prepares evidence. The decisions below are taken by the authorities named, under their own rules, and never by the platform.
| 결정 주체 | 질문 | 이 페이지가 제공하는 근거 |
|---|---|---|
| Research funders and science ministries | How much to invest in quantum computing research and access | Progress summaries; independent assessments |
| Organisations exploring quantum use | Whether a problem is a plausible quantum use case | Use case assessments with classical baselines |
| Security agencies | How progress affects cryptographic migration timelines | Error correction and scale evidence |
이 주제가 생산하는 산출물
- Progress summaries that separate peer-reviewed results from roadmaps
- Benchmark interpretation guides
- Use case assessments with classical baselines
- Evidence notes for research funders
전문가가 묻는 것.
The central question is what has been demonstrated, not what has been promised.
- How many qubits does a device have, and how good are they: what are their error rates and coherence times?
- Can errors be corrected faster than they accumulate, and at what cost in physical qubits per logical qubit?
- Which algorithms offer a demonstrated advantage over the best classical methods, and for which problems?
- Are claims of quantum advantage robust to improved classical algorithms?
- Which hardware approaches are likely to scale, and what limits them?
메커니즘과 동인.
Quantum computers gain their power from interference: algorithms are designed so that wrong answers cancel and right answers reinforce. That power is fragile. Qubits lose their quantum state through interaction with the environment, and every operation introduces some error. Quantum error correction encodes one reliable logical qubit in many physical qubits, but only works if physical error rates are below a threshold, and it multiplies the hardware required.
Known algorithms with large demonstrated speed-ups are few. Factoring and discrete logarithms, which underpin public-key cryptography, are the best-known examples; simulation of quantum 시스템 in chemistry and physics is another. For many optimisation and machine-learning problems, a practical advantage has not been established, and improved classical algorithms have repeatedly narrowed claimed gaps.
연구되는 방식과 방법의 한계.
| 방법 또는 데이터 | 표시 내용 | 한계 |
|---|---|---|
| Benchmarking of gate fidelity and coherence | Quality of physical qubits | Benchmarks can be chosen to flatter a device |
| Error-correction experiments | Whether logical qubits outperform physical ones | Early demonstrations are small and short-lived |
| Algorithm complexity analysis | Theoretical speed-up and resource estimates | Resource estimates depend on hardware assumptions |
| Classical simulation and verification | Whether results could be reproduced classically | Verification becomes harder as devices grow |
| Peer-reviewed literature versus announcements | What has been independently assessed | Announcements often precede, or replace, peer review |
Where this page’s references lead.
이 페이지를 읽을 때 기준이 되는 기구와 문서. 상태와 판은 바뀌며, 각 링크는 발행 기구로 연결됩니다.
질문과 답변.
큐비트란 무엇입니까?
What is quantum advantage?
What is fault-tolerant quantum computing?
Why does qubit count alone mislead?
Does the platform predict when large quantum computers will arrive?
이 페이지에서 증거를 기여하십시오.
보고서 is the Consortium’s quarterly publication. What you know about this subject can become evidence, a case or a correction in the next edition, credited to you and published under CC BY 4.0 where it is your own work.
- 이메일게이트웨이 GW-GCRI이 페이지에서 보내기증거, 정정, 사례, 방법, 검토, 번역 또는 프로필 입력 자료. 이 페이지의 태그가 붙어 도착하므로, 이를 담당하는 편집자가 받게 됩니다.
- Zenodo개방형 예치기탁하고 커뮤니티에 제출하기ORCID iD로 Zenodo에 직접 기록을 게시한 뒤, 그곳의 Reports 커뮤니티에 제출하십시오. 큐레이터가 검토하며, DOI는 귀하의 것으로 남습니다.
- 보고서GCRI모든 기여 방법 보기기여 유형, 각각의 검토 방식, 받게 되는 크레디트, 라이선스, 그리고 절대 받지 않는 것.
개인정보, 민감한 인프라 세부 정보, 공유할 권리가 없는 자료는 절대 보내지 마십시오. 기여물은 사용 전에 검토됩니다. 기여물을 보낸다고 해서 저작자 지위나 편집 권한이 부여되지 않으며, 후원으로 조사 결과를 얻을 수 없습니다.
방법, 데이터세트 또는 질문을 가져오십시오.
정보와 문의는 오늘부터 열려 있습니다. 문의에는 참조 번호가 부여되고 다음 단계가 안내됩니다. 신청, 결제, 컴퓨팅 할당, 등록은 해당 팀, 약관, 심사 역량이 갖추어졌을 때만 열립니다.
법률 문서.
이 사이트의 지도, 데이터와 그림은 맥락과 일반 정보로 제시됩니다. 조언, 예보 또는 경보가 아니며, 정보의 한계는 면책 고지와 데이터 고지에 나와 있습니다.