aiqbench analysis
This research establishes fundamental lower bounds for converting between unknown quantum states and their block-encoding unitary channels, clarifying the inherent limitations of this representation in quantum learning tasks. The study reveals a critical separation between learning properties of a state and generating it, with query complexities that scale unavoidably with system dimension. These findings provide essential theoretical constraints for algorithms relying on Quantum Singular Value Transformation (QSVT) when dealing with unknown states.
Sample-Query Interconversion of Block Encoding of Unknown Quantum States
arXiv:2608.22470v1 Announce Type: new Abstract: Block encoding embeds a matrix as a sub-block of a unitary matrix and serves as a fundamental input model for quantum algorithms based on quantum singular value transformation, enabling polynomial transformations of matrices encoded in unitary operators. Block encoding of unknown quantum states can be useful for quantum learning; however, the fundamental limits on converting between unknown quantum states and their block-encoding unitary channels remain poorly understood. In this paper, we investigate this convertibility in both directions. First, we prove that implementing an $\varepsilon$-approximate block-encoding unitary channel of an unknown quantum state requires $\Omega(1/\varepsilon)$ copies of the state, matching known upper bounds up to logarithmic factors. Second, we show that recovering a rank-$r$, $d$-dimensional quantum state $\rho$ given query access to its block-encoding unitary channel generally requires $\Omega((1/\lambda_{\max}(\rho))\sqrt{d/r})$ queries, where $\lambda_{\max}(\rho)$ is the maximum eigenvalue of $\rho$, revealing an unavoidable dependence on the dimension of the state. Our results identify inherent limitations of block encoding as a representation of unknown quantum states and reveal a separation between learning properties of a quantum state and generating the state itself. Using our techniques, we further establish lower bounds for specific state-generation tasks, including ground-state preparation and Gibbs-state preparation.
Abstract:Block encoding embeds a matrix as a sub-block of a unitary matrix and serves as a fundamental input model for quantum algorithms based on quantum singular value transformation, enabling polynomial transformations of matrices encoded in unitary operators. Block encoding of unknown quantum states can be useful for quantum learning; however, the fundamental limits on converting between unknown quantum states and their block-encoding unitary channels remain poorly understood. In this paper, we investigate this convertibility in both directions. First, we prove that implementing an $\varepsilon$-approximate block-encoding unitary channel of an unknown quantum state requires $\Omega(1/\varepsilon)$ copies of the state, matching known upper bounds up to logarithmic factors. Second, we show that recovering a rank-$r$, $d$-dimensional quantum state $\rho$ given query access to its block-encoding unitary channel generally requires $\Omega((1/\lambda_{\max}(\rho))\sqrt{d/r})$ queries, where $\lambda_{\max}(\rho)$ is the maximum eigenvalue of $\rho$, revealing an unavoidable dependence on the dimension of the state. Our results identify inherent limitations of block encoding as a representation of unknown quantum states and reveal a separation between learning properties of a quantum state and generating the state itself. Using our techniques, we further establish lower bounds for specific state-generation tasks, including ground-state preparation and Gibbs-state preparation.
arXiv:2608.22470 [quant-ph]
(or arXiv:2608.22470v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2608.22470 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 · 287 words
Related coverage

Lattice-Based Cryptography Explained
Quantum Zeitgeist · Aug 15, 2026
Advantage of Sample Complexity in Quantum PAC Learning Requires Inverse Access to State-Preparation Unitaries
arXiv · Oct 1, 2026
Sample-Efficient Tomography of a Class of Mixed States with Extensive Entanglement and Magic
arXiv · Sep 24, 2026
Quantum Channel Polynomial Processing
arXiv · Oct 5, 2026