Skip to content
OpenContext

← All candidate problems

A candidate problem: accepted by the moderators, but not yet part of the published list.

Problem 4: Test problem: a sandbox for trying out the site

This is a test problem for trying out the site. Let ρ\rho be a qubit state and let {Ek}k=1n\{E_k\}_{k=1}^{n} be a POVM. Decide whether Trying whether a new version works

∑k=1nTr⁡ ⁣[Ek ρ]2  ≤  12(1+Tr⁡ρ2]\sum_{k=1}^{n} \operatorname{Tr}\!\left[E_k\,\rho\right]^2 \;\leq\; \frac{1}{2}\left(1 + \operatorname{Tr}\rho^2\right]

holds for every n≥2n \geq 2, and characterize the cases of equality.

Changing stuff

Status
under revision since 16 Nov 2026
Updated
17 Nov 2026
Posed by
Jan Bulling, 31 Oct 2026
Contributors
Jan, Rafael Wagner, Jan Bulling, Albert Einstein and 1 other · See all and what they did →

Background

This entry is a sandbox: comment on it, submit results and references, suggest edits, and change its status in the dashboard. Nothing here is a real research question. There are various ways in which the question is elementary. It exists so that every part of the site can be tried without touching the real problems. [] [2]

The bound in the statement is a toy example. For a projective measurement in an orthonormal basis {∣k⟩}\{\ket{k}\} the left-hand side is the collision probability of the outcome distribution pk=⟨k∣ρ∣k⟩p_k = \bra{k}\rho\ket{k}, and

∑kpk2≤Tr⁡ρ2\sum_k p_k^2 \leq \operatorname{Tr}\rho^2

follows from the fact that dephasing does not increase purity.

Relevance bdoifnwoifnwj neofjwepo fewpfm klwefnmlkwe

The text supports the usual markdown:

  • lists, like this one,
  • emphasis, bold text and inline code,
  • links, such as the KaTeX documentation.

A quotation, set off from the text.

Numbered steps work too:

  1. Open the problem in the dashboard.
  2. Change something and write a note under "What changed".
  3. Check the problem page and its history. [3]

Significance

None, beyond testing. Delete this problem in the dashboard (Problems → the row's menu → Delete) once it is no longer needed; that also deletes its comments, contributions and suggested edits. Significance is a key element.

TestSandboxPurity
Note

This is a test note. It can link to related problems, for example Problem 1 and Problem 2, or to external pages such as arXiv. It supports markdown and math like tr⁡(ρ2)≤1\operatorname{tr}(\rho^2) \le 1.

Permanent link:open-context.jan-bulling.com/contribution/4

References

  1. M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information, Cambridge University Press (2010)
  2. KaTeX: supported functions
  3. Ulmiverität

Progress and history

  1. 17 Nov 2026
    EditChanged something

    Version 4 by the editors

  2. 17 Nov 2026
    EditReverted a previous change

    Version 3 by the editors

  3. 17 Nov 2026
    EditMinor change
  4. 16 Nov 2026
    Under revisionStatus changed to under revision.
  5. 16 Nov 2026
    StatusI test out a status change
  6. 16 Nov 2026
    ReopenedStatus changed to open.
  7. 16 Nov 2026
    EditI added a few things!

    Version 2 by Jan

  8. 5 Nov 2026
    PosedDecomposition into further problems: Testing citations

    OpenContext 4.3 by Jan · no AI assistance

Contributions

  1. DecompositionOpenContext 4.35 Nov 2026
    0
    0 comments

    Testing citations

    by Jan · no AI assistance

    I want to cite [] for now.

  2. Partial resultOpenContext 4.22 Nov 2026
    0
    0 comments

    A possible way forward toward the resolution of this problem: POVMs at their core

    by Rafael Wagner · partially AI-assisted

    POVMs are incredible tools and it turns out that they satisfy several important features which are quite relevant for the resolution of that problem.

    Two key aspects is that POVMs must satisfy that its elements are

    i) Positive: For a given POVM M={Ei}iM=\{E_i\}_i one must have that Ei≥0E_i \geq 0 for all ii.

    ii) Resolution of the identity: ∑iEi=1\sum_i E_i = \mathbf{1}, with 1\mathbf{1} the identity.

    With that, I believe one can approach rather easily the problem's bound.

  3. Reference

    Ulmiversität

    Suggested by Jan Bulling · 31 Oct 2026 · Why it is relevant ▾

    This is the most important webside ever!!!!

  4. EvidenceOpenContext 4.131 Oct 2026
    0
    0 comments

    I did the simulation on my computer

    by Jan Bulling, Albert Einstein, Roger Penrose · no AI assistance

    It works! I think the problem is solved! (At least numerically)

    <>
      <List className={className}>{items.slice(0, shown)}</List>
      {items.length > limit && (
        <p className="mt-2.5 flex justify-center gap-4 text-[0.92rem]">
          {hidden > 0 && (
            <button type="button" onClick={() => setShown((s) => s + limit)} className="cursor-pointer text-brand hover:underline">
              Show {next === hidden && hidden > 0 ? `the remaining ${hidden}` : `${next} more`} {next === 1 ? noun[0] : noun[1]}
            </button>
            
          )}
          {shown > limit && (
            <button type="button" onClick={() => setShown(limit)} className="cursor-pointer text-ink-subtle hover:text-ink hover:underline">
              Show fewer
            </button>
          )}
        </p>
      )}
    </>
    

    ); }

All 4 contributions →

Contribute to this problem

You need to be signed in. Every contribution is reviewed by a moderator before it appears, and is credited to the people you name.

Discussion

Sign in to join the discussion.

  • Jan · 5 Nov 2026

    Hello, i want to cite [2] and []

  • Rafael Wagner · 2 Nov 2026

    Interesting way that the contributions are shown.

  • Jan Bulling · 1 Nov 2026

    I want to write a comment to test how it worked!

  • Jan · 31 Oct 2026

    Having a few comments for testing, also using inline 2+22=62+2^2=6 and big

    ∫dx log⁡(x)=xlog⁡(x)+x\int\mathrm{d}x\, \log(x) = x\log(x) + x

    Latex