Skip to content
aiqbench takeQuantum Computing

aiqbench analysis

This research advances quantum tomography by demonstrating how Markovian locality constraints reduce ambiguity in shadow inversion protocols for multipartite systems. By restricting post-processing to factorizable unitaries, the study provides a structural mechanism to enhance identifiability without requiring full global unitary reconstruction. The work offers a significant theoretical contribution to the field of quantum information processing and state characterization.
Sources coveringarXiv, LessWrong, The Quantum Insider, Quantum Zeitgeist
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

Markov Constraints Enhance Identifiability in Quantum Shadow Inversion

arXiv2 min read

arXiv:2608.21765v1 Announce Type: new Abstract: We study quantum shadow inversion under Markovian locality constraints for four-partite systems arranged along the chain $A$--$B$--$C$--$D$. The goal is to reproduce the expectation value of a fixed endpoint observable $O_{AD}$ after an unknown global unitary, without requiring full unitary inversion. We formulate the task using Markov-admissible supermaps and introduce the Markov-implementable centralizer to describe the remaining endpoint gauge freedom. We show that unrestricted endpoint post-processing is too broad, and impose an endpoint-local refinement. Under this condition, every implementable endpoint unitary must factorize across $A|D$, so the Markov constraint strictly reduces the centralizer-induced shadow ambiguity whenever the full centralizer contains non-product unitaries. This provides a structural mechanism by which Markov locality enhances identifiability in quantum shadow inversion.

Abstract:We study quantum shadow inversion under Markovian locality constraints for four-partite systems arranged along the chain $A$--$B$--$C$--$D$. The goal is to reproduce the expectation value of a fixed endpoint observable $O_{AD}$ after an unknown global unitary, without requiring full unitary inversion. We formulate the task using Markov-admissible supermaps and introduce the Markov-implementable centralizer to describe the remaining endpoint gauge freedom. We show that unrestricted endpoint post-processing is too broad, and impose an endpoint-local refinement. Under this condition, every implementable endpoint unitary must factorize across $A|D$, so the Markov constraint strictly reduces the centralizer-induced shadow ambiguity whenever the full centralizer contains non-product unitaries. This provides a structural mechanism by which Markov locality enhances identifiability in quantum shadow inversion.

Quantum Physics (quant-ph); Quantum Algebra (math.QA)

arXiv:2608.21765 [quant-ph]

(or arXiv:2608.21765v1 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2608.21765 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Full text under the publisher's open licence · 214 words

Related coverage