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:quant-ph/0211190 · International Journal of Theoretical Physics

Qubit Semantics and Quantum Trees

María Luisa Dalla Chiara, Roberto Giuntini, Alberto Leporati, Roberto Leporini

Published Jul 1, 2005• 5 citations
arXivHTMLPDF
DOI
10.1007/s10773-005-7074-7

Related papers

Qubit representation of a binary tree and its operations in quantum computation

Arnab Roy, Joseph L. Pachuau, Anish Kumar Saha

Advances in computers•Jan 24, 2022•0 citations

Semantic-Preserving QUBO Encodings for Fault Tree Analysis: Hierarchical Repair and Constraint-Level Formulations

Devin Peters

Quadratic Unconstrained Binary Optimization formulations for fault tree analysis encode gate logic through penalty terms, but prior work has demonstrated that these encodings fail to preserve fault tree semantics at scale: across 80 extended fault tree instances, only 7.5% of Rosenberg-based soft QUBO solutions match the constrained exact baseline, while 27.5% produce outright semantic violations. This paper develops two complementary methods to restore semantic correctness. A Hierarchical Semantic Validator and repair framework achieves 100% semantic validity across all 80 cohort instances through structure-aware bit-flip correction, improving the exact match rate from 7.5% to 28.75%. A constraint-level QUBO encoding eliminates penalty-based failures entirely by restricting optimization to the feasible subspace, reducing qubit requirements by a factor of 1.85x relative to Rosenberg encodings. Validation through Qiskit mixer circuits implementing a feasibility-preserving Quantum Alternating Operator Ansatz confirms zero probability leakage onto infeasible states for representative instances. These methods establish that semantic-preserving quantum optimization for fault tree minimal cut set identification is achievable with current algorithmic tools. Complete experimental artifacts with SHA-256 verification are provided under the DOI above.

•Feb 21, 2026•0 citations

A quantum-like text representation based on syntax tree for fuzzy semantic analysis

Yan Mei Yu, Dong Qiu, Ruiteng Yan

To mine more semantic information between words, it is important to utilize the different semantic correlations between words. Focusing on the different degrees of modifying relations between words, this article provides a quantum-like text representation based on syntax tree for fuzzy semantic analysis. Firstly, a quantum-like text representation based on density matrix of individual words is generalized to represent the relationship of modification between words. Secondly, a fuzzy semantic membership function is constructed to discuss the different degrees of modifying relationships between words based on syntax tree. Thirdly, the tensor dot product is defined as the sentence semantic similarity by combining the operation rules of the tensor to effectively exploit the semantic information of all elements in the quantum-like sentence representation. Finally, extensive experiments on STS’12, STS’14, STS’15, STS’16 and SICK show that the provided model outperforms the baselines, especially for the data set containing multiple long-sentence pairs, which confirms there are fuzzy semantic associations between words.

Journal of Intelligent & Fuzzy Systems•Mar 31, 2023•1 citation

Tree search and quantum computation

Luís Tarrataca, Andreas Wichert

arXiv:1502.01951•Quantum Information Processing•Nov 20, 2010•10 citations

Soft QUBO Formulations Do Not Reliably Preserve Fault Tree Semantics at Scale: An Exact Solver Comparison Study

Devin Peters

Quadratic Unconstrained Binary Optimization (QUBO) formulations have been proposed as a pathway for applying quantum optimization algorithms to fault tree analysis. These formulations encode fault tree logic through penalty terms, converting constrained minimal cut set identification into unconstrained optimization. Prior work has demonstrated QUBO-MCS equivalence for small, carefully structured instances. This paper investigates whether penalty-based encodings of the type commonly used in the literature reliably preserve fault tree semantics at realistic problem scales when solved exactly. A cohort of 80 extended fault tree instances with OR, AND, and NOT gates was evaluated using two exact solvers: a constrained baseline that enforces fault tree semantics directly, and a branch-and-bound solver operating on soft QUBO formulations using Rosenberg product reductions. Even with the TOP event variable fixed, penalty coefficients conservatively scaled to exceed the maximum objective contribution, and exact (not heuristic) optimization, the soft QUBO solutions matched the constrained baseline in only 6 of 80 instances (7.5%). More critically, 22 of 80 instances (27.5%) produced solutions that violate fault tree gate semantics entirely. These results demonstrate that Rosenberg-based soft QUBO formulations with dominance-safe penalties do not reliably preserve fault tree semantics at scale under exact optimization, indicating a structural limitation of this class of unconstrained penalty encodings rather than a tuning deficiency. Complete experimental artifacts with SHA-256 verification are provided under the DOI above.

