Pasar al contenido principal

TECNOLOGIAS DE COMUNICACION, CODIFICACION Y PROCESADO PARA REDES CLASICAS-CUANTICAS DE PROXIMA GENERACION

PID2022-137099NB-C41

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal para Impulsar la Investigación Científico-Técnica y su Transferencia
Subprograma Subprograma Estatal de Generación de Conocimiento
Convocatoria Proyectos de I+D+i (Generación de Conocimiento y Retos Investigación)
Año convocatoria 2022
Plan Estatal 2021-2023 Plan Estatal de Investigación Científica y Técnica y de Innovación
Centro beneficiario UNIVERSITAT POLITECNICA DE CATALUNYA

Resultados relacionados

Resultados totales (Incluyendo duplicados): 8
Encontrada(s) 1 página(s)

UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

On the error exponent distribution of code ensembles over classical-quantum channels

  • Cocco, Giuseppe|||0000-0003-1720-8986
  • Rodríguez Fonollosa, Javier|||0000-0002-0136-2586
We show that the probability distribution of the error exponent in i.i.d. code ensembles over classical-quantum (CQ) channels with arbitrary output states accumulates above a threshold that is strictly larger than the CQ random coding exponent (RCE) at low rates, while coinciding with it at rates close to the mutual information of the channel. This result, combined with the work by Dalai [1] and the recent ones by Renes [2] and Li and Yang [3], implies that the ensemble distribution of error exponents concentrates around the CQ RCE in the high rate regime. Moreover, in the same rate regime the threshold we derive coincides with the ensemble-average of the exponent, that is, the typical random coding (TRC) exponent [4]., This work was supported in part by the Ramon y Cajal fellowship program, grant RYC2021-033908-I, and grant PID2022-137099NB-C41 both funded by MCIN/AEI/10.13039/501100011033/FEDER, the European Union “NextGenerationEU” Recovery Plan for Europe, and by grant 2021 SGR 01033 funded by AGAUR, Departament de Recerca i Universitats de la Generalitat de Catalunya 10.13039/501100002809., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Blind learning of the optimal fusion rule in wireless sensor networks

  • Pérez Arriaga, Jesús
  • Santamaria Caballero, Ignacio
  • Pagès Zamora, Alba Maria|||0000-0002-7087-7014
This work presents a general framework for blindly estimating the sensor parameters of decision-fusion systems over wireless sensor networks (WSNs). The sensors report their binary decisions to a fusion center (FC) through parallel binary symmetric channels. Then, the FC makes the final decision by combining the noisy sensor decisions according to a certain fusion rule. We present an algorithm for the FC to blindly estimate the sensor parameters from the noisy sensor decisions received after a number of sensing periods. The algorithm covers a wide variety of situations that may arise in WSNs. For example, the algorithm is applicable when the FC knows in advance some of the parameters of some sensors, when it knows the true hypothesis for a subset of sensing periods, or when only a subset of sensors communicates their decisions in each sensing period. Based on the estimates of the system parameters, optimal channel-aware fusion rules are derived considering the minimum Bayes risk criterion. Simulation results show that, after sufficient sensing periods, the estimates of the WSN parameters are accurate enough for the fusion rule to exhibit near-optimal detection performance., This work has been funded by MCIN/AEI/10.13039/501100011033 under grants PID2022-137099NB-C41 and PID2022-137099NB-C43., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Bounds in sequential unambiguous discrimination of multiple pure quantum states

  • Pérez Guijarro, Jordi
  • Pagès Zamora, Alba Maria|||0000-0002-7087-7014
  • Rodríguez Fonollosa, Javier|||0000-0002-0136-2586
Sequential methods for quantum hypothesis testing offer significant advantages over fixed-length approaches, which rely on a predefined number of state copies. Despite their potential, these methods remain underexplored for unambiguous discrimination. In this work, we derive performance bounds for such methods when applied to the discrimination of a set of pure states. The performance is evaluated based on the expected number of copies required. We establish a lower bound applicable to any sequential method and an upper bound on the optimal sequential method. The upper bound is derived using a novel and simple non-adaptive method. Importantly, the gap between these bounds is minimal, scaling logarithmically with the number of distinct states., This work has been funded by grants PID2022-137099NB-C41, PID2019-104958RB-C41 funded by MCIN/AEI/10.13039/501100011033 and FSE+ and by grant 2021 SGR 01033 funded by AGAUR, Dept. de Recerca i Universitats de la Generalitat de Catalunya 10.13039/501100002809., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Extension of Clifford Data Regression methods for quantum error mitigation

  • Pérez Guijarro, Jordi
  • Pagès Zamora, Alba Maria|||0000-0002-7087-7014
  • Rodríguez Fonollosa, Javier|||0000-0002-0136-2586
