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

Springer eBooks

Quantum Logic as a Logic of Identification

Jaakko Hintikka, Ilpo Halonen

Published Jan 1, 1994• 1 citation
Publisher
DOI
10.1007/978-94-011-1152-2_6

Related papers

Quantum Theory and Logic

Martin Strauss

Bulletin of the British Society for the History of Science•Oct 1, 1950•0 citations

Realizing probabilistic identification and cloning of quantum states via universal quantum logic gates

Chuanwei Zhang, Zi-Yang Wang, Chuan-Feng Li +1 more

Probabilistic quantum cloning and identifying machines can be constructed via unitary-reduction processes [Duan and Guo, Phys. Rev. Lett. 80, 4999 (1998)]. Given the cloning (identifying) probabilities, we derive an explicit representation of the unitary evolution and corresponding Hamiltonian to realize probabilistic cloning (identification). The logic networks are obtained by decomposing the unitary representation into universal quantum logic operations. The robustness of the networks is also discussed. Our method is suitable for a k-partite system, such as quantum computer, and may be generalized to general state-dependent cloning and identification.

arXiv:quant-ph/9907097•Physical Review A•May 16, 2000•20 citations

Identifying Logical Operations from Syndrome Histories for qLDPC Codes

Yizhuo Tan, Shifan Xu, Yongshan Ding +1 more

Syndrome histories are normally used to detect and correct errors in fault-tolerant quantum computation, but they can also reveal information about the logical operations executed during computation. We study logical-operation identification using syndrome histories alone or together with other classical measurement outcomes. We develop an exact inference method and a scalable approximation that account for unknown circuit faults and ideal measurement randomness. We evaluate automorphisms, logical Pauli measurements, T injections, and logical circuits combining these instructions on \([[18,4,2]]\) and \([[72,12,6]]\) bivariate bicycle (BB) codes under multiple noise models and error rates. A single logical instruction can be identified with over 94\% accuracy under circuit-level noise with error rates between \(10^ {-5} \) and \(10^{-3}\). We also achieve over 99\% accuracy for automorphism-based logical circuits and 78.32\% for logical circuits combining all three instructions. We further analyze identification ambiguities arising from insufficient or indistinguishable measurement information, fault timing, and approximation inference. Together, these results extend the role of syndromes beyond error decoding to identifying executed logical operations and circuits during fault-tolerant quantum computation. They also suggest that access to syndrome histories and related classical measurement outcomes may unintentionally reveal information about the executed computation.

quant-pharXiv:2610.40052•Oct 30, 2026•0 citations

Quantum Theory and Logic

M. Strauss

Springer eBooks•Jan 1, 1972•0 citations

Realization of Probabilistic Identification and Clone of Quantum-States

Chuanwei Zhang, Ziyang Wang, Chuan‐Feng Li +1 more

Although the existence of unitary evolution for probabilistic identification and clone of quantum states has been demonstrated, the concrete form is undeveloped. In this paper, we first derived unitary evolution matrixes with the given probability for $n$-state identification. On the base of the work, the corresponding Hamiltonian was illustrated in detail. To some generalization, we found unitary representations and Hamiltonians of $N$ probabilistic clones given $M$ initial exact copies using the similar method. And the probabilistic identification given $M$ initial copies come out the result in the similar way. For the specialization of quantum computer, the evolution of probabilistic identification and clone in $2^n$-dimension quantum system is successfully derived and we realize it with the universal quantum logic gates.

•Jul 30, 1999•0 citations

Logic and Quantum Logic

Peter Mittelstaedt

Boston studies in the philosophy of science•Jan 1, 1976•0 citations
Probabilistic quantum cloning and identifying machines can be constructed via unitary-reduction processes [Duan and Guo, Phys. Rev. Lett. 80, 4999 (1998)]. Given the cloning (identifying) probabilities, we derive an explicit representation of the unitary evolution and corresponding Hamiltonian to realize probabilistic cloning (identification). The logic networks are obtained by decomposing the unitary representation into universal quantum logic operations. The robustness of the networks is also discussed. Our method is suitable for a k-partite system, such as quantum computer, and may be generalized to general state-dependent cloning and identification.
Syndrome histories are normally used to detect and correct errors in fault-tolerant quantum computation, but they can also reveal information about the logical operations executed during computation. We study logical-operation identification using syndrome histories alone or together with other classical measurement outcomes. We develop an exact inference method and a scalable approximation that account for unknown circuit faults and ideal measurement randomness. We evaluate automorphisms, logical Pauli measurements, T injections, and logical circuits combining these instructions on [[18,4,2]][[18,4,2]][[18,4,2]] and [[72,12,6]][[72,12,6]][[72,12,6]] bivariate bicycle (BB) codes under multiple noise models and error rates. A single logical instruction can be identified with over 94\% accuracy under circuit-level noise with error rates between 10−510^ {-5} 10−5 and 10−310^{-3}10−3. We also achieve over 99\% accuracy for automorphism-based logical circuits and 78.32\% for logical circuits combining all three instructions. We further analyze identification ambiguities arising from insufficient or indistinguishable measurement information, fault timing, and approximation inference. Together, these results extend the role of syndromes beyond error decoding to identifying executed logical operations and circuits during fault-tolerant quantum computation. They also suggest that access to syndrome histories and related classical measurement outcomes may unintentionally reveal information about the executed computation.
Although the existence of unitary evolution for probabilistic identification and clone of quantum states has been demonstrated, the concrete form is undeveloped. In this paper, we first derived unitary evolution matrixes with the given probability for nnn-state identification. On the base of the work, the corresponding Hamiltonian was illustrated in detail. To some generalization, we found unitary representations and Hamiltonians of NNN probabilistic clones given MMM initial exact copies using the similar method. And the probabilistic identification given MMM initial copies come out the result in the similar way. For the specialization of quantum computer, the evolution of probabilistic identification and clone in 2n2^n2n-dimension quantum system is successfully derived and we realize it with the universal quantum logic gates.