Wikipedia:WikiProject Physics/Taskforces/Quantum
| WikiProject Physics Main / Talk |
Members | Quality Control (talk) |
Welcome | ||
WikiProject Physics: Quantum Taskforce
WikiProject Physics' Quantum Taskforce works on improving the quality, coverage, and presentation of articles (and categories) within the field of Quantum information science.
Our activities include, but are not limited to: improving articles, assessing their quality, creating new ones, identifying articles as quantum articles, merging or cleaning-up overlapping articles, and organizing them all into categories. For doing so, this task force applies the methodology and tools provided by the WikiProject Physics.
Active members
- Vtomole (talk · contribs)- Computer Engineer
- Flappy Pigeon (talk · contribs) - I know about subatomic particles, neutron stars, black holes, wormholes, infinity, parallel universes, and space travel.
- StarTigerJLN (talk · contribs)- MS physics, self-proclaimed quantum mechanic, philosopher of physics & quantum computing
- A40585 (talk · contribs)- I like (quantum) crypto, I studied CS and Math in college.
Articles to create
- Mahadev's protocol: https://arxiv.org/abs/1804.01082
- Self testing: https://arxiv.org/abs/1904.10042
- GKP (quantum computation): https://arxiv.org/abs/quant-ph/0008040
- MIP*=RE: https://arxiv.org/abs/2001.04383
- NISQ: https://arxiv.org/abs/1801.00862
- Span programs: https://arxiv.org/abs/2005.01323
- Heisenberg-Weyl gates: https://arxiv.org/abs/1808.02406
- Clifford hierarchy: https://arxiv.org/abs/1608.06596
- Non-local games
- Quantum LDPC Codes: https://arxiv.org/abs/2103.06309
- XZZX Surface Code: https://arxiv.org/abs/2009.07851
- The Quantum Marginal Problem: https://arxiv.org/abs/1404.1085
Categories
Top Priorities
- Quantum mechanics
- Quantum computing
- Quantum logic gate
- Quantum entanglement
- EPR paradox
- Quantum supremacy
- Clifford gates
- Density matrix
- Gottesman–Knill theorem
- Shor's algorithm
- Grover's algorithm
- Quantum Turing machine
- Quantum programming
- Quantum machine learning
Articles that need major improvements
- Quantum information science
- Quantum game theory
- Quantum refereed game
- Stabilizer code
- Quantum walk
- Quantum optimization algorithms
- One-way quantum computer
Articles that need minor improvements
- Adiabatic quantum computation: A recent proof by Matt Hastings shows a superpolynomial oracle separation between the power of adiabatic quantum computation with no sign problem and the power of classical computation (https://arxiv.org/abs/2005.03791). Add this to the article.
Open Problems
- What's the full structure of the Clifford hierarchy? https://arxiv.org/abs/1608.06596
Content Disclaimer
Informasi ini disarikan dari Wikipedia dan disajikan kembali untuk tujuan edukasi. Konten tersedia di bawah lisensi CC BY-SA 3.0. Kami tidak bertanggung jawab atas ketidakakuratan data yang bersumber dari kontribusi publik tersebut.
- The information displayed on this website is sourced in part or in whole from Wikipedia and has been adapted for the purpose of restating it. We strive to provide accurate and relevant information, however:
- There is no guarantee of absolute accuracy. Wikipedia is an open, collaborative project that can be edited by anyone, so information is subject to change.
- It is not intended to constitute professional advice. The content displayed is for informational and educational purposes only. For important decisions (e.g., medical, legal, or financial), please consult a professional.
- Content copyright. Wikipedia is licensed under the Creative Commons Attribution-ShareAlike License (CC BY-SA). This means that content may be reused with appropriate attribution and shared under a similar license.
- Responsible use. Any risk arising from the use of information from this website is entirely the responsibility of the user.