arXiv subjects

Róbert Trényi

Publications and source records attributed to Róbert Trényi.

7 recordsLinked to original sources

arXiv2026

Iterative optimization in quantum metrology and entanglement theory using semidefinite programming

We discuss efficient methods to optimize the metrological performance over local Hamiltonians in a bipartite quantum system. For a given quantum state, our methods find the best local Hamiltonian for which the state outperforms separable states the most from the point of view of quantum metrology. We show that this problem can be reduced to maximizing the quantum Fisher information over a certain set of Hamiltonians. We present the quantum Fisher information in a bilinear form and maximize it by an iterative see-saw (ISS) method, in which each step is based on semidefinite programming. We also solve the problem with the method of moments that works very well for smaller systems. Our approach is one of the efficient methods that can be applied for an optimization of the unitary dynamics in quantum metrology, the other methods being, for example, machine learning, variational quantum circuits, or neural networks. The advantage of our method is the fast and robust convergence due to the simple mathematical structure of the approach. We also consider a number of other problems in quantum information theory that can be solved in a similar manner. For instance, we determine the bound entangled quantum states that maximally violate the Computable Cross Norm-Realignment (CCNR) criterion.

quant-ph↗

arXiv2025

Geometrical constructions of purity testing protocols and their applications to quantum communication

Purity testing protocols (PTPs), i.e., protocols that decide with high probability whether or not a distributed bipartite quantum state is maximally entangled, have been proven to be a useful tool in many quantum communication applications. In this paper, we provide geometrical constructions for such protocols that originate directly from classical linear error correcting codes (LECCs), in a way that the properties of the resulting PTPs are completely determined from those of the LECCs used in the construction. We investigate the implications of our results in various tasks, including error detection, entanglement purification for general quantum error models and quantum message authentication.

quant-ph↗

arXiv2024

Activation of metrologically useful genuine multipartite entanglement

We consider quantum metrology with several copies of bipartite and multipartite quantum states. We characterize the metrological usefulness by determining how much the state outperforms separable states. We identify a large class of entangled states that become maximally useful for metrology in the limit of large number of copies, even if the state is weakly entangled and not even more useful than separable states. This way we activate metrologically useful genuine multipartite entanglement. Remarkably, not only that the maximally achievable metrological usefulness is attained exponentially fast in the number of copies, but it can be achieved by the measurement of few simple correlation observables. We also make general statements about the usefulness of a single copy of pure entangled states. We surprisingly find that the multiqubit states presented in Hyllus et al. [Phys. Rev. A 82, 012337 (2010)], which are not useful, become useful if we embed the qubits locally in qutrits. We discuss the relation of our scheme to error correction, and its possible use for quantum metrology in a noisy environment.

quant-ph↗

arXiv2021

Zero-error attack against coherent-one-way quantum key distribution

Coherent-one-way (COW) quantum key distribution (QKD) held the promise of distributing secret keys over long distances with a simple experimental setup. Indeed, this scheme is currently used in commercial applications. Surprisingly, however, it has been recently shown that its secret key rate scales at most quadratically with the system's transmittance and, thus, it is not appropriate for long distance QKD transmission. Such pessimistic result was derived by employing a so-called zero-error attack, in which the eavesdropper does not introduce any error, but still the legitimate users of the system cannot distill a secure key. Here, we present a zero-error attack against COW-QKD that is essentially optimal, in the sense that no other attack can restrict further its maximum achievable distance in the absence of errors. This translates into an upper bound on its secret key rate that is more than an order of magnitude lower than previously known upper bounds.

quant-ph↗

arXiv2021

Upper security bounds for coherent-one-way quantum key distribution

The performance of quantum key distribution (QKD) is severely limited by multi-photon pulses emitted by laser sources due to the photon-number splitting attack. Coherent-one-way (COW) QKD has been introduced as a promising solution to overcome this limitation, and thus extend the achievable distance of practical QKD. Indeed, thanks to its experimental simplicity, the COW protocol is already used in commercial applications. Here, we derive simple upper security bounds on its secret key rate, which demonstrate that it scales at most quadratically with the system's transmittance, thus solving a long-standing problem. That is, in contrast to what has been claimed, this approach is inappropriate for long-distance QKD transmission. Remarkably, our findings imply that all implementations of the COW protocol performed so far are insecure.

quant-ph↗

arXiv2019

Beating direct transmission bounds for quantum key distribution with a multiple quantum memory station

Overcoming repeaterless bounds for the secret key rate capacity of quantum key distribution protocols is still a challenge with current technology. D. Luong et al. [Applied Physics B 122, 96 (2016)] proposed a protocol to beat a repeaterless bound using one pair of quantum memories. However, the required experimental parameters for the memories are quite demanding. We extend the protocol with multiple pairs of memories, operated in a parallel manner to relax these conditions. We quantify the amount of relaxation in terms of the most crucial memory parameters, given the number of applied memory pairs. In the case of high-loss channels we found that adding only a few pair of memories can make the crossover possible.

quant-ph↗

arXiv2019

Beating the repeaterless bound with adaptive measurement-device-independent quantum key distribution

Surpassing the repeaterless bound is a crucial task on the way towards realizing long-distance quantum key distribution. In this paper, we focus on the protocol proposed by Azuma et al. in [Nature Communications 6, 10171 (2015)], which can beat this bound with idealized devices. We investigate the robustness of this protocol against imperfections in realistic setups, particularly the multiple-photon pair components emitted by practical entanglement sources. In doing so, we derive necessary conditions on the photon-number statistics of the sources in order to beat the repeaterless bound. We show, for instance, that parametric down-conversion sources do not satisfy the required conditions and thus cannot be used to outperform this bound.

quant-ph↗