Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Physics Letters A

A counterexample to the paramagnetic conjecture

J. E. Avron, Barry Simon

Published Dec 1, 1979• 16 citations
Publisher
DOI
10.1016/0375-9601(79)90270-6

Related papers

Quantization of counterexamples to Dirac’s conjecture

Mauricio Valenzuela

arXiv:2306.03080•The European Physical Journal Plus•Oct 23, 2023•4 citations

A Counterexample to the Optimality Conjecture in Convex Quantum Channel Optimization

Jianting Yang

This paper presents a counterexample to the optimality conjecture for the trace distance based optimal state transformation problem proposed by Coutts et al. [Quantum 5, 448 (2021)]. The conjecture posits that for the trace distance based optimal state transformation problem, applying the sign function to the error matrix uniquely determines a dual certificate for every optimal solution. By constructing a counterexample in 2-dimensional Hilbert spaces, we disprove this conjecture.

quant-pharXiv:2512.22863•Quantum•Dec 30, 2025•0 citations

An interesting consequence of the Heisenberg construction

B. Sury

Elemente der Mathematik•Dec 31, 2008•1 citation

A counterexample to the quantum Hedetniemi conjecture

Julius A. Zeiss

Godsil, Roberson, Šámal and Severini conjectured that the quantum chromatic number of the categorical product of two graphs equals the minimum of the quantum chromatic numbers of the factors. We disprove this conjecture: we construct explicit finite graphs $G,H$ with \[ χ(G\times H) \leq 1538 < 1539 = \min(χ_q(G),χ_q(H)).\]The graphs are obtained from Zhu's counterexample to Hedetniemi's conjecture by using a base graph for which the Lovász theta number of the complement, and not only the fractional chromatic number, is large. The lower bound for the first factor is the theta bound. For the second factor we adapt Zhu's argument to projections that do not commute: the step that fixes the colors of a clique is replaced by identities between operators. Both lower bounds hold for colorings by projections in an arbitrary nonzero unital $C^*$-algebra. Hence the conjecture also fails for the spatial, approximate, commuting-operator and $C^*$-algebraic variants of the quantum chromatic number. We also give smaller counterexamples certified by exact integer data. The graph constructions, the certificates and the counterexample statements in the projective formulation are formalized in Lean~4.

math.COCross-listedarXiv:2609.20690•Sep 18, 2026•1 citation

Refutation of the Conjecture for Heisenberg's Principle

Colin James

•Aug 1, 2018•0 citations

Counterexamples to Kalai's conjecture C

Steven T. Flammia, Aram W. Harrow

We provide two simple counterexamples to Kalai's Conjecture C and discuss our perspective on the implications for the prospect of large-scale fault-tolerant quantum computation.

Quantum Information and Computation•Jan 1, 2013•1 citation
Godsil, Roberson, Šámal and Severini conjectured that the quantum chromatic number of the categorical product of two graphs equals the minimum of the quantum chromatic numbers of the factors. We disprove this conjecture: we construct explicit finite graphs G,HG,HG,H with χ(G×H)≤1538<1539=min⁡(χq(G),χq(H)). χ(G\times H) \leq 1538 < 1539 = \min(χ_q(G),χ_q(H)).χ(G×H)≤1538<1539=min(χq​(G),χq​(H)).The graphs are obtained from Zhu's counterexample to Hedetniemi's conjecture by using a base graph for which the Lovász theta number of the complement, and not only the fractional chromatic number, is large. The lower bound for the first factor is the theta bound. For the second factor we adapt Zhu's argument to projections that do not commute: the step that fixes the colors of a clique is replaced by identities between operators. Both lower bounds hold for colorings by projections in an arbitrary nonzero unital C∗C^*C∗-algebra. Hence the conjecture also fails for the spatial, approximate, commuting-operator and C∗C^*C∗-algebraic variants of the quantum chromatic number. We also give smaller counterexamples certified by exact integer data. The graph constructions, the certificates and the counterexample statements in the projective formulation are formalized in Lean~4.