aiqbench analysis
This work introduces a variational quantum circuit framework that achieves exact uniform permutation generation with linear depth on linear nearest-neighbor topologies, eliminating the need for all-to-all qubit connectivity. The study establishes that while architectures like the quantum Beneš network can realize any permutation, they are intrinsically non-uniform, thereby clarifying a critical distinction between permutation realizability and uniform sampling. These findings provide a hardware-constrained solution for tasks in cryptography and error correction while laying the groundwork for formal complexity separations in quantum computation.
Variational Approach for Uniform Quantum Permutation Generators
arXiv:2606.10230v1 Announce Type: new Abstract: Uniform permutation generation is a fundamental task in both classical and quantum computation, with applications ranging from cryptography to quantum optimization and quantum error correction. Existing exact quantum constructions typically require all-to-all qubit connectivity and quadratic circuit depth. We develop a variational quantum circuit framework for uniform permutation generation under connectivity constraints, in which the circuit architecture is determined by the underlying interaction graph and the variational parameters are optimized to enforce the target permutation statistics. In particular, we present explicit controlled-SWAP-based unitary constructions that achieve exact uniformity with quadratic circuit size and linear depth \(O(n)\) on linear nearest-neighbor topologies. Our approach, therefore, removes the need for all-to-all connectivity while improving the depth of previous exact constructions by a factor. We further prove that a quantum Bene\v{s}-like architecture is intrinsically non-uniform. Despite its logarithmic depth and ability to realize any permutation it cannot generate a uniform distribution over permutations for any choice of variational parameters. These results clarify the role of circuit topology in exact permutation generation and identify variational quantum circuits as a natural framework for hardware-constrained uniform sampling. More broadly, this work suggests that exact uniform permutation generation is a strictly stronger requirement than mere permutation realizability, and lays the groundwork for a formal complexity separation between the two.
Abstract:Uniform permutation generation is a fundamental task in both classical and quantum computation, with applications ranging from cryptography to quantum optimization and quantum error correction. Existing exact quantum constructions typically require all-to-all qubit connectivity and quadratic circuit depth. We develop a variational quantum circuit framework for uniform permutation generation under connectivity constraints, in which the circuit architecture is determined by the underlying interaction graph and the variational parameters are optimized to enforce the target permutation statistics. In particular, we present explicit controlled-SWAP-based unitary constructions that achieve exact uniformity with quadratic circuit size and linear depth \(O(n)\) on linear nearest-neighbor topologies. Our approach, therefore, removes the need for all-to-all connectivity while improving the depth of previous exact constructions by a factor. We further prove that a quantum Beneš-like architecture is intrinsically non-uniform. Despite its logarithmic depth and ability to realize any permutation it cannot generate a uniform distribution over permutations for any choice of variational parameters. These results clarify the role of circuit topology in exact permutation generation and identify variational quantum circuits as a natural framework for hardware-constrained uniform sampling. More broadly, this work suggests that exact uniform permutation generation is a strictly stronger requirement than mere permutation realizability, and lays the groundwork for a formal complexity separation between the two.
arXiv:2606.10230 [quant-ph]
(or arXiv:2606.10230v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2606.10230 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 · 302 words
Related coverage
Variational Learning for Insertion-based Generation
arXiv · Jun 12, 2026
Variational Learning for Insertion-based Generation
arXiv · Jun 10, 2026
P2P: Cross-View Population Denoising for Unpaired Single-Cell Perturbation Response Prediction
arXiv · Sep 30, 2026
AmbiModBench: Benchmarking Gene Perturbation Prediction Beyond Shared Responses
arXiv · Sep 30, 2026