Problems

No problem here has yet been reviewed by a person.

1–3 of 3 problems

Four-Particle Monochromatic Quantum Graphs2017
For four particles and local dimension D ≥ 4, can a complete edge-coloured, complex-weighted graph have unit perfect-matching amplitude for every monochromatic inherited colouring and zero for every nonmonochromatic one? Ruled out for the…
Quantum information & computing partial
1 attempt · 1 machine check
Monochromatic Quantum Graphs in the Diagonal Family2017
Can a complete edge-coloured, complex-weighted graph realize perfect-matching amplitudes of one on every monochromatic inherited vertex colouring and zero otherwise? Nonexistence is proved in the diagonal family N = D for every even N ≥ 4,…
Quantum information & computing partial
1 attempt · 1 machine check
Finite-Copy Distillability of NPT States in the DiVincenzo FamilyDavid P. DiVincenzo, Peter W. Shor, John A. Smolin, Barbara M. Terhal, Ashish V. Thapliyal, 2000
Whether negative-partial-transpose states undistillable from one copy become distillable from finitely many copies is a basic open problem in entanglement theory. In the canonical two-parameter DiVincenzo family used as its…
Quantum information & computing partial
1 attempt