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

arXiv:1405.1700

Comment on Consensus formation on a simplicial complex of opinions (arXiv:1212.1940, Physica A, Vol. 397 (1), pp. 111-120, 2014)

Vesna Berec

Published May 7, 2014• 0 citations
arXivHTMLPDF

Abstract

In the commented paper, the authors declare an analogy with the quantum mechanical pure states established through the application of the high-dimensional combinatorial Laplacian considering that the simplicial complex is in the pure state when it is formed by collection of the pure states. In their work, besides giving a completely erroneous analogy for the pure quantum mechanical state, which contradicts to very basic postulates of quantum mechanic, the authors clearly fail to provide and explain mathematical formalism behind their claims. Their intention is to rigorously prove that the existence of opinion space in all considered cases consists of the pure quantum states using incorrect normalization constant which does not produce trace equal to one. In this comment we prove out that their claims are erroneous. In order to show incorrectness of Maletic & Rajkovic model and conclusions we calculated and examined connections between different combinatorial structures of q- dimensional simplicial complexes and their Laplacian spectra and analyzed resulting symmetric and positive semidefinite matrices in the context of the density matrix of a quantum mechanical system. Importance of presented research is to further develop accurate quantitative topological-based characterization method for convertibility and distillation of density matrix.

DOI
10.48550/arxiv.1405.1700

Related papers

Geometry of Quantum States from Symmetric Informationally Complete Probabilities

Gelo Noel M. Tabia

It is usually taken for granted that the natural mathematical framework for quantum mechanics is the theory of Hilbert spaces, where pure states of a quantum system correspond to complex vectors of unit length. These vectors can be combined to create more general states expressed in terms of positive semidefinite matrices of unit trace called density operators. A density operator tells us everything we know about a quantum system. In particular, it specifies a unique probability for any measurement outcome. Thus, to fully appreciate quantum mechanics as a statistical model for physical phenomena, it is necessary to understand the basic properties of its set of states. Studying the convex geometry of quantum states provides important clues as to why the theory is expressed most naturally in terms of complex amplitudes. At the very least, it gives us a new perspective into thinking about structure of quantum mechanics. \n \n \nThis thesis is concerned with the structure of quantum state space obtained from the geometry of the convex set of probability distributions for a special class of measurements called symmetric informationally complete (SIC) measurements. In this context, quantum mechanics is seen as a particular restriction of a regular simplex, where the state space is postulated to carry a symmetric set of states called SICs, which are associated with equiangular lines in a complex vector space. The analysis applies specifically to 3-dimensional quantum systems or qutrits, which is the simplest nontrivial case to consider according to Gleason's theorem. It includes a full characterization of qutrit SICs and includes specific proposals for implementing them using linear optics. The infinitely many qutrit SICs are classified into inequivalent families according to the Clifford group, where equivalence is defined by geometrically invariant numbers called triple products. The multiplication of SIC projectors is also used to define structure coefficients, which are convenient for elucidating some additional structure possessed by SICs, such as the Lie algebra associated with the operator basis defined by SICs, and a linear dependency structure inherited from the Weyl-Heisenberg symmetry. After describing the general one-to-one correspondence between density operators and SIC probabilities, many interesting features of the set of qutrits are described, including an elegant formula for its pure states, which reveals a permutation symmetry related to the structure of a finite affine plane, the exact rotational equivalence of different SIC probability spaces, the shape of qutrit state space defined by the radial distance of the boundary from the maximally mixed state, and a comparison of the 2-dimensional cross-sections of SIC probabilities to known results. Towards the end, the representation of quantum states in terms of SICs is used to develop a method for reconstructing quantum theory from the postulate of maximal consistency, and a procedure for building up qutrit state space from a finite set of points corresponding to a Hesse configuration in Hilbert space is sketched briefly.

•Aug 6, 2013•3 citations

Condition for zero and nonzero discord in graph Laplacian quantum states

Supriyo Dutta, Bibhas Adhikari, Subhashish Banerjee