To address the challenge posed by noise in real quantum devices, quantum error mitigation techniques play a crucial role. These techniques are resource-efficient, making them suitable for implementation in noisy intermediate-scale quantum devices, unlike the more resource-intensive quantum error correction codes. A notable example of such a technique is Clifford Data Regression, which employs a supervised learning approach. This work investigates two variants of this technique, both of which introduce a non-trivial set of gates into the original circuit. The first variant uses multiple copies of the original circuit, while the second adds a layer of single-qubit rotations. Different characteristics of these methods are analyzed theoretically, such as their complexity, or the scaling of the error with various parameters. Additionally, the performance of these methods is evaluated through numerical experiments, demonstrating a reduction in root mean square error., This work has been funded by grants PID2022-137099NB-C41, PID2019-104958RB-C41 funded by MCIN/AEI/10.13039/501100011033 and FSE+ and by grant 2021 SGR 01033 funded by AGAUR, Dept. de Recerca i Universitats de la Generalitat de Catalunya 10.13039/501100002809., Peer Reviewed
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Bounds in sequential unambiguous discrimination of multiple pure quantum states

  • Pérez Guijarro, Jordi
  • Pagès Zamora, Alba Maria
  • Rodríguez Fonollosa, Javier
Sequential methods for quantum hypothesis testing offer significant advantages over fixed-length approaches, which rely on a predefined number of state copies. Despite their potential, these methods remain underexplored for unambiguous discrimination. In this work, we derive performance bounds for such methods when applied to the discrimination of a set of pure states. The performance is evaluated based on the expected number of copies required. We establish a lower bound applicable to any sequential method and an upper bound on the optimal sequential method. The upper bound is derived using a novel and simple non-adaptive method. Importantly, the gap between these bounds is minimal, scaling logarithmically with the number of distinct states., This work has been funded by grants PID2022-137099NB-C41, PID2019-104958RB-C41 funded by MCIN/AEI/10.13039/501100011033 and FSE+ and by grant 2021 SGR 01033 funded by AGAUR, Dept. de Recerca i Universitats de la Generalitat de Catalunya 10.13039/501100002809., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Extension of Clifford Data Regression methods for quantum error mitigation

  • Pérez Guijarro, Jordi
  • Pagès Zamora, Alba Maria
  • Rodríguez Fonollosa, Javier
To address the challenge posed by noise in real quantum devices, quantum error mitigation techniques play a crucial role. These techniques are resource-efficient, making them suitable for implementation in noisy intermediate-scale quantum devices, unlike the more resource-intensive quantum error correction codes. A notable example of such a technique is Clifford Data Regression, which employs a supervised learning approach. This work investigates two variants of this technique, both of which introduce a non-trivial set of gates into the original circuit. The first variant uses multiple copies of the original circuit, while the second adds a layer of single-qubit rotations. Different characteristics of these methods are analyzed theoretically, such as their complexity, or the scaling of the error with various parameters. Additionally, the performance of these methods is evaluated through numerical experiments, demonstrating a reduction in root mean square error., This work has been funded by grants PID2022-137099NB-C41, PID2019-104958RB-C41 funded by MCIN/AEI/10.13039/501100011033 and FSE+ and by grant 2021 SGR 01033 funded by AGAUR, Dept. de Recerca i Universitats de la Generalitat de Catalunya 10.13039/501100002809., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

On the error exponent distribution of code ensembles over classical-quantum channels

  • Cocco, Giuseppe
  • Rodríguez Fonollosa, Javier
We show that the probability distribution of the error exponent in i.i.d. code ensembles over classical-quantum (CQ) channels with arbitrary output states accumulates above a threshold that is strictly larger than the CQ random coding exponent (RCE) at low rates, while coinciding with it at rates close to the mutual information of the channel. This result, combined with the work by Dalai [1] and the recent ones by Renes [2] and Li and Yang [3], implies that the ensemble distribution of error exponents concentrates around the CQ RCE in the high rate regime. Moreover, in the same rate regime the threshold we derive coincides with the ensemble-average of the exponent, that is, the typical random coding (TRC) exponent [4]., This work was supported in part by the Ramon y Cajal fellowship program, grant RYC2021-033908-I, and grant PID2022-137099NB-C41 both funded by MCIN/AEI/10.13039/501100011033/FEDER, the European Union “NextGenerationEU” Recovery Plan for Europe, and by grant 2021 SGR 01033 funded by AGAUR, Departament de Recerca i Universitats de la Generalitat de Catalunya 10.13039/501100002809., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Blind learning of the optimal fusion rule in wireless sensor networks

  • Pérez Arriaga, Jesús
  • Santamaria Caballero, Ignacio
  • Pagès Zamora, Alba Maria
This work presents a general framework for blindly estimating the sensor parameters of decision-fusion systems over wireless sensor networks (WSNs). The sensors report their binary decisions to a fusion center (FC) through parallel binary symmetric channels. Then, the FC makes the final decision by combining the noisy sensor decisions according to a certain fusion rule. We present an algorithm for the FC to blindly estimate the sensor parameters from the noisy sensor decisions received after a number of sensing periods. The algorithm covers a wide variety of situations that may arise in WSNs. For example, the algorithm is applicable when the FC knows in advance some of the parameters of some sensors, when it knows the true hypothesis for a subset of sensing periods, or when only a subset of sensors communicates their decisions in each sensing period. Based on the estimates of the system parameters, optimal channel-aware fusion rules are derived considering the minimum Bayes risk criterion. Simulation results show that, after sufficient sensing periods, the estimates of the WSN parameters are accurate enough for the fusion rule to exhibit near-optimal detection performance., This work has been funded by MCIN/AEI/10.13039/501100011033 under grants PID2022-137099NB-C41 and PID2022-137099NB-C43., Peer Reviewed, Postprint (published version)