arXiv:1105.3238

Conjectures and questions in convex geometry (of interest for quantum theory and other physical statistical theories)

PierGianLuca Porta Mana

Published May 16, 2011• 2 citations

Abstract

Some conjectures and open problems in convex geometry are presented, and their physical origin, meaning, and importance for quantum theory and generic statistical theories are briefly discussed.

DOI: 10.48550/arxiv.1105.3238

Related papers

The additivity conjecture in quantum information theory

Peter W. Shor

In this paper, I discuss the additivity conjecture in quantum information theory.The additivity conjecture was originally a set of at least four conjectures.These conjectures said that certain functions of quantum states and channels were additive under tensor products.While some of these conjectures were previously known to be stronger than others, they have recently all been proved equivalent.This conjecture is a very intriguing mathematical question which the best efforts of a large number of quantum information theorists have not been able to resolve for nearly a decade.It is a mathematically elegant question that is one of the most important open questions in the field of quantum information and computation.This paper then is intended to be both an exposition of the conjecture, its background, and some of the methods that have been used to yield partial results for it, as well as a plea for help in resolving this conjecture.Very recently (summer 2007), substantial progress has been made on this conjecture, in that counterexamples to a set of stronger conjectures have been found.These will be described briefly.

Current Developments in MathematicsJan 1, 200519 citations

ON THE GEOMETRY OF QUANTUM MECHANICS

Elisa Ercolessi, Giuseppe Morandi

We will present a short review of some work we have done in the last ten years with Giuseppe Marmo, on the attempt to formulate some interesting physical problems — such as the Quantum Inverse Problem, Alternative Structures and Berry Phase — in a geometrical setting.

International Journal of Geometric Methods in Modern PhysicsMar 1, 20122 citations

NISQ Hardness and Convex Relaxations: Random Max-CSPs and Mean-Field Spin Glasses

Sandhu, Juspreet Singh

The Unique-Games Conjecture (UGC)~\cite{khot2002power} is a central open-question in theoretical computer science. If true, it implies optimal inapproximability results for \emph{every} Max-CSP. Despite impressive recent progress towards the conjecture~\cite{khot2017independent, barak2018small, subhash2018pseudorandom, dinur2018non, dinur2018towards} there are no candidate instances for \emph{every} Max-CSP that would saturate the integrality gap of Raghavendra's ``UGC-optimal'' Semi-Definite Program (SDP)~\cite{raghavendra2008optimal}. In parallel, though it is known that reducing the factoring problem into Max-3-SAT can yield an efficient quantum algorithm for approximating conjectured classically hard Max-CSP instances~\cite{szegedy2022quantum}, no ``natural'' family of Max-CSP instances are known to give quantum advantage. Furthermore, it is an open-question whether efficient quantum algorithms can approximate Max-CSPs better than classical polynomial time algorithms on instances that saturate the integrality gap of Raghavendra's SDP~\cite{szegedy2022quantum}. A natural complementary starting point, therefore, is to investigate the complexity landscape of \emph{random} instances of \emph{sparse} Max-CSPs. \\ \vspace{2mm} In this thesis, we make further progress in understanding the complexity landscape of such Max-CSPs. We prove that \emph{random} instances of \emph{all} Max-CSPs exhibit solution-space geometries akin to those of objects from statistical physics called \emph{mean-field spin glasses}~\cite{jones2022random}. As a consequence of this connection, the optimal number of clauses satisfied by typical instances of such Max-CSPs can be expressed as a function of the \emph{ground state energy density} of the related mean-field spin glass. Complementing this connection, we prove that certain solution-space geometries, called \emph{overlap-gap properties}~\cite{gamarnik2021overlap2}, continue to obstruct larger families of algorithms such as \emph{local quantum algorithms} and \emph{overlap-concentrated algorithms} on typical instances of such Max-CSPs~\cite{chou2022limitations, sandhu2023lowdegree}. We provide the exact approximation ratio at which the obstruction occurs, using a result of Huang and Sellke~\cite{huang2021tight}. In the absence of overlap-gap properties, we give unifying sum-of-squares (SoS) relaxations using novel maximum-entropy constraints for optimizing mean-field spin glasses on the sphere that match the conjectured optimal value achievable by any efficient algorithm~\cite{dorsi2022sumofsquares}. This relaxation can \emph{certify} the correct energy of the instances (with high probability) in the \emph{full-Replica Symmetry Breaking} regime, providing an efficient algorithmic proof of the Parisi formula on the sphere in this regime. In doing so, we circumvent prior certification lower-bounds against the standard SoS hierarchy on these problems~\cite{bhattiprolu2016sum} and provide a proof template to obtain low-degree SoS certificates for the spectral statistics of certain random matrices under the appropriate entropy constraints. \\ Our work adds to the growing body of recent results linking variants of the overlap-gap property to algorithmic hardness for increasingly powerful families of algorithms. Additionally, our work gives explicit negative results for quantum advantage on random optimization problems using NISQ algorithms and ports over various statistical physics concepts into the sum-of-squares framework, yielding further fine-grained understanding of the complexity landscape of typical instances of sparse Max-CSPs.