This work is at the interface of graph theory and quantum mechanics. Quantum correlations epitomize the usefulness of quantum mechanics. Quantum discord is an interesting facet of bipartite quantum correlations. Earlier, it was shown that every combinatorial graph corresponds to quantum states whose characteristics are reflected in the structure of the underlined graph. A number of combinatorial relations between quantum discord and simple graphs were studied. To extend the scope of these studies, we need to generalize the earlier concepts applicable to simple graphs to weighted graphs, corresponding to a diverse class of quantum states. To this effect, we determine the class of quantum states whose density matrix representation can be derived from graph Laplacian matrices associated with a weighted directed graph and call them graph Laplacian quantum states. We find the graph theoretic conditions for zero and nonzero quantum discord for these states. We apply these results on some important pure two qubit states, as well as a number of mixed quantum states, such as the Werner, Isotropic, and [Formula: see text]-states. We also consider graph Laplacian states corresponding to simple graphs as a special case.

arXiv:1705.00808•International Journal of Quantum Information•Mar 1, 2019•7 citations

Reply to Comment on "Quantification of Macroscopic Quantum Superpositions within Phase Space"

Hyunseok Jeong, Minsu Kang, Chang-Woo Lee

Gong points out [quant-ph arXiv:1106.0062] a "direct connection" between our measure [PRL 106, 220401 (2011)] recently proposed to quantify macroscopic quantum superpositions and a previously studied quantity introduced to study classical and quantum chaos. We point out that the two measures are obviously different for some mixed states, and the previous one does not work as a sensible measure to quantify quantum superpositions.

arXiv:1108.0212•Aug 1, 2011•9 citations

Gapped Clique Homology on Weighted Graphs Is \({\text{QMA}_1}\)-Hard and Contained in QMA

Robbie King, Tamara Kohler

Abstract. We study the complexity of a classic problem in computational topology, the homology problem: given a description of some space [Formula: see text] and an integer [Formula: see text], decide if [Formula: see text] contains a [Formula: see text]-dimensional hole. The setting and statement of the homology problem are completely classical, yet we find that the complexity is characterized by quantum complexity classes. Our result can be seen as an aspect of a connection between homology and supersymmetric quantum mechanics established by Witten (1982). We consider clique complexes, motivated by the practical application of topological data analysis (TDA). The clique complex of a graph is the simplicial complex formed by declaring every [Formula: see text]-clique in the graph to be a [Formula: see text]-simplex. Our main result is that deciding whether the clique complex of a weighted graph has a hole or not, given a suitable promise on the gap, is [Formula: see text]-hard and contained in QMA. Our main innovation is a technique to lower bound the eigenvalues of the combinatorial Laplacian operator. For this, we invoke a tool from algebraic topology known as spectral sequences. In particular, we exploit a connection between spectral sequences and Hodge theory outlined by Forman (1994). Spectral sequences will play a role analogous to perturbation theory for combinatorial Laplacians. In addition, we develop the simplicial surgery technique used in prior work by Crichigno and Kohler (2022). Our result provides some suggestion that the quantum TDA algorithm due to Lloyd, Garnerone, and Zanardi (2016) cannot be dequantized, although proving this would require studying the complexity of a different problem related to the combinatorial Laplacian of clique complexes.

arXiv:2311.17234•SIAM Journal on Computing•Jan 2, 2026•22 citations

Reply to “Comment on ‘Remarks on the structure of states of composite quantum systems and envariance’ [Phys. Lett. A 355 (2006) 180]” [Phys. Lett. A 375 (2011) 1160]

Ph. Blanchard, Erwin Brüning

Physics Letters A•Dec 31, 2010•1 citation

Gapped Clique Homology on Weighted Graphs is QMA1-Hard and Contained in QMA

Robbie King, Tamara Kohler

