Pub Date : 2025-03-20DOI: 10.22331/q-2025-03-20-1665
Lennart Bittel, Antonio A. Mele, Jens Eisert, Lorenzo Leone
Free-fermionic states, also known as matchgates or Gaussian states, are a fundamental class of quantum states due to their efficient classical simulability and their crucial role across various domains of Physics. With the advent of quantum devices, experiments now yield data from quantum states, including estimates of expectation values. We establish that deciding whether a given dataset, formed by a few Majorana correlation functions estimates, can be consistent with a free-fermionic state is an NP-complete problem. Our result also extends to datasets formed by estimates of Pauli expectation values. This is in stark contrast to the case of stabilizer states, where the analogous problem can be efficiently solved. Moreover, our results directly imply that free-fermionic states are computationally hard to properly PAC-learn, where PAC-learning of quantum states is a learning framework introduced by Aaronson. Remarkably, this is the first class of classically simulable quantum states shown to have this property.
{"title":"PAC-learning of free-fermionic states is NP-hard","authors":"Lennart Bittel, Antonio A. Mele, Jens Eisert, Lorenzo Leone","doi":"10.22331/q-2025-03-20-1665","DOIUrl":"https://doi.org/10.22331/q-2025-03-20-1665","url":null,"abstract":"Free-fermionic states, also known as matchgates or Gaussian states, are a fundamental class of quantum states due to their efficient classical simulability and their crucial role across various domains of Physics. With the advent of quantum devices, experiments now yield data from quantum states, including estimates of expectation values. We establish that deciding whether a given dataset, formed by a few Majorana correlation functions estimates, can be consistent with a free-fermionic state is an NP-complete problem. Our result also extends to datasets formed by estimates of Pauli expectation values. This is in stark contrast to the case of stabilizer states, where the analogous problem can be efficiently solved. Moreover, our results directly imply that free-fermionic states are computationally hard to properly PAC-learn, where PAC-learning of quantum states is a learning framework introduced by Aaronson. Remarkably, this is the first class of classically simulable quantum states shown to have this property.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"26 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143661284","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-03-20DOI: 10.22331/q-2025-03-20-1666
Ray Ganardi, Piotr Masajada, Moein Naseri, Alexander Streltsov
Quantum thermodynamics and quantum entanglement represent two pivotal quantum resource theories with significant relevance in quantum information science. Despite their importance, the intricate relationship between these two theories is still not fully understood. Here, we investigate the interplay between entanglement and thermodynamics, particularly in the context of local cooling processes. We introduce and develop the framework of Gibbs-preserving local operations and classical communication. Within this framework, we explore strategies enabling remote parties to effectively cool their local systems to the ground state. Our analysis is centered on scenarios where only a single copy of a quantum state is accessible, with the ideal performance defined by the highest possible fidelity to the ground state achievable under these constraints. We focus on systems with fully degenerate local Hamiltonians, where local cooling aligns with the extraction of local purity. In this context, we establish a powerful link between the efficiency of local purity extraction and the degree of entanglement present in the system, a concept we define as $textit{purity-entanglement complementarity}$. Moreover, we demonstrate that in many pertinent scenarios, the optimal performance can be precisely determined through semidefinite programming techniques. Our findings open doors to various practical applications, including techniques for entanglement detection and estimation. We demonstrate this by evaluating the amount of entanglement for a class of bound entangled states.
{"title":"Local Purity Distillation in Quantum Systems: Exploring the Complementarity Between Purity and Entanglement","authors":"Ray Ganardi, Piotr Masajada, Moein Naseri, Alexander Streltsov","doi":"10.22331/q-2025-03-20-1666","DOIUrl":"https://doi.org/10.22331/q-2025-03-20-1666","url":null,"abstract":"Quantum thermodynamics and quantum entanglement represent two pivotal quantum resource theories with significant relevance in quantum information science. Despite their importance, the intricate relationship between these two theories is still not fully understood. Here, we investigate the interplay between entanglement and thermodynamics, particularly in the context of local cooling processes. We introduce and develop the framework of Gibbs-preserving local operations and classical communication. Within this framework, we explore strategies enabling remote parties to effectively cool their local systems to the ground state. Our analysis is centered on scenarios where only a single copy of a quantum state is accessible, with the ideal performance defined by the highest possible fidelity to the ground state achievable under these constraints. We focus on systems with fully degenerate local Hamiltonians, where local cooling aligns with the extraction of local purity. In this context, we establish a powerful link between the efficiency of local purity extraction and the degree of entanglement present in the system, a concept we define as $textit{purity-entanglement complementarity}$. Moreover, we demonstrate that in many pertinent scenarios, the optimal performance can be precisely determined through semidefinite programming techniques. Our findings open doors to various practical applications, including techniques for entanglement detection and estimation. We demonstrate this by evaluating the amount of entanglement for a class of bound entangled states.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"92 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143661282","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-03-20DOI: 10.22331/q-2025-03-20-1664
Patrick Hayden, Jinzhao Wang
The Bekenstein bound posits a maximum entropy for matter with finite energy confined to a spatial region. It is often interpreted as a fundamental limit on the information that can be stored by physical objects. In this work, we test this interpretation by asking whether the Bekenstein bound imposes constraints on a channel's communication capacity, a context in which information can be given a mathematically rigorous and operationally meaningful definition. We study specifically the $textit{Unruh channel}$ that describes a stationary Alice exciting different species of free scalar fields to send information to an accelerating Bob, who is confined to a Rindler wedge and exposed to the noise of Unruh radiation. We show that the classical and quantum capacities of the Unruh channel obey the Bekenstein bound that pertains to the decoder Bob. In contrast, even at high temperatures, the Unruh channel can transmit a significant number of $textit{zero-bits}$, which are quantum communication resources that can be used for quantum identification and many other primitive protocols. Therefore, unlike classical bits and qubits, zero-bits and their associated information processing capability are generally not constrained by the Bekenstein bound. However, we further show that when both the encoder and the decoder are restricted, the Bekenstein bound does constrain the channel capacities, including the zero-bit capacity.
{"title":"What exactly does Bekenstein bound?","authors":"Patrick Hayden, Jinzhao Wang","doi":"10.22331/q-2025-03-20-1664","DOIUrl":"https://doi.org/10.22331/q-2025-03-20-1664","url":null,"abstract":"The Bekenstein bound posits a maximum entropy for matter with finite energy confined to a spatial region. It is often interpreted as a fundamental limit on the information that can be stored by physical objects. In this work, we test this interpretation by asking whether the Bekenstein bound imposes constraints on a channel's communication capacity, a context in which information can be given a mathematically rigorous and operationally meaningful definition. We study specifically the $textit{Unruh channel}$ that describes a stationary Alice exciting different species of free scalar fields to send information to an accelerating Bob, who is confined to a Rindler wedge and exposed to the noise of Unruh radiation. We show that the classical and quantum capacities of the Unruh channel obey the Bekenstein bound that pertains to the decoder Bob. In contrast, even at high temperatures, the Unruh channel can transmit a significant number of $textit{zero-bits}$, which are quantum communication resources that can be used for quantum identification and many other primitive protocols. Therefore, unlike classical bits and qubits, zero-bits and their associated information processing capability are generally not constrained by the Bekenstein bound. However, we further show that when both the encoder and the decoder are restricted, the Bekenstein bound does constrain the channel capacities, including the zero-bit capacity.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"12 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143661279","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-03-20DOI: 10.22331/q-2025-03-20-1663
Bence Bakó, Adam Glos, Özlem Salehi, Zoltán Zimborás
Current state-of-the-art quantum optimization algorithms require representing the original problem as a binary optimization problem, which is then converted into an equivalent cost Hamiltonian suitable for the quantum device. Implementing each term of the cost Hamiltonian separately often results in high redundancy, significantly increasing the resources required. Instead, we propose to design classical programs for computing the objective function and certifying the constraints, and later compile them to quantum circuits, eliminating the reliance on the binary optimization problem representation. This results in a new variant of the Quantum Approximate Optimization Algorithm (QAOA), which we name the Program-based QAOA (Prog-QAOA). We exploit this idea for optimization tasks like the Travelling Salesman Problem and Max-$K$-Cut and obtain circuits that are near-optimal with respect to all relevant cost measures, e.g., number of qubits, gates, and circuit depth. While we demonstrate the power of Prog-QAOA only for a particular set of paradigmatic problems, our approach is conveniently applicable to generic optimization problems.
{"title":"Prog-QAOA: Framework for resource-efficient quantum optimization through classical programs","authors":"Bence Bakó, Adam Glos, Özlem Salehi, Zoltán Zimborás","doi":"10.22331/q-2025-03-20-1663","DOIUrl":"https://doi.org/10.22331/q-2025-03-20-1663","url":null,"abstract":"Current state-of-the-art quantum optimization algorithms require representing the original problem as a binary optimization problem, which is then converted into an equivalent cost Hamiltonian suitable for the quantum device. Implementing each term of the cost Hamiltonian separately often results in high redundancy, significantly increasing the resources required. Instead, we propose to design classical programs for computing the objective function and certifying the constraints, and later compile them to quantum circuits, eliminating the reliance on the binary optimization problem representation. This results in a new variant of the Quantum Approximate Optimization Algorithm (QAOA), which we name the Program-based QAOA (Prog-QAOA). We exploit this idea for optimization tasks like the Travelling Salesman Problem and Max-$K$-Cut and obtain circuits that are near-optimal with respect to all relevant cost measures, e.g., number of qubits, gates, and circuit depth. While we demonstrate the power of Prog-QAOA only for a particular set of paradigmatic problems, our approach is conveniently applicable to generic optimization problems.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"44 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143661273","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-03-14DOI: 10.22331/q-2025-03-14-1662
Ryo Takakura, Kei Morisue, Issei Watanabe, Gen Kimura
The Bell theorem is explored in terms of a trade-off relation between underlying assumptions within the hidden variable model framework. In this paper, recognizing the incorporation of hidden variables as one of the fundamental assumptions, we propose a measure termed `hidden information' taking account of their distribution. This measure quantifies the number of hidden variables that essentially contribute to the empirical statistics. For factorizable models, hidden variable models that satisfy `locality' without adhering to the measurement independence criterion, we derive novel relaxed Bell-Clauser-Horne-Shimony-Holt (Bell-CHSH) inequalities. These inequalities elucidate trade-off relations between measurement dependence and hidden information in the CHSH scenario. It is also revealed that the relation gives a necessary and sufficient condition for the measures to be realized by a factorizable model.
{"title":"Trade-off relations between measurement dependence and hiddenness for separable hidden variable models","authors":"Ryo Takakura, Kei Morisue, Issei Watanabe, Gen Kimura","doi":"10.22331/q-2025-03-14-1662","DOIUrl":"https://doi.org/10.22331/q-2025-03-14-1662","url":null,"abstract":"The Bell theorem is explored in terms of a trade-off relation between underlying assumptions within the hidden variable model framework. In this paper, recognizing the incorporation of hidden variables as one of the fundamental assumptions, we propose a measure termed `hidden information' taking account of their distribution. This measure quantifies the number of hidden variables that essentially contribute to the empirical statistics. For factorizable models, hidden variable models that satisfy `locality' without adhering to the measurement independence criterion, we derive novel relaxed Bell-Clauser-Horne-Shimony-Holt (Bell-CHSH) inequalities. These inequalities elucidate trade-off relations between measurement dependence and hidden information in the CHSH scenario. It is also revealed that the relation gives a necessary and sufficient condition for the measures to be realized by a factorizable model.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"10 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143618707","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-03-12DOI: 10.22331/q-2025-03-12-1659
Evandro C. R. Rosa, Eduardo I. Duzzioni, Rafael de Santiago
This paper presents novel methods for optimizing multi-controlled quantum gates, which naturally arise in high-level quantum programming. Our primary approach involves rewriting $U(2)$ gates as $SU(2)$ gates, utilizing one auxiliary qubit for phase correction. This reduces the number of CNOT gates required to decompose any multi-controlled quantum gate from $O(n^2)$ to at most $32n$. Additionally, we can reduce the number of CNOTs for multi-controlled Pauli gates from $16n$ to $12n$ and propose an optimization to reduce the number of controlled gates in high-level quantum programming. We have implemented these optimizations in the Ket quantum programming platform and demonstrated significant reductions in the number of gates. For instance, for a Grover's algorithm layer with 114 qubits, we achieved a reduction in the number of CNOTs from 101,252 to 2,684. This reduction in the number of gates significantly impacts the execution time of quantum algorithms, thereby enhancing the feasibility of executing them on NISQ computers.
{"title":"Optimizing Gate Decomposition for High-Level Quantum Programming","authors":"Evandro C. R. Rosa, Eduardo I. Duzzioni, Rafael de Santiago","doi":"10.22331/q-2025-03-12-1659","DOIUrl":"https://doi.org/10.22331/q-2025-03-12-1659","url":null,"abstract":"This paper presents novel methods for optimizing multi-controlled quantum gates, which naturally arise in high-level quantum programming. Our primary approach involves rewriting $U(2)$ gates as $SU(2)$ gates, utilizing one auxiliary qubit for phase correction. This reduces the number of CNOT gates required to decompose any multi-controlled quantum gate from $O(n^2)$ to at most $32n$. Additionally, we can reduce the number of CNOTs for multi-controlled Pauli gates from $16n$ to $12n$ and propose an optimization to reduce the number of controlled gates in high-level quantum programming. We have implemented these optimizations in the Ket quantum programming platform and demonstrated significant reductions in the number of gates. For instance, for a Grover's algorithm layer with 114 qubits, we achieved a reduction in the number of CNOTs from 101,252 to 2,684. This reduction in the number of gates significantly impacts the execution time of quantum algorithms, thereby enhancing the feasibility of executing them on NISQ computers.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"56 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143599762","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-03-12DOI: 10.22331/q-2025-03-12-1661
Colin Read, Eduardo Serrano-Ensástiga, John Martin
In the NISQ era, where quantum information processing is hindered by the decoherence and dissipation of elementary quantum systems, developing new protocols to extend the lifetime of quantum states is of considerable practical and theoretical importance. A well-known technique, known as dynamical decoupling, uses a carefully designed sequence of pulses applied to a quantum system, such as a spin-$j$ (which represents a qudit with $d=2j+1$ levels), to suppress the coupling Hamiltonian between the system and its environment, thereby mitigating dissipation. While dynamical decoupling of qubit systems has been widely studied, the decoupling of qudit systems has been far less explored and often involves complex sequences and operations. In this work, we design efficient decoupling sequences composed solely of global $mathrm{SU}(2)$ rotations and based on tetrahedral, octahedral, and icosahedral point groups, which we call Platonic sequences. We extend the Majorana representation for Hamiltonians to develop a simple framework that establishes the decoupling properties of each Platonic sequence and show its effectiveness on many examples. These sequences are universal in their ability to cancel any type of interaction with the environment for single spin-$j$ with spin quantum number $jleqslant 5/2$, and they are capable of decoupling up to $5$-body interactions in an ensemble of interacting spin-$1/2$ with only global pulses, provided that the interaction Hamiltonian has no isotropic component, with the exception of the global identity. We also discuss their inherent robustness to finite pulse duration and a wide range of pulse errors, as well as their potential application as building blocks for dynamically corrected gates.
{"title":"Platonic dynamical decoupling sequences for interacting spin systems","authors":"Colin Read, Eduardo Serrano-Ensástiga, John Martin","doi":"10.22331/q-2025-03-12-1661","DOIUrl":"https://doi.org/10.22331/q-2025-03-12-1661","url":null,"abstract":"In the NISQ era, where quantum information processing is hindered by the decoherence and dissipation of elementary quantum systems, developing new protocols to extend the lifetime of quantum states is of considerable practical and theoretical importance. A well-known technique, known as dynamical decoupling, uses a carefully designed sequence of pulses applied to a quantum system, such as a spin-$j$ (which represents a qudit with $d=2j+1$ levels), to suppress the coupling Hamiltonian between the system and its environment, thereby mitigating dissipation. While dynamical decoupling of qubit systems has been widely studied, the decoupling of qudit systems has been far less explored and often involves complex sequences and operations. In this work, we design efficient decoupling sequences composed solely of global $mathrm{SU}(2)$ rotations and based on tetrahedral, octahedral, and icosahedral point groups, which we call Platonic sequences. We extend the Majorana representation for Hamiltonians to develop a simple framework that establishes the decoupling properties of each Platonic sequence and show its effectiveness on many examples. These sequences are universal in their ability to cancel any type of interaction with the environment for single spin-$j$ with spin quantum number $jleqslant 5/2$, and they are capable of decoupling up to $5$-body interactions in an ensemble of interacting spin-$1/2$ with only global pulses, provided that the interaction Hamiltonian has no isotropic component, with the exception of the global identity. We also discuss their inherent robustness to finite pulse duration and a wide range of pulse errors, as well as their potential application as building blocks for dynamically corrected gates.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"13 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143599647","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-03-12DOI: 10.22331/q-2025-03-12-1660
Shaojun Wu, Shan Jin, Dingding Wen, Donghong Han, Xiaoting Wang
Quantum reinforcement learning (QRL) is a promising paradigm for near-term quantum devices. While existing QRL methods have shown success in discrete action spaces, extending these techniques to continuous domains is challenging due to the curse of dimensionality introduced by discretization. To overcome this limitation, we introduce a quantum Deep Deterministic Policy Gradient (DDPG) algorithm that efficiently addresses both classical and quantum sequential decision problems in continuous action spaces. Moreover, our approach facilitates single-shot quantum state generation: a one-time optimization produces a model that outputs the control sequence required to drive a fixed initial state to any desired target state. In contrast, conventional quantum control methods demand separate optimization for each target state. We demonstrate the effectiveness of our method through simulations and discuss its potential applications in quantum control.
{"title":"Quantum reinforcement learning in continuous action space","authors":"Shaojun Wu, Shan Jin, Dingding Wen, Donghong Han, Xiaoting Wang","doi":"10.22331/q-2025-03-12-1660","DOIUrl":"https://doi.org/10.22331/q-2025-03-12-1660","url":null,"abstract":"Quantum reinforcement learning (QRL) is a promising paradigm for near-term quantum devices. While existing QRL methods have shown success in discrete action spaces, extending these techniques to continuous domains is challenging due to the curse of dimensionality introduced by discretization. To overcome this limitation, we introduce a quantum Deep Deterministic Policy Gradient (DDPG) algorithm that efficiently addresses both classical and quantum sequential decision problems in continuous action spaces. Moreover, our approach facilitates single-shot quantum state generation: a one-time optimization produces a model that outputs the control sequence required to drive a fixed initial state to any desired target state. In contrast, conventional quantum control methods demand separate optimization for each target state. We demonstrate the effectiveness of our method through simulations and discuss its potential applications in quantum control.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"30 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143599648","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-03-10DOI: 10.22331/q-2025-03-10-1658
Alberto Manzano, David Dechant, Jordi Tura, Vedran Dunjko
Parametrized quantum circuits (PQC) are quantum circuits which consist of both fixed and parametrized gates. In recent approaches to quantum machine learning (QML), PQCs are essentially ubiquitous and play the role analogous to classical neural networks. They are used to learn various types of data, with an underlying expectation that if the PQC is made sufficiently deep, and the data plentiful, the generalization error will vanish, and the model will capture the essential features of the distribution. While there exist results proving the approximability of square-integrable functions by PQCs under the $L^2$ distance, the approximation for other function spaces and under other distances has been less explored. In this work we show that PQCs can approximate the space of continuous functions, $p$-integrable functions and the $H^k$ Sobolev spaces under specific distances. Moreover, we develop generalization bounds that connect different function spaces and distances. These results provide a theoretical basis for different applications of PQCs, for example for solving differential equations. Furthermore, they provide us with new insight on the role of the data normalization in PQCs and of loss functions which better suit the specific needs of the users.
{"title":"Approximation and Generalization Capacities of Parametrized Quantum Circuits for Functions in Sobolev Spaces","authors":"Alberto Manzano, David Dechant, Jordi Tura, Vedran Dunjko","doi":"10.22331/q-2025-03-10-1658","DOIUrl":"https://doi.org/10.22331/q-2025-03-10-1658","url":null,"abstract":"Parametrized quantum circuits (PQC) are quantum circuits which consist of both fixed and parametrized gates. In recent approaches to quantum machine learning (QML), PQCs are essentially ubiquitous and play the role analogous to classical neural networks. They are used to learn various types of data, with an underlying expectation that if the PQC is made sufficiently deep, and the data plentiful, the generalization error will vanish, and the model will capture the essential features of the distribution. While there exist results proving the approximability of square-integrable functions by PQCs under the $L^2$ distance, the approximation for other function spaces and under other distances has been less explored. In this work we show that PQCs can approximate the space of continuous functions, $p$-integrable functions and the $H^k$ Sobolev spaces under specific distances. Moreover, we develop generalization bounds that connect different function spaces and distances. These results provide a theoretical basis for different applications of PQCs, for example for solving differential equations. Furthermore, they provide us with new insight on the role of the data normalization in PQCs and of loss functions which better suit the specific needs of the users.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"8 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143582689","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-03-10DOI: 10.22331/q-2025-03-10-1657
Andrés González Lorente, Pablo V. Parellada, Miguel Castillo-Celeita, Mateus Araújo
Computing key rates in quantum key distribution (QKD) numerically is essential to unlock more powerful protocols, that use more sophisticated measurement bases or quantum systems of higher dimension. It is a difficult optimization problem, that depends on minimizing a convex non-linear function: the (quantum) relative entropy. Standard conic optimization techniques have for a long time been unable to handle the relative entropy cone, as it is a non-symmetric cone, and the standard algorithms can only handle symmetric ones. Recently, however, a practical algorithm has been discovered for optimizing over non-symmetric cones, including the relative entropy. Here we adapt this algorithm to the problem of computation of key rates, obtaining an efficient technique for lower bounding them. In comparison to previous techniques it has the advantages of flexibility, ease of use, and above all performance.
{"title":"Quantum key distribution rates from non-symmetric conic optimization","authors":"Andrés González Lorente, Pablo V. Parellada, Miguel Castillo-Celeita, Mateus Araújo","doi":"10.22331/q-2025-03-10-1657","DOIUrl":"https://doi.org/10.22331/q-2025-03-10-1657","url":null,"abstract":"Computing key rates in quantum key distribution (QKD) numerically is essential to unlock more powerful protocols, that use more sophisticated measurement bases or quantum systems of higher dimension. It is a difficult optimization problem, that depends on minimizing a convex non-linear function: the (quantum) relative entropy. Standard conic optimization techniques have for a long time been unable to handle the relative entropy cone, as it is a non-symmetric cone, and the standard algorithms can only handle symmetric ones. Recently, however, a practical algorithm has been discovered for optimizing over non-symmetric cones, including the relative entropy. Here we adapt this algorithm to the problem of computation of key rates, obtaining an efficient technique for lower bounding them. In comparison to previous techniques it has the advantages of flexibility, ease of use, and above all performance.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"1 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143582688","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}