Pub Date : 2025-01-28DOI: 10.22331/q-2025-01-28-1614
Camille L Latune, Cyril Elouard
Considering a general microscopic model for a quantum measuring apparatus comprising a quantum probe coupled to a thermal bath, we analyze the energetic resources necessary for the realization of a quantum measurement, which includes the creation of system-apparatus correlations, the irreversible transition to a statistical mixture of definite outcomes, and the apparatus resetting. Crucially, we do not resort to another quantum measurement to capture the emergence of objective measurement results, but rather exploit the properties of the thermal bath which redundantly records the measurement result in its degrees of freedom, naturally implementing the paradigm of quantum Darwinism. In practice, this model allows us to perform a quantitative thermodynamic analysis of the measurement process. From the expression of the second law, we show how the minimal required work depends on the energy variation of the system being measured plus information-theoretic quantities characterizing the performance of the measurement – efficiency and completeness. Additionally, we show that it is possible to perform a thermodynamically reversible measurement, thus reaching the minimal work expenditure, and provide the corresponding protocol. Finally, for finite-time measurement protocols, we illustrate the increasing work cost induced by rising entropy production inherent in finite-time thermodynamic processes. This highlights an emerging trade-off between velocity of the measurement and work cost, on top of a trade-off between efficiency of the measurement and work cost. We apply those findings to bring new insights in the thermodynamic balance of the measurement-powered quantum engines.
{"title":"A thermodynamically consistent approach to the energy costs of quantum measurements","authors":"Camille L Latune, Cyril Elouard","doi":"10.22331/q-2025-01-28-1614","DOIUrl":"https://doi.org/10.22331/q-2025-01-28-1614","url":null,"abstract":"Considering a general microscopic model for a quantum measuring apparatus comprising a quantum probe coupled to a thermal bath, we analyze the energetic resources necessary for the realization of a quantum measurement, which includes the creation of system-apparatus correlations, the irreversible transition to a statistical mixture of definite outcomes, and the apparatus resetting. Crucially, we do not resort to another quantum measurement to capture the emergence of objective measurement results, but rather exploit the properties of the thermal bath which redundantly records the measurement result in its degrees of freedom, naturally implementing the paradigm of quantum Darwinism. In practice, this model allows us to perform a quantitative thermodynamic analysis of the measurement process. From the expression of the second law, we show how the minimal required work depends on the energy variation of the system being measured plus information-theoretic quantities characterizing the performance of the measurement – efficiency and completeness. Additionally, we show that it is possible to perform a thermodynamically reversible measurement, thus reaching the minimal work expenditure, and provide the corresponding protocol. Finally, for finite-time measurement protocols, we illustrate the increasing work cost induced by rising entropy production inherent in finite-time thermodynamic processes. This highlights an emerging trade-off between velocity of the measurement and work cost, on top of a trade-off between efficiency of the measurement and work cost. We apply those findings to bring new insights in the thermodynamic balance of the measurement-powered quantum engines.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"35 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143049903","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-01-27DOI: 10.22331/q-2025-01-27-1609
Seok-Hyung Lee, Andrew Li, Stephen D. Bartlett
Two-dimensional color codes are a promising candidate for fault-tolerant quantum computing, as they have high encoding rates, transversal implementation of logical Clifford gates, and resource-efficient magic state preparation schemes. However, decoding color codes presents a significant challenge due to their structure, where elementary errors violate three checks instead of just two (a key feature in surface code decoding), and the complexity of extracting syndrome is greater. We introduce an efficient color-code decoder that tackles these issues by combining two matching decoders for each color, generalized to handle circuit-level noise by employing detector error models. We provide comprehensive analyses of the decoder, covering its threshold and sub-threshold scaling both for bit-flip noise with ideal measurements and for circuit-level noise. Our simulations reveal that this decoding strategy nearly reaches the best possible scaling of logical failure ($p_mathrm{fail} sim p^{d/2}$) for both noise models, where $p$ is the noise strength, in the regime of interest for fault-tolerant quantum computing. While its noise thresholds are comparable with other matching-based decoders for color codes ($8.2%$ for bit-flip noise and $0.46%$ for circuit-level noise), the scaling of logical failure rates below threshold significantly outperforms the best matching-based decoders.
{"title":"Color code decoder with improved scaling for correcting circuit-level noise","authors":"Seok-Hyung Lee, Andrew Li, Stephen D. Bartlett","doi":"10.22331/q-2025-01-27-1609","DOIUrl":"https://doi.org/10.22331/q-2025-01-27-1609","url":null,"abstract":"Two-dimensional color codes are a promising candidate for fault-tolerant quantum computing, as they have high encoding rates, transversal implementation of logical Clifford gates, and resource-efficient magic state preparation schemes. However, decoding color codes presents a significant challenge due to their structure, where elementary errors violate three checks instead of just two (a key feature in surface code decoding), and the complexity of extracting syndrome is greater. We introduce an efficient color-code decoder that tackles these issues by combining two matching decoders for each color, generalized to handle circuit-level noise by employing detector error models. We provide comprehensive analyses of the decoder, covering its threshold and sub-threshold scaling both for bit-flip noise with ideal measurements and for circuit-level noise. Our simulations reveal that this decoding strategy nearly reaches the best possible scaling of logical failure ($p_mathrm{fail} sim p^{d/2}$) for both noise models, where $p$ is the noise strength, in the regime of interest for fault-tolerant quantum computing. While its noise thresholds are comparable with other matching-based decoders for color codes ($8.2%$ for bit-flip noise and $0.46%$ for circuit-level noise), the scaling of logical failure rates below threshold significantly outperforms the best matching-based decoders.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"121 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143044153","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-01-27DOI: 10.22331/q-2025-01-27-1611
Martin Sandfuchs, Marcus Haberland, V. Vilasini, Ramona Wolf
The design of quantum protocols for secure key generation poses many challenges: On the one hand, they need to be practical concerning experimental realisations. On the other hand, their theoretical description must be simple enough to allow for a security proof against all possible attacks. Often, these two requirements are in conflict with each other, and the differential phase shift (DPS) QKD protocol exemplifies these difficulties: It is designed to be implementable with current optical telecommunication technology, which, for this protocol, comes at the cost that many standard security proof techniques do not apply to it. After about 20 years since its invention, this work presents the first full security proof of DPS QKD against general attacks, including finite-size effects. The proof combines techniques from quantum information theory, quantum optics, and relativity. We first give a security proof of a QKD protocol whose security stems from relativistic constraints. We then show that security of DPS QKD can be reduced to security of the relativistic protocol. In addition, we show that coherent attacks on the DPS protocol are, in fact, stronger than collective attacks. Our results have broad implications for the development of secure and reliable quantum communication technologies, as they shed light on the range of applicability of state-of-the-art security proof techniques.
{"title":"Security of differential phase shift QKD from relativistic principles","authors":"Martin Sandfuchs, Marcus Haberland, V. Vilasini, Ramona Wolf","doi":"10.22331/q-2025-01-27-1611","DOIUrl":"https://doi.org/10.22331/q-2025-01-27-1611","url":null,"abstract":"The design of quantum protocols for secure key generation poses many challenges: On the one hand, they need to be practical concerning experimental realisations. On the other hand, their theoretical description must be simple enough to allow for a security proof against all possible attacks. Often, these two requirements are in conflict with each other, and the differential phase shift (DPS) QKD protocol exemplifies these difficulties: It is designed to be implementable with current optical telecommunication technology, which, for this protocol, comes at the cost that many standard security proof techniques do not apply to it. After about 20 years since its invention, this work presents the first full security proof of DPS QKD against general attacks, including finite-size effects. The proof combines techniques from quantum information theory, quantum optics, and relativity. We first give a security proof of a QKD protocol whose security stems from relativistic constraints. We then show that security of DPS QKD can be reduced to security of the relativistic protocol. In addition, we show that coherent attacks on the DPS protocol are, in fact, stronger than collective attacks. Our results have broad implications for the development of secure and reliable quantum communication technologies, as they shed light on the range of applicability of state-of-the-art security proof techniques.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"38 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143044155","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-01-27DOI: 10.22331/q-2025-01-27-1610
Andrea Calcinari, Steffen Gielen
Group field theory posits that spacetime is emergent and is hence defined without any background notion of space or time; dynamical questions are formulated in relational terms, in particular using (scalar) matter degrees of freedom as time. Unlike in canonical quantisation of gravitational systems, there is no obvious notion of coordinate transformations or constraints, and established quantisation methods cannot be directly applied. As a result, different canonical formalisms for group field theory have been discussed in the literature. We address these issues using a parametrised version of group field theory, in which all (geometry and matter) degrees of freedom evolve in a fiducial parameter. There is a constraint associated to the freedom of reparametrisation and the Dirac quantisation programme can be implemented. Using the "trinity of relational dynamics", we show that the resulting "clock-neutral" theory is entirely equivalent to a deparametrised canonical group field theory, interpreted in terms of the Page-Wootters formalism. Our results not only show that the deparametrised quantisation is fully covariant and can be seen as encoding the dynamics of joint quantum matter and geometry degrees of freedom, they also appear to be the first application of the Page-Wootters formalism directly to non-perturbative quantum gravity. We show extensions to a setting in which many independent gauge symmetries are introduced, which connects to the "multi-fingered time" idea in quantum gravity and provides a somewhat novel extension of the Page-Wootters formalism.
{"title":"Relational dynamics and Page-Wootters formalism in group field theory","authors":"Andrea Calcinari, Steffen Gielen","doi":"10.22331/q-2025-01-27-1610","DOIUrl":"https://doi.org/10.22331/q-2025-01-27-1610","url":null,"abstract":"Group field theory posits that spacetime is emergent and is hence defined without any background notion of space or time; dynamical questions are formulated in relational terms, in particular using (scalar) matter degrees of freedom as time. Unlike in canonical quantisation of gravitational systems, there is no obvious notion of coordinate transformations or constraints, and established quantisation methods cannot be directly applied. As a result, different canonical formalisms for group field theory have been discussed in the literature. We address these issues using a parametrised version of group field theory, in which all (geometry and matter) degrees of freedom evolve in a fiducial parameter. There is a constraint associated to the freedom of reparametrisation and the Dirac quantisation programme can be implemented. Using the \"trinity of relational dynamics\", we show that the resulting \"clock-neutral\" theory is entirely equivalent to a deparametrised canonical group field theory, interpreted in terms of the Page-Wootters formalism. Our results not only show that the deparametrised quantisation is fully covariant and can be seen as encoding the dynamics of joint quantum matter and geometry degrees of freedom, they also appear to be the first application of the Page-Wootters formalism directly to non-perturbative quantum gravity. We show extensions to a setting in which many independent gauge symmetries are introduced, which connects to the \"multi-fingered time\" idea in quantum gravity and provides a somewhat novel extension of the Page-Wootters formalism.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"29 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143044154","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-01-27DOI: 10.22331/q-2025-01-27-1608
Andreas Bluhm, Leevi Leppäjärvi, Ion Nechita
In the quest for robust and universal quantum devices, the notion of simulation plays a crucial role, both from a theoretical and from an applied perspective. In this work, we go beyond the simulation of quantum channels and quantum measurements, studying what it means to simulate a collection of measurements, which we call a multimeter. To this end, we first explicitly characterize the completely positive transformations between multimeters. However, not all of these transformations correspond to valid simulations, as otherwise we could create any resource from nothing. For example, the set of transformations includes maps that always prepare the same multimeter regardless of the input, which we call trash-and-prepare. From the perspective of an experimenter with a given multimeter as part of a complicated setup, having to discard the multimeter and using a different one instead is undesirable. We give a new definition of multimeter simulations as transformations that are triviality-preserving, i.e., when given a multimeter consisting of trivial measurements they can only produce another trivial multimeter. In the absence of a quantum ancilla, we then characterize the transformations that are triviality-preserving and the transformations that are trash-and-prepare. Finally, we use these characterizations to compare our new definition of multimeter simulation to three existing ones: classical simulations, compression of multimeters, and compatibility-preserving simulations.
{"title":"On the simulation of quantum multimeters","authors":"Andreas Bluhm, Leevi Leppäjärvi, Ion Nechita","doi":"10.22331/q-2025-01-27-1608","DOIUrl":"https://doi.org/10.22331/q-2025-01-27-1608","url":null,"abstract":"In the quest for robust and universal quantum devices, the notion of simulation plays a crucial role, both from a theoretical and from an applied perspective. In this work, we go beyond the simulation of quantum channels and quantum measurements, studying what it means to simulate a collection of measurements, which we call a multimeter. To this end, we first explicitly characterize the completely positive transformations between multimeters. However, not all of these transformations correspond to valid simulations, as otherwise we could create any resource from nothing. For example, the set of transformations includes maps that always prepare the same multimeter regardless of the input, which we call trash-and-prepare. From the perspective of an experimenter with a given multimeter as part of a complicated setup, having to discard the multimeter and using a different one instead is undesirable. We give a new definition of multimeter simulations as transformations that are triviality-preserving, i.e., when given a multimeter consisting of trivial measurements they can only produce another trivial multimeter. In the absence of a quantum ancilla, we then characterize the transformations that are triviality-preserving and the transformations that are trash-and-prepare. Finally, we use these characterizations to compare our new definition of multimeter simulation to three existing ones: classical simulations, compression of multimeters, and compatibility-preserving simulations.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"25 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143044152","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-01-23DOI: 10.22331/q-2025-01-23-1607
Jong Yeon Lee, Yi-Zhuang You, Cenke Xu
We investigate mixed states exhibiting nontrivial topological features, focusing on symmetry-protected topological (SPT) phases under various types of decoherence. Our findings demonstrate that these systems can retain topological information from the SPT ground state despite decoherence. In the ''doubled Hilbert space,'' we define symmetry-protected topological ensembles (SPT ensembles) and examine boundary anomalies in this space. We generalize the concept of the strange correlator, initially used to diagnose SPT ground states, to identify anomalies in mixed-state density matrices. Through exact calculations of stabilizer Hamiltonians and field theory evaluations, we show that nontrivial features of SPT states persist in two types of strange correlators: type-I and type-II. The type-I strange correlator reveals SPT information that can be efficiently detected and used experimentally, such as in preparing long-range entangled states. The type-II strange correlator encodes the full topological response of the decohered mixed state, reflecting the SPT state's pre-decoherence presence. Our work offers a unified framework for understanding decohered SPT phases from an information-theoretic perspective.
{"title":"Symmetry protected topological phases under decoherence","authors":"Jong Yeon Lee, Yi-Zhuang You, Cenke Xu","doi":"10.22331/q-2025-01-23-1607","DOIUrl":"https://doi.org/10.22331/q-2025-01-23-1607","url":null,"abstract":"We investigate mixed states exhibiting nontrivial topological features, focusing on symmetry-protected topological (SPT) phases under various types of decoherence. Our findings demonstrate that these systems can retain topological information from the SPT ground state despite decoherence. In the ''doubled Hilbert space,'' we define symmetry-protected topological ensembles (SPT ensembles) and examine boundary anomalies in this space. We generalize the concept of the strange correlator, initially used to diagnose SPT ground states, to identify anomalies in mixed-state density matrices. Through exact calculations of stabilizer Hamiltonians and field theory evaluations, we show that nontrivial features of SPT states persist in two types of strange correlators: type-I and type-II. The type-I strange correlator reveals SPT information that can be efficiently detected and used experimentally, such as in preparing long-range entangled states. The type-II strange correlator encodes the full topological response of the decohered mixed state, reflecting the SPT state's pre-decoherence presence. Our work offers a unified framework for understanding decohered SPT phases from an information-theoretic perspective.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"12 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143027178","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-01-23DOI: 10.22331/q-2025-01-23-1606
Zhuo Chen, Guoding Liu, Xiongfeng Ma
Quantum learning tasks often leverage randomly sampled quantum circuits to characterize unknown systems. An efficient approach known as ``circuit reusing,'' where each circuit is executed multiple times, reduces the cost compared to implementing new circuits. This work investigates the optimal reusing times that minimizes the variance of measurement outcomes for a given experimental cost. We establish a theoretical framework connecting the variance of experimental estimators with the reusing times $R$. An optimal $R$ is derived when the implemented circuits and their noise characteristics are known. Additionally, we introduce a near-optimal reusing strategy that is applicable even without prior knowledge of circuits or noise, achieving variances close to the theoretical minimum. To validate our framework, we apply it to randomized benchmarking and analyze the optimal $R$ for various typical noise channels. We further conduct experiments on a superconducting platform, revealing a non-linear relationship between $R$ and the cost, contradicting previous assumptions in the literature. Our theoretical framework successfully incorporates this non-linearity and accurately predicts the experimentally observed optimal $R$. These findings underscore the broad applicability of our approach to experimental realizations of quantum learning protocols.
{"title":"Optimizing Circuit Reusing and its Application in Randomized Benchmarking","authors":"Zhuo Chen, Guoding Liu, Xiongfeng Ma","doi":"10.22331/q-2025-01-23-1606","DOIUrl":"https://doi.org/10.22331/q-2025-01-23-1606","url":null,"abstract":"Quantum learning tasks often leverage randomly sampled quantum circuits to characterize unknown systems. An efficient approach known as ``circuit reusing,'' where each circuit is executed multiple times, reduces the cost compared to implementing new circuits. This work investigates the optimal reusing times that minimizes the variance of measurement outcomes for a given experimental cost. We establish a theoretical framework connecting the variance of experimental estimators with the reusing times $R$. An optimal $R$ is derived when the implemented circuits and their noise characteristics are known. Additionally, we introduce a near-optimal reusing strategy that is applicable even without prior knowledge of circuits or noise, achieving variances close to the theoretical minimum. To validate our framework, we apply it to randomized benchmarking and analyze the optimal $R$ for various typical noise channels. We further conduct experiments on a superconducting platform, revealing a non-linear relationship between $R$ and the cost, contradicting previous assumptions in the literature. Our theoretical framework successfully incorporates this non-linearity and accurately predicts the experimentally observed optimal $R$. These findings underscore the broad applicability of our approach to experimental realizations of quantum learning protocols.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"9 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143020133","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-01-21DOI: 10.22331/q-2025-01-21-1604
Vahid Asadi, Richard Cleve, Eric Culf, Alex May
A quantum position-verification scheme attempts to verify the spatial location of a prover. The prover is issued a challenge with quantum and classical inputs and must respond with appropriate timings. We consider two well-studied position-verification schemes known as $f$-routing and $f$-BB84. Both schemes require an honest prover to locally compute a classical function $f$ of inputs of length $n$, and manipulate $O(1)$ size quantum systems. We prove the number of quantum gates plus single qubit measurements needed to implement a function $f$ is lower bounded linearly by the communication complexity of $f$ in the simultaneous message passing model with shared entanglement. Taking $f(x,y)=sum_i x_i y_i$ to be the inner product function, we obtain a $Omega(n)$ lower bound on quantum gates plus single qubit measurements. The scheme is feasible for a prover with linear classical resources and $O(1)$ quantum resources, and secure against sub-linear quantum resources.
{"title":"Linear gate bounds against natural functions for position-verification","authors":"Vahid Asadi, Richard Cleve, Eric Culf, Alex May","doi":"10.22331/q-2025-01-21-1604","DOIUrl":"https://doi.org/10.22331/q-2025-01-21-1604","url":null,"abstract":"A quantum position-verification scheme attempts to verify the spatial location of a prover. The prover is issued a challenge with quantum and classical inputs and must respond with appropriate timings. We consider two well-studied position-verification schemes known as $f$-routing and $f$-BB84. Both schemes require an honest prover to locally compute a classical function $f$ of inputs of length $n$, and manipulate $O(1)$ size quantum systems. We prove the number of quantum gates plus single qubit measurements needed to implement a function $f$ is lower bounded linearly by the communication complexity of $f$ in the simultaneous message passing model with shared entanglement. Taking $f(x,y)=sum_i x_i y_i$ to be the inner product function, we obtain a $Omega(n)$ lower bound on quantum gates plus single qubit measurements. The scheme is feasible for a prover with linear classical resources and $O(1)$ quantum resources, and secure against sub-linear quantum resources.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"13 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142992128","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-01-21DOI: 10.22331/q-2025-01-21-1605
Maria Flors Mor-Ruiz, Julius Wallnöfer, Wolfgang Dür
Entanglement-based quantum networks exhibit a unique flexibility in the choice of entangled resource states that are then locally manipulated by the nodes to fulfill any request in the network. Furthermore, this manipulation is not uniquely defined and thus can be optimized. We tailor the adaptation of the resource state or pre-established entanglement to achieve bipartite communication in an imperfect setting that includes time-dependent memory errors. In this same setting, we study how the flexibility of this approach can be used for the distribution of entanglement in a fully asymmetric network scenario. The considered entanglement topology is a custom one based on the minimization of the required measurements to retrieve a Bell pair. The optimization of the manipulation and the study of such a custom entanglement topology are performed using the noisy stabilizer formalism, a recently introduced method to fully track noise on graph states. We find that exploiting the flexibility of the entanglement topology, given a certain set of bipartite requests, is highly favorable in terms of the fidelity of the final state.
{"title":"Imperfect quantum networks with tailored resource states","authors":"Maria Flors Mor-Ruiz, Julius Wallnöfer, Wolfgang Dür","doi":"10.22331/q-2025-01-21-1605","DOIUrl":"https://doi.org/10.22331/q-2025-01-21-1605","url":null,"abstract":"Entanglement-based quantum networks exhibit a unique flexibility in the choice of entangled resource states that are then locally manipulated by the nodes to fulfill any request in the network. Furthermore, this manipulation is not uniquely defined and thus can be optimized. We tailor the adaptation of the resource state or pre-established entanglement to achieve bipartite communication in an imperfect setting that includes time-dependent memory errors. In this same setting, we study how the flexibility of this approach can be used for the distribution of entanglement in a fully asymmetric network scenario. The considered entanglement topology is a custom one based on the minimization of the required measurements to retrieve a Bell pair. The optimization of the manipulation and the study of such a custom entanglement topology are performed using the noisy stabilizer formalism, a recently introduced method to fully track noise on graph states. We find that exploiting the flexibility of the entanglement topology, given a certain set of bipartite requests, is highly favorable in terms of the fidelity of the final state.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"5 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142992132","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-01-21DOI: 10.22331/q-2025-01-21-1603
Andrew M. Childs, Honghao Fu, Debbie Leung, Zhi Li, Maris Ozols, Vedang Vyas
Quantum state purification is the task of recovering a nearly pure copy of an unknown pure quantum state using multiple noisy copies of the state. This basic task has applications to quantum communication over noisy channels and quantum computation with imperfect devices, but has only been studied previously for the case of qubits. We derive an efficient purification procedure based on the swap test for qudits of any dimension, starting with any initial error parameter. Treating the initial error parameter and the dimension as constants, we show that our procedure has sample complexity asymptotically optimal in the final error parameter. Our protocol has a simple recursive structure that can be applied when the states are provided one at a time in a streaming fashion, requiring only a small quantum memory to implement.
{"title":"Streaming quantum state purification","authors":"Andrew M. Childs, Honghao Fu, Debbie Leung, Zhi Li, Maris Ozols, Vedang Vyas","doi":"10.22331/q-2025-01-21-1603","DOIUrl":"https://doi.org/10.22331/q-2025-01-21-1603","url":null,"abstract":"Quantum state purification is the task of recovering a nearly pure copy of an unknown pure quantum state using multiple noisy copies of the state. This basic task has applications to quantum communication over noisy channels and quantum computation with imperfect devices, but has only been studied previously for the case of qubits. We derive an efficient purification procedure based on the swap test for qudits of any dimension, starting with any initial error parameter. Treating the initial error parameter and the dimension as constants, we show that our procedure has sample complexity asymptotically optimal in the final error parameter. Our protocol has a simple recursive structure that can be applied when the states are provided one at a time in a streaming fashion, requiring only a small quantum memory to implement.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"8 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142992127","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：