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

The New Scientist

Natural knowledge

Rory Allen

Published Mar 1, 2013• 0 citations
Publisher
DOI
10.1016/s0262-4079(13)60625-9

Related papers

Quantum Negative Sampling Strategy for Knowledge Graph Embedding with Variational Circuit

Pulak Ranjan Giri, Mori Kurokawa, Kazuhiro Saito

Knowledge graph is a collection of facts, known as triples(head, relation, tail), which are represented in form of a network, where nodes are entities and edges are relations among the respective head and tail entities. Embedding of knowledge graph for facilitating downstream tasks such as knowledge graph completion, link prediction, recommendation, has been a major area of research recently in classical machine learning. Because the size of knowledge graphs are becoming larger, one of the natural choices is to exploit quantum computing for knowledge graph embedding. Recently, a hybrid quantum classical model for knowledge graph embedding has been studied in which a variational quantum circuit is trained. One of the important aspects in knowledge graph embedding is the sampling of negative triples, which plays a crucial role in efficient training of the model. In classical machine learning various negative sampling strategies have been studied. In quantum knowledge graph embedding model, although we can use these strategies in principle, it is natural to ask if we can exploit quantum advantage in negative sampling. In this article we study such a negative sampling strategy, which exploits quantum superposition, and evaluate the model's performance with a knowledge graph database.

arXiv:2502.17973•IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 17, 2023•4 citations

Unity of Knowledge

David Favrholdt

Niels Bohr•Jan 1, 1999•26 citations

Quantum formalism methods in information retrieval and processing of texts in natural languages

Igor Bessmertny, A.V. Vasiljev, Ю А Королёва +2 more

Creation of intelligent systems in the paradigm of logical decision-making requires formalization of knowledge in the form of ontologies, production models, etc.However, a rigorous formalization of knowledge is far from always possible due to the incompleteness, inaccuracy, and inconsistency of the data.In this regard, recently, the attention of researchers has shifted to extracting knowledge from natural language texts.Particularly noteworthy is the recently developing approach based on the use of quantum formalism to the objects of the macrocosm, which allows one to consider the uncertainty and inaccuracy inherent in the natural language.Numerous experiments conducted over the past 30 years demonstrate that the mathematical apparatus developed for modeling elementary particles also satisfactorily describes the behavior of people, which cannot be described by the mathematical apparatus of classical logic and probability theory.A review of the methods of processing natural language texts by means of quantum mathematics is presented.The methods are designed to eliminate the shortcomings of existing methods and means of information retrieval.

Известия высших учебных заведений. Приборостроение•Aug 29, 2019•0 citations

Actions, Knowledge, and Information

Henry Pierce Stapp

The frontiers collection•Jan 1, 2011•0 citations

Non-Interactive Quantum Statistical and Perfect Zero-Knowledge

Hirotada Kobayashi

This paper introduces quantum analogues of non-interactive perfect and statistical zero-knowledge proof systems. Similar to the classical cases, it is shown that sharing randomness or entanglement is necessary for non-trivial protocols of non-interactive quantum perfect and statistical zero-knowledge. It is also shown that, with sharing EPR pairs a priori, the class of languages having one-sided bounded error non-interactive quantum perfect zero-knowledge proof systems has a natural complete problem. Non-triviality of such a proof system is based on the fact proved in this paper that the Graph Non-Automorphism problem, which is not known in BQP, can be reduced to our complete problem. Our results may be the first non-trivial quantum zero-knowledge proofs secure even against dishonest quantum verifiers, since our protocols are non-interactive, and thus the zero-knowledge property does not depend on whether the verifier in the protocol is honest or not. A restricted version of our complete problem derives a natural complete problem for BQP.

arXiv:quant-ph/0207158•Jul 29, 2002•3 citations

Actions, Knowledge, and Information

Springer eBooks•Jun 12, 2007•0 citations
Knowledge graph is a collection of facts, known as triples(head, relation, tail), which are represented in form of a network, where nodes are entities and edges are relations among the respective head and tail entities. Embedding of knowledge graph for facilitating downstream tasks such as knowledge graph completion, link prediction, recommendation, has been a major area of research recently in classical machine learning. Because the size of knowledge graphs are becoming larger, one of the natural choices is to exploit quantum computing for knowledge graph embedding. Recently, a hybrid quantum classical model for knowledge graph embedding has been studied in which a variational quantum circuit is trained. One of the important aspects in knowledge graph embedding is the sampling of negative triples, which plays a crucial role in efficient training of the model. In classical machine learning various negative sampling strategies have been studied. In quantum knowledge graph embedding model, although we can use these strategies in principle, it is natural to ask if we can exploit quantum advantage in negative sampling. In this article we study such a negative sampling strategy, which exploits quantum superposition, and evaluate the model's performance with a knowledge graph database.
Creation of intelligent systems in the paradigm of logical decision-making requires formalization of knowledge in the form of ontologies, production models, etc.However, a rigorous formalization of knowledge is far from always possible due to the incompleteness, inaccuracy, and inconsistency of the data.In this regard, recently, the attention of researchers has shifted to extracting knowledge from natural language texts.Particularly noteworthy is the recently developing approach based on the use of quantum formalism to the objects of the macrocosm, which allows one to consider the uncertainty and inaccuracy inherent in the natural language.Numerous experiments conducted over the past 30 years demonstrate that the mathematical apparatus developed for modeling elementary particles also satisfactorily describes the behavior of people, which cannot be described by the mathematical apparatus of classical logic and probability theory.A review of the methods of processing natural language texts by means of quantum mathematics is presented.The methods are designed to eliminate the shortcomings of existing methods and means of information retrieval.
This paper introduces quantum analogues of non-interactive perfect and statistical zero-knowledge proof systems. Similar to the classical cases, it is shown that sharing randomness or entanglement is necessary for non-trivial protocols of non-interactive quantum perfect and statistical zero-knowledge. It is also shown that, with sharing EPR pairs a priori, the class of languages having one-sided bounded error non-interactive quantum perfect zero-knowledge proof systems has a natural complete problem. Non-triviality of such a proof system is based on the fact proved in this paper that the Graph Non-Automorphism problem, which is not known in BQP, can be reduced to our complete problem. Our results may be the first non-trivial quantum zero-knowledge proofs secure even against dishonest quantum verifiers, since our protocols are non-interactive, and thus the zero-knowledge property does not depend on whether the verifier in the protocol is honest or not. A restricted version of our complete problem derives a natural complete problem for BQP.