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

Physics Essays

An Alternative Approach to Quantum Projection

T. E. Phipps

Published Mar 1, 1998• 0 citations
Publisher
DOI
10.4006/1.3028754

Related papers

Quantum method of projection

Igor' Victorovich Shirokov, A. A. Drokin

Russian Physics Journal•Sep 1, 1996•0 citations

An alternative to the Lüders generalization of the von Neumann projection, and its interpretation

Willem M. de Muynck

An alternative to the Lüders generalization of the von Neumann projection is formulated allowing a generalization to measurements represented by positive operator-valued measures. This generalization is based on the notions of non-orthogonal projections and bi-orthonormal systems in Hilbert-Schmidt space, and is closely related to phase-space representations of quantum mechanics. A number of applications will be discussed. It is demonstrated that the alternative projection has a natural interpretation as a representation of the information on the initial state, to be obtained by the measurement.

Journal of Physics A Mathematical and General•Jan 16, 1998•21 citations

Quantum Predictions Without Nonlocal Projections

D. J. Miller

Springer eBooks•Jan 1, 1997•1 citation

A Hybrid Check Polytope Projection Algorithm for ADMM Decoding of LDPC Codes

Qiaoqiao Xia, Xin Wang, Huajun Liu +1 more

The Euclidean projection onto check polytope is the most complicated and time-consuming operation in the alternating direction method of multipliers (ADMM) decoding algorithm for low-density parity-check (LDPC) codes. Existing approximate even-vertex projection algorithm (EVA) can simplify the projection operation, but yields poor decoding performance. By alternately adopting EVA and other accurate projection algorithms, this letter proposes an innovative and simple hybrid projection algorithm (HPA) which can increase the percentage of unuseful projections. Simulation results show that the proposed algorithm can substantially reduce the projection time while achieving better frame error rate (FER) performance when compared with the standard ADMM decoding and the ADMM penalized decoding in the case of avoiding the tedious work of penalty parameter optimization. More importantly, compared with cut search algorithm (CSA), the proposed algorithm can significantly save the average projection time by nearly 80%, and the average decoding time by about 85%.

IEEE Communications Letters•Sep 11, 2020•12 citations

An improved quantum projection filter

Qing Zhong Gao, Guofeng Zhang, Ian R. Petersen

arXiv:1909.13524•Automatica•Nov 27, 2019•24 citations

Alternating Projections Methods for Discrete-Time Stabilization of Quantum States

Francesco Ticozzi, Luca Zuccato, Peter D. Johnson +1 more

We study sequences (both cyclic and randomized) of idempotent completely positive trace-preserving quantum maps, and show how they asymptotically converge to the intersection of their fixed point sets via alternating projection methods, highlighting the robustness features of the protocol against randomization. The general results are then specialized to stabilizing entangled states in finite-dimensional multipartite quantum systems subject to locality constraints, a problem of key interest for quantum information applications.

arXiv:1612.05554•IEEE Transactions on Automatic Control•Jul 25, 2017•19 citations
An alternative to the Lüders generalization of the von Neumann projection is formulated allowing a generalization to measurements represented by positive operator-valued measures. This generalization is based on the notions of non-orthogonal projections and bi-orthonormal systems in Hilbert-Schmidt space, and is closely related to phase-space representations of quantum mechanics. A number of applications will be discussed. It is demonstrated that the alternative projection has a natural interpretation as a representation of the information on the initial state, to be obtained by the measurement.
The Euclidean projection onto check polytope is the most complicated and time-consuming operation in the alternating direction method of multipliers (ADMM) decoding algorithm for low-density parity-check (LDPC) codes. Existing approximate even-vertex projection algorithm (EVA) can simplify the projection operation, but yields poor decoding performance. By alternately adopting EVA and other accurate projection algorithms, this letter proposes an innovative and simple hybrid projection algorithm (HPA) which can increase the percentage of unuseful projections. Simulation results show that the proposed algorithm can substantially reduce the projection time while achieving better frame error rate (FER) performance when compared with the standard ADMM decoding and the ADMM penalized decoding in the case of avoiding the tedious work of penalty parameter optimization. More importantly, compared with cut search algorithm (CSA), the proposed algorithm can significantly save the average projection time by nearly 80%, and the average decoding time by about 85%.
We study sequences (both cyclic and randomized) of idempotent completely positive trace-preserving quantum maps, and show how they asymptotically converge to the intersection of their fixed point sets via alternating projection methods, highlighting the robustness features of the protocol against randomization. The general results are then specialized to stabilizing entangled states in finite-dimensional multipartite quantum systems subject to locality constraints, a problem of key interest for quantum information applications.