Sari la conținut

Română · beta. Traducerea a fost făcută automat și este încă în curs de revizuire. Citește pagina în engleză

perspectiva aiqbenchCalcul cuantic

analiza aiqbench

This paper introduces a novel procedure for random dimension reduction in quantum states, offering a black-box method to simplify sample complexity when learning symmetric properties across multiple distinct inputs. By leveraging the Choi-Jamiołkowski isomorphism, the authors establish a direct link to random purification channels while proving fundamental limitations on simultaneously purifying different state copies. The work provides improved bounds for estimating quantum distances and fidelities without relying on complex mathematical frameworks like Schur polynomials.
Surse care acoperăarXiv, Quantum Zeitgeist, LessWrong
Ce este aceastaLectura unui model asupra articolului și a acoperirii conexe, scrisă pentru aiqbench. Nu sunt cuvintele publicației.

Random dimension reduction and learning symmetric properties of quantum states

arXiv2 min de cititArticolul și perspectiva sunt în engleză.

arXiv:2606.23592v2 Announce Type: replace Abstract: We describe a procedure that simultaneously reduces the dimensions of many, potentially distinct quantum states while preserving properties invariant under the tensor power action of an isometry. This serves as a black-box method to replace the dimension with the maximum rank in the sample complexity of learning symmetric properties, even those depending on multiple input states. Combined with full state tomography, random dimension reduction yields improved upper bounds for estimating distances, fidelities, and relative entropies between pairs of states. Expressing the action of this procedure through the Choi--Jamio\l{}kowski isomorphism reveals an intimate connection with the recently introduced random purification channel by Tang, Wright, and Zhandry. With this new perspective, we obtain a simple description of the rank-dependent version of the random purification channel and give an end-to-end analysis of sample-optimal tomography without requiring a reference to the Schur transform or Schur polynomials. Finally, we prove that there does not exist a random purification channel that simultaneously purifies copies of multiple, potentially different input states. Hence, the procedure is related to, but distinct from, random purification.

Abstract:We describe a procedure that simultaneously reduces the dimensions of many, potentially distinct quantum states while preserving properties invariant under the tensor power action of an isometry. This serves as a black-box method to replace the dimension with the maximum rank in the sample complexity of learning symmetric properties, even those depending on multiple input states. Combined with full state tomography, random dimension reduction yields improved upper bounds for estimating distances, fidelities, and relative entropies between pairs of states. Expressing the action of this procedure through the Choi--Jamiołkowski isomorphism reveals an intimate connection with the recently introduced random purification channel by Tang, Wright, and Zhandry. With this new perspective, we obtain a simple description of the rank-dependent version of the random purification channel and give an end-to-end analysis of sample-optimal tomography without requiring a reference to the Schur transform or Schur polynomials. Finally, we prove that there does not exist a random purification channel that simultaneously purifies copies of multiple, potentially different input states. Hence, the procedure is related to, but distinct from, random purification.

arXiv:2606.23592 [quant-ph]

(or arXiv:2606.23592v2 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2606.23592 Focus to learn more arXiv-issued DOI via DataCite

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.

Text integral sub licența deschisă a publicației · 264 cuvinte

Subiecte conexe