|Welcome to the Quantum Information Science Wikipedia project! Some tips and resources for creating and editing wikipedia articles:|
A brief tutorial can be found at https://en.wikipedia.org/wiki/Wikipedia:Tutorial
A cheatsheet: https://en.wikipedia.org/wiki/Wikipedia:Cheatsheet
You can learn some experiences of successful submissions from https://en.wikipedia.org/wiki/Template:AFC_statistics
You are also highly welcome to be a reviewer so that you can accept/deny freshly baked articles listed below to be created. Just follow this guideline: https://en.wikipedia.org/wiki/Wikipedia:Reviewing
All shared information here will be eventually posted on the open-source projects website at http://iciq.github.io/ . So, shine up your contributions and creativity!
|Name or page name (can be anonymous)||Any contact/personal website information you want to share (will posted on http://i2000s.github.io/QI)||Wikipedia topic to edit||Links||Abstract or Proposal||Main references||Progress and Self-comment||Community Comments from everyone||Future work|
|Linear Optical Quantum Computing||https://en.wikipedia.org/wiki/Linear_Optical_Quantum_Computing||I would like to propose to write a wikipedia page on linear optics quantum computation. I am planning to cover the implementations on controlled-NOT gates, Pauli-X gate, Pauli-Z gate, Hadamard gate, phase-shift gates, SWAP gate and Tooli gate. I may also cover the implementations of entangled multiphoton state using optical circuits, entanglement purication and distillation. A brief description on integrating linear optical elements into integrated circuits as the inevitable eort to solve the scalability problem will be given.||Kok, P.; Munro, W. J.; Nemoto, K.; Ralph, T. C.; Dowling, J. P. & Milburn, G. J. "Linear optical quantum computing with photonic qubits", Rev. Mod. Phys., American Physical Society, 2007, 79, 135-174||Posted online.|
More details from the references. Polish figures.
|Quantum Linear Optical Circuits (Complexity)||https://en.wikipedia.org/wiki/User:AKChapman/sandbox||Linear optical circuits are among the most technologically realistic models of quantum computation to-date. Because such circuits consist only of beamsplitters and phase shifters, they cannot induce interactions between photons, and are thus not believed to be universal even for classical computation. However, the question of whether or not these circuits can be classically simulated efficiently remains open. The model lends itself naturally to certain classes of counting problems, such as additive approximation of permanents of complex matrices, which are not believed to be classically solvable in polynomial time. Furthermore, the existence of an efficient classical algorithm that samples from the same probability distribution as the output of a quantum linear optical network, even noisily, would imply a collapse of the polynomial hierarchy. Such results have had far-reaching consequences for our pictures of quantum and classical complexity theory, and have led to proofs of new theorems as well as more natural interpretations of well-known results in both fields. In what follows, we detail the essence of such theorems and their proofs and present several as-yet unanswered questions.|
Good job! Now, you can copy your content and make a subpage of LOQC page...
|Jonathan Grossfirstname.lastname@example.org||Quantum stochastic calculus||https://en.wikipedia.org/wiki/Quantum_stochastic_calculus||I would like to draw attention to the generalization of stochastic calculus to non-commuting observables and the application of these equations to problems in quantum optics.||Good article!|