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

Bulletin of the American Physical Society

A new and trustworthy formalism to compute entropy in quantum systems

Mohammad H. Ansari

Published Mar 15, 2017• 0 citations
OpenAlex

Related papers

Quantumization of Zero-Knowledge Proofs and Verifiable Computation Circuits

Jincheng Zhang

This paper explores the quantumization of zero-knowledge proofs (ZKPs) and verifiable computation circuits (VCCs), presenting a novel approach to achieving secure and verifiable execution of quantum computation programs. The core idea involves leveraging quantum circuit hashing techniques to construct ZKP protocols that demonstrate the correctness of a VCC without revealing its underlying structure. This approach addresses a critical need within the burgeoning field of quantum computing – the provision of robust and trustworthy execution validation mechanisms. We outline the theoretical framework, detailing the key components of the system including the circuit hashing algorithm, the ZKP protocol design, and the associated mathematical formalization. The work contributes to the development of a new paradigm for quantum program verification, offering a potential pathway towards building more reliable and secure quantum computing systems. The presented methodology aims to bridge the gap between the theoretical promise of quantum computation and the practical challenges of ensuring its trustworthiness. ---

•Sep 1, 2026•0 citations

Dynamical entropy for quantum systems

Göran Lindblad

Lecture notes in mathematics•Jan 1, 1988•8 citations

Non-Classical Correlation Entropy as a Measure of Quantum State Measurement Trustworthiness

Jincheng Zhang

This paper introduces a novel method for assessing the trustworthiness of quantum state measurement results based on non-classical correlation entropy. The core idea revolves around quantifying the correlation within quantum states using this entropy measure. By analyzing the associated entropy, we can evaluate the reliability of measurement outcomes and subsequently propose corrective and optimization strategies. Traditional approaches to quantum measurement uncertainty often rely on probabilistic interpretations and lack a direct quantification of the inherent correlations within the quantum state itself. This work aims to bridge this gap by providing a framework for assessing trustworthiness rooted in the fundamental properties of quantum entanglement and correlation. We present a detailed mathematical formulation, focusing on the calculation of the non-classical correlation entropy and its application to evaluating measurement confidence. The methodology offers a potentially valuable tool for guiding decision-making in quantum information processing, particularly in scenarios where the precise characterization of the quantum state is challenging. Further investigation into the sensitivity of the method to various noise sources and its scalability for complex quantum systems is warranted. ---

•Aug 28, 2026•0 citations

The entropy of an ensemble of quantum mechanical systems

C. S. Sharma

Physics Letters A•Mar 1, 1986•5 citations

Title: Formal Verification of Quantum Complexity

Jincheng Zhang

Quantum computing promises revolutionary advancements across numerous fields, but the inherent fragility of quantum systems necessitates robust verification methods. Traditional verification approaches often rely on trial-and-error, lacking the necessary mathematical rigor to guarantee correctness. This paper proposes a novel approach to formal verification of quantum algorithms and systems, focusing on the development of a "complexity metric" that provides a mathematical framework for assessing the trustworthiness of quantum technologies. This metric will enable automated verification against pre-defined complexity limits, offering a significant step towards building reliable and dependable quantum systems.

•Sep 6, 2026•0 citations

A Fundamental Property of Quantum-Mechanical Entropy

Élliott H. Lieb, Mary Beth Ruskai

Springer eBooks•Jan 1, 2002•11 citations
This paper explores the quantumization of zero-knowledge proofs (ZKPs) and verifiable computation circuits (VCCs), presenting a novel approach to achieving secure and verifiable execution of quantum computation programs. The core idea involves leveraging quantum circuit hashing techniques to construct ZKP protocols that demonstrate the correctness of a VCC without revealing its underlying structure. This approach addresses a critical need within the burgeoning field of quantum computing – the provision of robust and trustworthy execution validation mechanisms. We outline the theoretical framework, detailing the key components of the system including the circuit hashing algorithm, the ZKP protocol design, and the associated mathematical formalization. The work contributes to the development of a new paradigm for quantum program verification, offering a potential pathway towards building more reliable and secure quantum computing systems. The presented methodology aims to bridge the gap between the theoretical promise of quantum computation and the practical challenges of ensuring its trustworthiness. ---
This paper introduces a novel method for assessing the trustworthiness of quantum state measurement results based on non-classical correlation entropy. The core idea revolves around quantifying the correlation within quantum states using this entropy measure. By analyzing the associated entropy, we can evaluate the reliability of measurement outcomes and subsequently propose corrective and optimization strategies. Traditional approaches to quantum measurement uncertainty often rely on probabilistic interpretations and lack a direct quantification of the inherent correlations within the quantum state itself. This work aims to bridge this gap by providing a framework for assessing trustworthiness rooted in the fundamental properties of quantum entanglement and correlation. We present a detailed mathematical formulation, focusing on the calculation of the non-classical correlation entropy and its application to evaluating measurement confidence. The methodology offers a potentially valuable tool for guiding decision-making in quantum information processing, particularly in scenarios where the precise characterization of the quantum state is challenging. Further investigation into the sensitivity of the method to various noise sources and its scalability for complex quantum systems is warranted. ---
Quantum computing promises revolutionary advancements across numerous fields, but the inherent fragility of quantum systems necessitates robust verification methods. Traditional verification approaches often rely on trial-and-error, lacking the necessary mathematical rigor to guarantee correctness. This paper proposes a novel approach to formal verification of quantum algorithms and systems, focusing on the development of a "complexity metric" that provides a mathematical framework for assessing the trustworthiness of quantum technologies. This metric will enable automated verification against pre-defined complexity limits, offering a significant step towards building reliable and dependable quantum systems.