---
source: 'OpenContext: Open problems in generalized contextuality'
url: 'https://open-context.jan-bulling.com/problems/test-problem'
number: 4
title: 'Test problem: a sandbox for trying out the site'
status: under-revision
statusSince: '2026-11-16'
published: false
posedBy:
  - Jan Bulling
posed: '2026-10-31'
updated: '2026-11-17'
agenda:
  - classicality
  - applications
tags:
  - Test
  - Sandbox
  - Purity
contributions: 4
comments: 4
license: 'CC BY 4.0, unless the entry says otherwise'
---

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

From [OpenContext: Open problems in generalized contextuality](https://open-context.jan-bulling.com/problems/test-problem).

- **Status:** under revision since 16 Nov 2026
- **Posed by:** Jan Bulling, 31 Oct 2026
- **Last updated:** 17 Nov 2026
- **Candidate problem:** accepted by the moderators, but not yet part of the published list.
- **Research agenda:** I. Reconceptualization of classicality; III. Useful applications
- **Tags:** Test, Sandbox, Purity

## Statement

This is a **test problem** for trying out the site. Let $\rho$ be a qubit state and let $\{E_k\}_{k=1}^{n}$ be a POVM. Decide whether Trying whether a new version works
$$
\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 \geq 2$, and characterize the cases of equality.

Changing stuff

## 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. [1] [2]

The bound in the statement is a toy example. For a projective measurement in an orthonormal basis $\{\ket{k}\}$ the left-hand side is the *collision probability* of the outcome distribution $p_k = \bra{k}\rho\ket{k}$, and
$$
\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](https://katex.org/docs/supported.html).

> 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.

## Note

This is a test note. It can link to related problems, for example [Problem 1](/problems/the-wigner-entropy-bound) and [Problem 2](/problems/noncontextual-switch), or to external pages such as [arXiv](https://arxiv.org). It supports **markdown** and math like $\operatorname{tr}(\rho^2) \le 1$.

## Research agenda

The long-term goals of the research agenda that this problem traces to.

### I. Reconceptualization of classicality

Determine whether generalized noncontextuality captures the appropriate boundary between classical and nonclassical explanation, the thesis being that it offers a broad, formal, and meaningful framework for what it means for a process in Nature to be “classical”.

### III. Useful applications

Make the failure of classicality, as captured by generalized noncontextuality, a certified and quantified resource, witnessed in experiments and tied to the advantages that quantum devices offer.

## References

1. M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information, Cambridge University Press (2010)
2. [KaTeX: supported functions](https://katex.org/docs/supported.html)
3. [Ulmiverität](https://ulmiversitaet.de)

## Progress and history

- 31 Oct 2026, Posed: Added as a test problem for trying out the site.
- 31 Oct 2026, Advance: The case $n = 2$ with a projective measurement follows from $\sum_k p_k^2 \leq \operatorname{Tr}\rho^2$.
- 31 Oct 2026, Note: A note, to show how notes look in the history.
- 31 Oct 2026, Advance: Computational evidence: I did the simulation on my computer ([OpenContext 4.1](https://open-context.jan-bulling.com/contribution/4.1), by Jan Bulling, Albert Einstein, Roger Penrose)
- 1 Nov 2026, Status: under revision: Status changed to under revision.
- 2 Nov 2026, Note: Improvements on the background and significance sections of the question
- 2 Nov 2026, Advance: Partial result: A possible way forward toward the resolution of this problem: POVMs at their core ([OpenContext 4.2](https://open-context.jan-bulling.com/contribution/4.2), by Rafael Wagner)
- 5 Nov 2026, Posed: Decomposition into further problems: Testing citations ([OpenContext 4.3](https://open-context.jan-bulling.com/contribution/4.3), by Jan)
- 16 Nov 2026, Edit: I added a few things! ([version 2](https://open-context.jan-bulling.com/contribution/4v2), by Jan)
- 16 Nov 2026, Status: open: Status changed to open.
- 16 Nov 2026, Status: I test out a status change
- 16 Nov 2026, Status: under revision: Status changed to under revision.
- 17 Nov 2026, Edit: Minor change
- 17 Nov 2026, Edit: Reverted a previous change ([version 3](https://open-context.jan-bulling.com/contribution/4v3), by the editors)
- 17 Nov 2026, Edit: Changed something ([version 4](https://open-context.jan-bulling.com/contribution/4v4), by the editors)

## Contributors

Everyone who posed or proposed the problem, edited its text, or added a result or reference, in the order they first contributed.

- **Jan Bulling:** Posed the problem; Computational evidence: I did the simulation on my computer (4.1); Suggested a reference: Ulmiversität
- **Albert Einstein:** Computational evidence: I did the simulation on my computer (4.1)
- **Roger Penrose:** Computational evidence: I did the simulation on my computer (4.1)
- **Rafael Wagner:** Partial result: A possible way forward toward the resolution of this problem: POVMs at their core (4.2)
- **Jan:** Decomposition into further problems: Testing citations (4.3); Edited the text: version 2 (4v2), I added a few things!

## Contributions

Material submitted by researchers and approved by the moderators, oldest first.

### 1. Computational evidence: I did the simulation on my computer

- **Date:** 31 Oct 2026
- **Credit:** Jan Bulling, Albert Einstein, Roger Penrose
- **AI use:** no AI assistance
- **Permanent link:** https://open-context.jan-bulling.com/contribution/4.1
- **Votes:** 0 (0 up, 0 down)

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>
      )}
    </>
  );
}

### 2. Relevant reference: Ulmiversität

- **Date:** 31 Oct 2026
- **Credit:** Jan Bulling
- **AI use:** no AI assistance
- **Link:** https://ulmiversitaet.de

This is the most important webside ever!!!!

### 3. Partial result: A possible way forward toward the resolution of this problem: POVMs at their core

- **Date:** 2 Nov 2026
- **Credit:** Rafael Wagner
- **AI use:** partially AI-assisted
- **Permanent link:** https://open-context.jan-bulling.com/contribution/4.2
- **Votes:** 0 (0 up, 0 down)

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=\{E_i\}_i$ one must have that $E_i \geq 0$ for all $i$.

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

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

### 4. Decomposition into further problems: Testing citations

- **Date:** 5 Nov 2026
- **Credit:** Jan
- **AI use:** no AI assistance
- **Permanent link:** https://open-context.jan-bulling.com/contribution/4.3
- **Votes:** 0 (0 up, 0 down)

I want to cite [1] for now.

## Discussion

Comments approved by the moderators, oldest first, each followed by its replies.

### Jan, 31 Oct 2026

Having a few comments for testing, also using inline $2+2^2=6$ and big
$$
\int\mathrm{d}x\, \log(x) = x\log(x) + x
$$
Latex

### Jan Bulling, 1 Nov 2026

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

### Rafael Wagner, 2 Nov 2026

Interesting way that the contributions are shown.

### Jan, 5 Nov 2026

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

## How to cite

```bibtex
@misc{opencontext-problem-4,
  author        = {Jan Bulling},
  title         = {{Test problem: a sandbox for trying out the site}},
  howpublished  = {OpenContext: Open problems in generalized contextuality, Problem 4, version 4},
  year          = {2026},
  month         = oct,
  date          = {2026-10-31},
  url           = {https://open-context.jan-bulling.com/contribution/4},
  urldate       = {2026-11-20},
  note          = {Problem posed 31 October 2026; status: under revision, last updated 17 November 2026}
}
```

## Working on this problem

- A solution must resolve the problem **as stated**, by the criterion fixed in the statement. A proof of a weakened or modified statement is a partial result, not a solution.
- Check the contributions above before starting, so as not to repeat existing work.
- Submit results at https://open-context.jan-bulling.com/problems/test-problem, with the extent of AI use and the names of the humans who take responsibility for them. AI-generated material counts as progress only after human scrutiny.
- Cite the problem and the people who posed it. The full rules: https://open-context.jan-bulling.com/guidelines
