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

International Cryptology Conference

Direct Minimum-Knowledge Computations

Russell Impagliazzo, Moti M. Yung

Published Aug 16, 1987• 109 citations
OpenAlex

Related papers

Minimum-knowledge transfer protocols

Mordechai M. Yung

•Jan 1, 1988•0 citations

Direct Minimum-Knowledge Computations (Extended Abstract)

Russell Impagliazzo, Moti M. Yung

Lecture notes in computer science•Jan 1, 1988•56 citations

Algorithms and Computation

Masanori Ohya, Igor Vasil'evich Volovich

Theoretical and mathematical physics•Jan 1, 2011•0 citations

Computing the Exit Complexity of Knowledge in Distributed Quantum Computers

M A

Distributed Quantum computers abide from the exit complexity of the knowledge. The exit complexity is the accrue of the nodal information needed to clarify the total egress system with deference to a distinguished exit node. The core objective of this paper is to compile an arrogant methodology for assessing the exit complexity of the knowledge in distributed quantum computers. The proposed methodology is based on contouring the knowledge using the unlabeled binary trees, hence building an benchmarked and a computer based model. The proposed methodology dramatizes knowledge autocratically calculates the exit complexity. The methodology consists of several amphitheaters, starting with detecting the baron aspect of the tree of others entitled express knowledge and then measure the volume of information and the complexity of behavior destining from the bargain of information. Then calculate egress resulting from episodes that do not lead to the withdrawal of the information. In the end is calculated total egress complexity and then appraised total exit complexity of the system. Given the complexity of the operations within the Distributed Computing Quantity, this research addresses effective transactions that could affect the three-dimensional behavior of knowledge. The results materialized that the best affair where total exit complexity as minimal as possible is a picture of a binary tree is entitled at the rate of positive and negative cardinal points medium value. It could be argued that these cardinal points should not amass the upper bound apex or minimum.

International Journal of Advanced Computer Science and Applications•Jan 1, 2012•0 citations

Algorithmic Complexity

Fabio Benatti

Theoretical and mathematical physics•Jan 1, 2009•2 citations

Fisher information as the basis for diffraction optics

B. Roy Frieden

It is shown that the Helmholtz wave equation follows from a new uncertainty principle: Given, as data, the position of a photon in an unknown diffraction pattern, the estimated position of the centroid of the pattern will suffer minimum precision. This implies a maximally spread out diffraction pattern, obeying a principle of minimum Fisher information. The minimum is constrained by knowledge of the refractive-index function n(x, y, z) of the medium through a requirement that the mean-square spatial phase gradient across the medium should be generally nonzero. Operationally the principle works directly with intensities and not complex amplitudes. As a practical matter the numerical use of the intensity-based principle might permit a widening of the known scope of solutions to diffraction problems.

Optics Letters•Feb 15, 1989•25 citations
Distributed Quantum computers abide from the exit complexity of the knowledge. The exit complexity is the accrue of the nodal information needed to clarify the total egress system with deference to a distinguished exit node. The core objective of this paper is to compile an arrogant methodology for assessing the exit complexity of the knowledge in distributed quantum computers. The proposed methodology is based on contouring the knowledge using the unlabeled binary trees, hence building an benchmarked and a computer based model. The proposed methodology dramatizes knowledge autocratically calculates the exit complexity. The methodology consists of several amphitheaters, starting with detecting the baron aspect of the tree of others entitled express knowledge and then measure the volume of information and the complexity of behavior destining from the bargain of information. Then calculate egress resulting from episodes that do not lead to the withdrawal of the information. In the end is calculated total egress complexity and then appraised total exit complexity of the system. Given the complexity of the operations within the Distributed Computing Quantity, this research addresses effective transactions that could affect the three-dimensional behavior of knowledge. The results materialized that the best affair where total exit complexity as minimal as possible is a picture of a binary tree is entitled at the rate of positive and negative cardinal points medium value. It could be argued that these cardinal points should not amass the upper bound apex or minimum.
It is shown that the Helmholtz wave equation follows from a new uncertainty principle: Given, as data, the position of a photon in an unknown diffraction pattern, the estimated position of the centroid of the pattern will suffer minimum precision. This implies a maximally spread out diffraction pattern, obeying a principle of minimum Fisher information. The minimum is constrained by knowledge of the refractive-index function n(x, y, z) of the medium through a requirement that the mean-square spatial phase gradient across the medium should be generally nonzero. Operationally the principle works directly with intensities and not complex amplitudes. As a practical matter the numerical use of the intensity-based principle might permit a widening of the known scope of solutions to diffraction problems.