Optimal Complexity of Parameterized Quantum Circuits | ||
| dc.conicet.organizacion | Universidade de Sao Paulo | |
| dc.conicet.organizacion | University of Helsinki | |
| dc.conicet.organizacion | Universidade de Sao Paulo | |
| dc.conicet.organizacion | International Iberian Nanotechnology Laboratory | |
| dc.conicet.organizacion | Universidade de Sao Paulo | |
| dc.conicet.organizacion | Consejo Nacional de Investigaciones Científicas y Técnicas | |
| dc.conicet.organizacion | Comisión Nacional de Energía Atómica | |
| dc.contributor.author | Correr, Guilherme I. | |
| dc.contributor.author | Azado, Pedro C. | |
| dc.contributor.author | Soares Pinto, Diogo O. | |
| dc.contributor.author | Carlo, Gabriel Gustavo | |
| dc.date.issued | 2026-01 | |
| dc.description.abstract | Parameterized quantum circuits are central to the development of variational quantum algorithms in the NISQ era. A key feature of these circuits is their ability to generate an expressive set of quantum states, enabling the approximation of solutions to diverse problems. The expressibility of such circuits can be assessed by analyzing the ensemble of states produced when their parameters are randomly sampled, a property closely tied to quantum complexity. In this work, we compare different classes of parameterized quantum circuits with a prototypical family of universal random circuits to investigate how rapidly they approach the asymptotic complexity defined by the Haar measure. We find that parameterized circuits exhibit faster convergence in terms of the number of gates required, as quantified through expressibility and majorization-based complexity measures. Moreover, the topology of qubit connections proves crucial, significantly affecting entanglement generation and, consequently, complexity growth. The majorization criterion emerges as a valuable complementary tool, offering distinct insights into the behavior of random state generation in the considered circuit families. | es |
| dc.description.fil | Fil: Correr, Guilherme I.. Universidade de Sao Paulo; Brasil. University of Helsinki; Finlandia | |
| dc.description.fil | Fil: Azado, Pedro C.. Universidade de Sao Paulo; Brasil. International Iberian Nanotechnology Laboratory; Portugal | |
| dc.description.fil | Fil: Soares Pinto, Diogo O.. Universidade de Sao Paulo; Brasil | |
| dc.description.fil | Fil: Carlo, Gabriel Gustavo. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Comisión Nacional de Energía Atómica; Argentina | |
| dc.format | application/pdf | es |
| dc.identifier.citation | Correr, Guilherme I.; Azado, Pedro C.; Soares Pinto, Diogo O.; Carlo, Gabriel Gustavo; Optimal Complexity of Parameterized Quantum Circuits; Molecular Diversity Preservation International; Entropy; 28; 1; 1-2026; 73-74 | es |
| dc.identifier.institucional | CONICET | |
| dc.identifier.issn | 1099-4300 | es |
| dc.identifier.repo | CONICET Digital | |
| dc.identifier.uri | http://hdl.handle.net/11336/285641 | |
| dc.journal.ciudad | Basel | es |
| dc.journal.number | 1 | es |
| dc.journal.pagination | 73-74 | es |
| dc.journal.pais | Suiza | es |
| dc.journal.title | Entropy | es |
| dc.journal.volume | 28 | es |
| dc.language.iso | eng | es |
| dc.publisher | Molecular Diversity Preservation International | es |
| dc.relation.alternativeid | info:eu-repo/semantics/altIdentifier/url/https://www.mdpi.com/1099-4300/28/1/73 | |
| dc.relation.alternativeid | info:eu-repo/semantics/altIdentifier/doi/http://dx.doi.org/10.3390/e28010073 | |
| dc.rights | info:eu-repo/semantics/openAccess | * |
| dc.rights.uri | https://creativecommons.org/licenses/by-nc-sa/2.5/ar/ | * |
| dc.subject | quantum computation | es |
| dc.subject | quantum complexity | es |
| dc.subject.classification | Otras Ciencias Físicas | es |
| dc.subject.classification | Ciencias Físicas | es |
| dc.subject.classification | CIENCIAS NATURALES Y EXACTAS | es |
| dc.title | Optimal Complexity of Parameterized Quantum Circuits | es |
| dc.type | info:eu-repo/semantics/article | |
| dc.type | info:ar-repo/semantics/artículo | |
| dc.type | info:eu-repo/semantics/publishedVersion | |
Archivos
Bloque original
Cargando...
- Nombre:
- CONICET_Digital_Nro.e5ad1400-7a39-4a2b-8975-b697b672fb9a_B.pdf
- Tamaño:
- 1.03 MB
- Formato:
- Adobe Portable Document Format