•Jan 18, 2026•0 citations

Quantum Computation and Logic

María Luisa Dalla Chiara, Roberto Giuntini, Roberto Leporini +1 more

Trends in logic•Jan 1, 2018•16 citations
Quadratic Unconstrained Binary Optimization formulations for fault tree analysis encode gate logic through penalty terms, but prior work has demonstrated that these encodings fail to preserve fault tree semantics at scale: across 80 extended fault tree instances, only 7.5% of Rosenberg-based soft QUBO solutions match the constrained exact baseline, while 27.5% produce outright semantic violations. This paper develops two complementary methods to restore semantic correctness. A Hierarchical Semantic Validator and repair framework achieves 100% semantic validity across all 80 cohort instances through structure-aware bit-flip correction, improving the exact match rate from 7.5% to 28.75%. A constraint-level QUBO encoding eliminates penalty-based failures entirely by restricting optimization to the feasible subspace, reducing qubit requirements by a factor of 1.85x relative to Rosenberg encodings. Validation through Qiskit mixer circuits implementing a feasibility-preserving Quantum Alternating Operator Ansatz confirms zero probability leakage onto infeasible states for representative instances. These methods establish that semantic-preserving quantum optimization for fault tree minimal cut set identification is achievable with current algorithmic tools. Complete experimental artifacts with SHA-256 verification are provided under the DOI above.
To mine more semantic information between words, it is important to utilize the different semantic correlations between words. Focusing on the different degrees of modifying relations between words, this article provides a quantum-like text representation based on syntax tree for fuzzy semantic analysis. Firstly, a quantum-like text representation based on density matrix of individual words is generalized to represent the relationship of modification between words. Secondly, a fuzzy semantic membership function is constructed to discuss the different degrees of modifying relationships between words based on syntax tree. Thirdly, the tensor dot product is defined as the sentence semantic similarity by combining the operation rules of the tensor to effectively exploit the semantic information of all elements in the quantum-like sentence representation. Finally, extensive experiments on STS’12, STS’14, STS’15, STS’16 and SICK show that the provided model outperforms the baselines, especially for the data set containing multiple long-sentence pairs, which confirms there are fuzzy semantic associations between words.
Quadratic Unconstrained Binary Optimization (QUBO) formulations have been proposed as a pathway for applying quantum optimization algorithms to fault tree analysis. These formulations encode fault tree logic through penalty terms, converting constrained minimal cut set identification into unconstrained optimization. Prior work has demonstrated QUBO-MCS equivalence for small, carefully structured instances. This paper investigates whether penalty-based encodings of the type commonly used in the literature reliably preserve fault tree semantics at realistic problem scales when solved exactly. A cohort of 80 extended fault tree instances with OR, AND, and NOT gates was evaluated using two exact solvers: a constrained baseline that enforces fault tree semantics directly, and a branch-and-bound solver operating on soft QUBO formulations using Rosenberg product reductions. Even with the TOP event variable fixed, penalty coefficients conservatively scaled to exceed the maximum objective contribution, and exact (not heuristic) optimization, the soft QUBO solutions matched the constrained baseline in only 6 of 80 instances (7.5%). More critically, 22 of 80 instances (27.5%) produced solutions that violate fault tree gate semantics entirely. These results demonstrate that Rosenberg-based soft QUBO formulations with dominance-safe penalties do not reliably preserve fault tree semantics at scale under exact optimization, indicating a structural limitation of this class of unconstrained penalty encodings rather than a tuning deficiency. Complete experimental artifacts with SHA-256 verification are provided under the DOI above.