Quantum Annealing Mechanism as A Measurement Process
Kentaro Imafuku

TL;DR
This paper proposes a novel quantum annealing-based measurement process that uses quantum variables for parameters, enabling projection measurements in collective spaces, with potential applications in quantum state discrimination.
Contribution
It introduces a quantum mechanically parametrized annealing process that utilizes quantum variables for parameters, advancing measurement techniques in quantum mechanics.
Findings
The process achieves projection measurement when quantum parameters are orthogonal.
Application demonstrated in discriminating two collective quantum states.
The method offers a new approach to quantum measurement using annealing.
Abstract
An idea for an application of the quantum annealing mechanism to construct a projection measurement in a collective space is proposed. We use the annealing mechanism to drive the pointer degree of freedom associated with the measurement process. The parameters in its problem Hamiltonian is given not as classical variables but as quantum variables (states). By additionally introducing successive short interactions so that the back reaction to the quantum state (to be measured) can be controlled, we invent a quantum mechanically parametrized quantum annealing process. Applying to a particular problem of discrimination of two collective states , we find that the process by the quantum mechanically parametrized annealing arrives at projection measurement in the collective space when the parametrizing quantum variables themselves are orthogonal (or distinguishable).
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Mechanics and Applications · Quantum Information and Cryptography · Quantum Computing Algorithms and Architecture