Jan 1, 20230 citations

Remarks on geometry and the quantum potential

Robert Carroll

We gather material from many sources about the quantum potential and its geometric nature. The presentation is primarily expository but some new observations relating Q, V, and psi are indicated.

arXiv:math-ph/0701007Jan 3, 20075 citations

Is There a Jordan Geometry Underlying Quantum Physics?

Wolfgang Bertram

arXiv:0801.3069International Journal of Theoretical PhysicsApr 4, 200812 citations

Han's Structure-Induced Quantum Blindness Conjecture

Han Bo Jun

This upload contains the full preprint "Han's Structure-Induced Quantum Blindness Conjecture (Han-SIQB)" (version v6), a technical report from the Mnemosyne research project. The paper formally introduces and systematically studies Han's Structure-Induced Quantum Blindness Conjecture (Han-SIQB), a central open problem in product quantization security theory. The core statement of the conjecture is that, for any product quantization codebook C trained by k-means or LBG and a publicly known Soft-ZCA whitening transformation W, the composite function PQ_C composed with W admits no quantum algorithm that achieves a search speedup beyond Grover's algorithm (that is, no acceleration factor alpha_Q greater than 2). The conjecture currently lacks a complete proof and is positioned as a structural working hypothesis supported by the convergence of multiple independent lines of evidence from quantum query complexity, computational geometry, statistical physics, cryptography, and neuroscience. The work organizes the conjecture into five concrete sub-obligations (exclusion of known quantum paradigms, statistical structure testing, reduction to known hard problems, formal reduction of quantum mode-finding to unstructured search, and experimental verification of near-uniform conditional entropy), honestly assesses the formalization level of each piece of supporting evidence, and identifies the critical open problems on the path to a full proof. For the Mnemosyne post-quantum distributed computing architecture, Han-SIQB constitutes the sole remaining condition required to fully close its dual physical security barriers (Landauer thermodynamic bound and Margolus-Levitin operation-count bound) in the time dimension, potentially enabling a security system grounded solely in physical laws rather than mathematical hardness assumptions. The paper also provides a detailed epistemological positioning of the conjecture, discusses historical precedents, and explicitly outlines fallback mechanisms (hybrid post-quantum cryptography mode) should the conjecture eventually be falsified. It invites collaboration from the quantum query complexity, algebraic geometry, and machine learning theory communities to advance its formalization or disproof. This upload includes the complete manuscript with all appendices, tables, and references. Keywords: product quantization, quantum blindness, structural conjecture, post-quantum security, Grover lower bound, whitening transformation, physical security, Mnemosyne

Apr 9, 20260 citations