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:2002.10929

Duality Between Quantization and Measurement

Morimoto, Yosuke

Published Feb 23, 2020• 0 citations
arXivHTMLPDF

Abstract

Using the known duality between events and states, we establish the fact that there is a duality between quantization of events and measurement of states. With this duality, we will show a generalized system of imprimitivity and a covariant measurement are in a dual relation. We also propose a novel quantization scheme as a dual of a measurement model.

DOI
10.48550/arxiv.2002.10929

Related papers

Duality as a Feasible Physical Transformation

Shachar Ashkenazi, Erez Zohar

Duality transformations are very important in both classical and quantum physics. They allow one to relate two seemingly different formulations of the same physical realm through clever mathematical manipulations, and offer numerous advantages for the study of many-body physics. In this work, we suggest a method which shall introduce them to the world of quantum simulation too: a feasible scheme for implementing duality transformations as physical operations, mapping between dual quantum states showing the same observable physics, rather than just a mathematical trick. Demonstrating with Abelian lattice models, we show how duality transformations could be implemented in the laboratory as sequences of single- and two-body operations - unitaries and measurements.

arXiv:2111.04765•Nov 8, 2021•0 citations

Duality as a feasible physical transformation for quantum simulation

Shachar Ashkenazi, Erez Zohar

Duality transformations are very important in both classical and quantum physics. They allow one to relate two seemingly different formulations of the same physical realm through clever mathematical manipulations, and offer numerous advantages for the study of many-body physics. In this work, we suggest a method which introduces them to the world of quantum simulation too: a feasible scheme for implementing duality transformations as physical operations, mapping between dual quantum states showing the same observable physics, rather than just a mathematical trick. Demonstrating with Abelian lattice models, we show how duality transformations could be implemented in the laboratory as sequences of single- and two-body operations---unitaries and measurements.

Physical Review A•Feb 22, 2022•18 citations

A covariant quantum measurement mechanism

Qiu

This quantum theory proposes a covariant measurement mechanism. This measurement mechanism can reproduce the positive operator-valued measure and the projection-valued measure. In this theory, the positive operator-valued measure approximates the projection-valued measure in the limit of the symmetry.

•Sep 14, 2026•0 citations

Secret sharing and duality

László Csirmaz

Secret sharing is an important building block in cryptography. All explicit secret sharing schemes which are known to have optimal complexity are multi-linear, thus are closely related to linear codes. The dual of such a linear scheme, in the sense of duality of linear codes, gives another scheme for the dual access structure. These schemes have the same complexity, namely the largest share size relative to the secret size is the same. It is a long-standing open problem whether this fact is true in general: the complexity of any access structure is the same as the complexity of its dual. We give a partial answer to this question. An almost perfect scheme allows negligible errors, both in the recovery and in the independence. There exists an almost perfect ideal scheme on 174 participants whose complexity is strictly smaller than that of its dual.

•Nov 1, 2020•12 citations

Secret sharing and duality

László Csirmaz

Abstract Secret sharing is an important building block in cryptography. All explicit secret sharing schemes which are known to have optimal complexity are multi-linear, thus are closely related to linear codes. The dual of such a linear scheme, in the sense of duality of linear codes, gives another scheme for the dual access structure. These schemes have the same complexity, namely the largest share size relative to the secret size is the same. It is a long-standing open problem whether this fact is true in general: the complexity of any access structure is the same as the complexity of its dual. We give a partial answer to this question. An almost perfect scheme allows negligible errors, both in the recovery and in the independence. There exists an almost perfect ideal scheme on 174 participants whose complexity is strictly smaller than that of its dual.

arXiv:1909.13663•Journal of Mathematical Cryptology•Nov 25, 2020•1 citation

Quantum Measurement Problem and State Dual Representations

Sergey Nikolaevich Mayburov

The information aspects of quantum measurement problem studied in the simple quantum model of information processing and memorizing device — observer O . It’s argued that to describe probablistic events appearencei, i.e., ‘State Collapse’ consistently O complete states manifold must be tensor product of standard Hilbert space and dual to it novel set describing information acquired by O in the individual events.

Kluwer Academic Publishers eBooks•Feb 24, 2006•0 citations
Using the known duality between events and states, we establish the fact that there is a duality between quantization of events and measurement of states. With this duality, we will show a generalized system of imprimitivity and a covariant measurement are in a dual relation. We also propose a novel quantization scheme as a dual of a measurement model.
Duality transformations are very important in both classical and quantum physics. They allow one to relate two seemingly different formulations of the same physical realm through clever mathematical manipulations, and offer numerous advantages for the study of many-body physics. In this work, we suggest a method which shall introduce them to the world of quantum simulation too: a feasible scheme for implementing duality transformations as physical operations, mapping between dual quantum states showing the same observable physics, rather than just a mathematical trick. Demonstrating with Abelian lattice models, we show how duality transformations could be implemented in the laboratory as sequences of single- and two-body operations - unitaries and measurements.
Duality transformations are very important in both classical and quantum physics. They allow one to relate two seemingly different formulations of the same physical realm through clever mathematical manipulations, and offer numerous advantages for the study of many-body physics. In this work, we suggest a method which introduces them to the world of quantum simulation too: a feasible scheme for implementing duality transformations as physical operations, mapping between dual quantum states showing the same observable physics, rather than just a mathematical trick. Demonstrating with Abelian lattice models, we show how duality transformations could be implemented in the laboratory as sequences of single- and two-body operations---unitaries and measurements.
Secret sharing is an important building block in cryptography. All explicit secret sharing schemes which are known to have optimal complexity are multi-linear, thus are closely related to linear codes. The dual of such a linear scheme, in the sense of duality of linear codes, gives another scheme for the dual access structure. These schemes have the same complexity, namely the largest share size relative to the secret size is the same. It is a long-standing open problem whether this fact is true in general: the complexity of any access structure is the same as the complexity of its dual. We give a partial answer to this question. An almost perfect scheme allows negligible errors, both in the recovery and in the independence. There exists an almost perfect ideal scheme on 174 participants whose complexity is strictly smaller than that of its dual.
Abstract Secret sharing is an important building block in cryptography. All explicit secret sharing schemes which are known to have optimal complexity are multi-linear, thus are closely related to linear codes. The dual of such a linear scheme, in the sense of duality of linear codes, gives another scheme for the dual access structure. These schemes have the same complexity, namely the largest share size relative to the secret size is the same. It is a long-standing open problem whether this fact is true in general: the complexity of any access structure is the same as the complexity of its dual. We give a partial answer to this question. An almost perfect scheme allows negligible errors, both in the recovery and in the independence. There exists an almost perfect ideal scheme on 174 participants whose complexity is strictly smaller than that of its dual.