We study the complexity of a classic problem in computational topology, the homology problem: given a description of some space$X$and an integer$k$, decide if$X$contains a k-dimensional hole. The setting and statement of the homology problem are completely classical, yet we find that the complexity is characterized by quantum complexity classes. Our result can be seen as an aspect of a connection between homology and supersymmetric quantum mechanics [1]. We consider clique complexes, motivated by the practical application of topological data analysis (TDA). The clique complex of a graph is the simplicial complex formed by declaring every$k+1$-clique in the graph to be a k-simplex. Our main result is that deciding whether the clique complex of a weighted graph has a hole or not, given a suitable promise on the gap, is QMA1-hard and contained in QMA. Our main innovation is a technique to lower bound the eigenvalues of the combinatorial Laplacian operator. For this, we invoke a tool from algebraic topology known as spectral sequences. In particular, we exploit a connection between spectral sequences and Hodge theory [2]. Spectral sequences will play a role analogous to perturbation theory for combinatorial Lapla-cians. In addition, we develop the simplicial surgery technique used in prior work [3]. Our result provides some suggestion that the quantum TDA algorithm [4] cannot be dequantized. More broadly, we hope that our results will open up new possibilities for quantum advantage in topological data analysis.

Annual Symposium on Foundations of Computer Science•Oct 27, 2024•3 citations
In the commented paper, the authors declare an analogy with the quantum mechanical pure states established through the application of the high-dimensional combinatorial Laplacian considering that the simplicial complex is in the pure state when it is formed by collection of the pure states. In their work, besides giving a completely erroneous analogy for the pure quantum mechanical state, which contradicts to very basic postulates of quantum mechanic, the authors clearly fail to provide and explain mathematical formalism behind their claims. Their intention is to rigorously prove that the existence of opinion space in all considered cases consists of the pure quantum states using incorrect normalization constant which does not produce trace equal to one. In this comment we prove out that their claims are erroneous. In order to show incorrectness of Maletic & Rajkovic model and conclusions we calculated and examined connections between different combinatorial structures of q- dimensional simplicial complexes and their Laplacian spectra and analyzed resulting symmetric and positive semidefinite matrices in the context of the density matrix of a quantum mechanical system. Importance of presented research is to further develop accurate quantitative topological-based characterization method for convertibility and distillation of density matrix.
It is usually taken for granted that the natural mathematical framework for quantum mechanics is the theory of Hilbert spaces, where pure states of a quantum system correspond to complex vectors of unit length. These vectors can be combined to create more general states expressed in terms of positive semidefinite matrices of unit trace called density operators. A density operator tells us everything we know about a quantum system. In particular, it specifies a unique probability for any measurement outcome. Thus, to fully appreciate quantum mechanics as a statistical model for physical phenomena, it is necessary to understand the basic properties of its set of states. Studying the convex geometry of quantum states provides important clues as to why the theory is expressed most naturally in terms of complex amplitudes. At the very least, it gives us a new perspective into thinking about structure of quantum mechanics. \n \n \nThis thesis is concerned with the structure of quantum state space obtained from the geometry of the convex set of probability distributions for a special class of measurements called symmetric informationally complete (SIC) measurements. In this context, quantum mechanics is seen as a particular restriction of a regular simplex, where the state space is postulated to carry a symmetric set of states called SICs, which are associated with equiangular lines in a complex vector space. The analysis applies specifically to 3-dimensional quantum systems or qutrits, which is the simplest nontrivial case to consider according to Gleason's theorem. It includes a full characterization of qutrit SICs and includes specific proposals for implementing them using linear optics. The infinitely many qutrit SICs are classified into inequivalent families according to the Clifford group, where equivalence is defined by geometrically invariant numbers called triple products. The multiplication of SIC projectors is also used to define structure coefficients, which are convenient for elucidating some additional structure possessed by SICs, such as the Lie algebra associated with the operator basis defined by SICs, and a linear dependency structure inherited from the Weyl-Heisenberg symmetry. After describing the general one-to-one correspondence between density operators and SIC probabilities, many interesting features of the set of qutrits are described, including an elegant formula for its pure states, which reveals a permutation symmetry related to the structure of a finite affine plane, the exact rotational equivalence of different SIC probability spaces, the shape of qutrit state space defined by the radial distance of the boundary from the maximally mixed state, and a comparison of the 2-dimensional cross-sections of SIC probabilities to known results. Towards the end, the representation of quantum states in terms of SICs is used to develop a method for reconstructing quantum theory from the postulate of maximal consistency, and a procedure for building up qutrit state space from a finite set of points corresponding to a Hesse configuration in Hilbert space is sketched briefly.
This work is at the interface of graph theory and quantum mechanics. Quantum correlations epitomize the usefulness of quantum mechanics. Quantum discord is an interesting facet of bipartite quantum correlations. Earlier, it was shown that every combinatorial graph corresponds to quantum states whose characteristics are reflected in the structure of the underlined graph. A number of combinatorial relations between quantum discord and simple graphs were studied. To extend the scope of these studies, we need to generalize the earlier concepts applicable to simple graphs to weighted graphs, corresponding to a diverse class of quantum states. To this effect, we determine the class of quantum states whose density matrix representation can be derived from graph Laplacian matrices associated with a weighted directed graph and call them graph Laplacian quantum states. We find the graph theoretic conditions for zero and nonzero quantum discord for these states. We apply these results on some important pure two qubit states, as well as a number of mixed quantum states, such as the Werner, Isotropic, and [Formula: see text]-states. We also consider graph Laplacian states corresponding to simple graphs as a special case.
Gapped Clique Homology on Weighted Graphs Is QMA1{\text{QMA}_1}QMA1​-Hard and Contained in QMA
Abstract. We study the complexity of a classic problem in computational topology, the homology problem: given a description of some space [Formula: see text] and an integer [Formula: see text], decide if [Formula: see text] contains a [Formula: see text]-dimensional hole. The setting and statement of the homology problem are completely classical, yet we find that the complexity is characterized by quantum complexity classes. Our result can be seen as an aspect of a connection between homology and supersymmetric quantum mechanics established by Witten (1982). We consider clique complexes, motivated by the practical application of topological data analysis (TDA). The clique complex of a graph is the simplicial complex formed by declaring every [Formula: see text]-clique in the graph to be a [Formula: see text]-simplex. Our main result is that deciding whether the clique complex of a weighted graph has a hole or not, given a suitable promise on the gap, is [Formula: see text]-hard and contained in QMA. Our main innovation is a technique to lower bound the eigenvalues of the combinatorial Laplacian operator. For this, we invoke a tool from algebraic topology known as spectral sequences. In particular, we exploit a connection between spectral sequences and Hodge theory outlined by Forman (1994). Spectral sequences will play a role analogous to perturbation theory for combinatorial Laplacians. In addition, we develop the simplicial surgery technique used in prior work by Crichigno and Kohler (2022). Our result provides some suggestion that the quantum TDA algorithm due to Lloyd, Garnerone, and Zanardi (2016) cannot be dequantized, although proving this would require studying the complexity of a different problem related to the combinatorial Laplacian of clique complexes.
We study the complexity of a classic problem in computational topology, the homology problem: given a description of some spaceXXXand an integerkkk, decide ifXXXcontains a k-dimensional hole. The setting and statement of the homology problem are completely classical, yet we find that the complexity is characterized by quantum complexity classes. Our result can be seen as an aspect of a connection between homology and supersymmetric quantum mechanics [1]. We consider clique complexes, motivated by the practical application of topological data analysis (TDA). The clique complex of a graph is the simplicial complex formed by declaring everyk+1k+1k+1-clique in the graph to be a k-simplex. Our main result is that deciding whether the clique complex of a weighted graph has a hole or not, given a suitable promise on the gap, is QMA1-hard and contained in QMA. Our main innovation is a technique to lower bound the eigenvalues of the combinatorial Laplacian operator. For this, we invoke a tool from algebraic topology known as spectral sequences. In particular, we exploit a connection between spectral sequences and Hodge theory [2]. Spectral sequences will play a role analogous to perturbation theory for combinatorial Lapla-cians. In addition, we develop the simplicial surgery technique used in prior work [3]. Our result provides some suggestion that the quantum TDA algorithm [4] cannot be dequantized. More broadly, we hope that our results will open up new possibilities for quantum advantage in topological data analysis.