Those are not your problems only: they are our problems, too. Share them with the community and help quantum information science grow!
Since 2017, the Institute for Quantum Optics and Quantum Information (IQOQI) in Vienna, together with Reinhard Werner, has been maintaining and updating his original list of Open Problems in Quantum Information.
We look for specific questions of general interest, such as:
“Devise an algorithm to decide if a bipartite POVM can be approximately realized via LOCC operations”
“Find an example of bipartite bound information”
We do not consider questions which are:
- Too vague/unrealistic. E.g.: “Derive all quantum algorithms”.
- Too narrow. E.g: “Find a proof of multiplicativity for the two-Pauli qubit channel which does not use unitary equivalence to channels with negative multipliers.”
- Completely crazy. E.g.:“Can I use Bell’s theorem to reanimate the dead?”
If you believe that your problem qualifies, please contact Miguel Navascués to send a clear formulation, together with a couple of paragraphs motivating the question.