Searcharxiv⌕ Search

arXiv subjects

Antonio Acín

Publications and source records attributed to Antonio Acín.

At least 55 records · Page 3Linked to original sources

Reducing Entanglement With Physically-Inspired Fermion-To-Qubit Mappings

In ab-initio electronic structure simulations, fermion-to-qubit mappings represent the initial encoding step of the fermionic problem into qubits. This work introduces a physically-inspired method for constructing mappings that significantly simplify entanglement requirements when simulating states of interest. The presence of electronic excitations drives the construction of our mappings, reducing correlations for target states in the qubit space. To benchmark our method, we simulate ground states of small molecules and observe an enhanced performance when compared to classical and quantum variational approaches from prior research employing conventional mappings. In particular, on the quantum side, our mappings require a reduced number of entangling layers to achieve accuracy for $LiH$, $H_2$, $(H_2)_2$, the $H_4$ stretching and benzene's π system using the RY hardware efficient ansatz. In addition, our mappings also provide an enhanced ground state simulation performance in the density matrix renormalization group algorithm for the $N_2$ molecule.

quant-ph↗

Solving The Quantum Many-Body Hamiltonian Learning Problem with Neural Differential Equations

Understanding and characterising quantum many-body dynamics remains a significant challenge due to both the exponential complexity required to represent quantum many-body Hamiltonians, and the need to accurately track states in time under the action of such Hamiltonians. This inherent complexity limits our ability to characterise quantum many-body systems, highlighting the need for innovative approaches to unlock their full potential. To address this challenge, we propose a novel method to solve the Hamiltonian Learning (HL) problem-inferring quantum dynamics from many-body state trajectories-using Neural Differential Equations combined with an Ansatz Hamiltonian. Our method is reliably convergent, experimentally friendly, and interpretable, making it a stable solution for HL on a set of Hamiltonians previously unlearnable in the literature. In addition to this, we propose a new quantitative benchmark based on power laws, which can objectively compare the reliability and generalisation capabilities of any two HL algorithms. Finally, we benchmark our method against state-of-the-art HL algorithms with a 1D spin-1/2 chain proof of concept.

quant-ph↗

Certifying ground-state properties of quantum many-body systems

A ubiquitous problem in quantum physics is to understand the ground-state properties of many-body systems. Confronted with the fact that exact diagonalisation quickly becomes impossible when increasing the system size, variational approaches are typically employed as a scalable alternative: energy is minimised over a subset of all possible states and then different physical quantities are computed over the solution state. Despite remarkable success, rigorously speaking, all what variational methods offer are upper bounds on the ground-state energy. On the other hand, so-called relaxations of the ground-state problem based on semidefinite programming represent a complementary approach, providing lower bounds to the ground-state energy. However, in their current implementation, neither variational nor relaxation methods offer provable bound on other observables in the ground state beyond the energy. In this work, we show that the combination of the two classes of approaches can be used to derive certifiable bounds on the value of any observable in the ground state, such as correlation functions of arbitrary order, structure factors, or order parameters. We illustrate the power of this approach in paradigmatic examples of 1D and 2D spin-one-half Heisenberg models. To improve the scalability of the method, we exploit the symmetries and sparsity of the considered systems to reach sizes of hundreds of particles at much higher precision than previous works. Our analysis therefore shows how to obtain certifiable bounds on many-body ground-state properties beyond energy in a scalable way.

quant-ph↗

Security of discrete-modulated continuous-variable quantum key distribution

Continuous variable quantum key distribution with discrete modulation has the potential to provide information-theoretic security using widely available optical elements and existing telecom infrastructure. While their implementation is significantly simpler than that for protocols based on Gaussian modulation, proving their finite-size security against coherent attacks poses a challenge. In this work we prove finite-size security against coherent attacks for a discrete-modulated quantum key distribution protocol involving four coherent states and heterodyne detection. To do so, and contrary to most of the existing schemes, we first discretize all the continuous variables generated during the protocol. This allows us to use the entropy accumulation theorem, a tool that has previously been used in the setting of discrete variables, to construct the finite-size security proof. We then compute the corresponding finite-key rates through semi-definite programming and under a photon-number cutoff. Our analysis provides asymptotic rates in the range of $0.1-10^{-4}$ bits per round for distances up to hundred kilometres, while in the finite case and for realistic parameters, we get of the order of $10$ Gbits of secret key after $n\sim10^{11}$ rounds and distances of few tens of kilometres.

quant-ph↗

Maximal intrinsic randomness of a quantum state

One of the most counterintuitive aspects of quantum theory is its claim that there is 'intrinsic' randomness in the physical world. Quantum information science has greatly progressed in the study of intrinsic, or secret, quantum randomness in the past decade. With much emphasis on device-independent and semi-device-independent bounds, one of the most basic questions has escaped attention: how much intrinsic randomness can be extracted from a given state $ρ$, and what measurements achieve this bound? We answer this question for three different randomness quantifiers: the conditional min-entropy, the conditional von Neumann entropy and the conditional max-entropy. For the first, we solve the min-max problem of finding the projective measurement that minimises the maximal guessing probability of an eavesdropper. The result is that one can guarantee an amount of conditional min-entropy $H^*_{\textrm{min}}=-\log_2 P_{\textrm{guess}}^{*}(ρ)$ with $P_{\textrm{guess}}^{*}(ρ)=\frac{1}{d}(\textrm{tr} \sqrtρ)^2$ by performing suitable projective measurements. For the conditional von Neumann entropy, we find that the maximal value is $H^{*}= \log_{2}d-S(ρ)$, with $S(ρ)$ the von Neumann entropy of $ρ$, while for the conditional max-entropy, we find the maximal value $H^{*}_\textrm{max}=\log_{2}d + \log_{2}λ_{\textrm{max}}(ρ)$, where $λ_{\textrm{max}}(ρ)$ is the largest eigenvalue of $ρ$. Optimal values for $H^{*}_{\textrm{min}}$, $H^{*}$ and $H^{*}_\textrm{max}$ are achieved by measuring in any basis that is unbiased to the eigenbasis of $ρ$, as well as by other, less intuitive, measurements.

quant-ph↗

Device Independent Quantum Key Distribution with realistic single-photon source implementations

Device Independent Quantum Key Distribution (DIKQD) aims at generating secret keys between distant parties without the parties trusting their devices. We investigate a proposal for performing fully photonic DIQKD, based on single-photon sources and heralding measurements at a central station placed between the two parties. We derive conditions to attain non-zero secret-key rates in terms of the the photon efficiency, indistinguishability and the second order autocorrelation function of the single-photon sources. Exploiting new results on the security bound of such protocols allows us to reduce the requirements on the physical parameters of the setup. Our analysis shows that in the considered schemes, key rates of several hundreds of secret bits per second are within reach at distances of several tens of kilometers.

quant-ph↗

Realistic Bell tests with homodyne measurements

We analyze Bell inequalities violations in photonic experiments for which the measurement apparatuses are restricted to homodyne measurements. Through numerical optimization of the Clauser-Horne-Shimony-Holt inequality over homodyne measurements and binning choices, we demonstrate large violations for states with a bounded number of photons. When considering states defined within qubit local subspaces of two Fock states, such as NOON states, a violation is observed solely within the qubit Fock space spanned by zero and two photons. For more generic states, large violations are obtained. Significant violations are observed even for states containing three photons locally and under realistic values of noise and losses. We propose concrete implementations to achieve such violations, opening new avenues for Bell experiments with homodyne detectors.

quant-ph↗

Device-Independent Quantum Key Distribution beyond qubits

Device-Independent Quantum Key Distribution (DIQKD) aims to generate secret keys between two parties without relying on trust in their employed devices, imposing strict noise constraints for key generation. This study explores the resilience of high-dimensional quantum systems in DIQKD, focusing on a comparison between qubits and qutrits. Lower bounds on achievable key rates are investigated through numerical optimization, while upper bounds are evaluated using the Convex-Combination attack, which has been further extended to account for arbitrary dimensions. The observed difference between these bounds provides insights into noise thresholds and potential enhancements in DIQKD scenarios, prompting debate on the merit of increased dimensions given the associated experimental efforts required.

quant-ph↗

Upper bounds on key rates in device-independent quantum key distribution based on convex-combination attacks

The device-independent framework constitutes the most pragmatic approach to quantum protocols that does not put any trust in their implementations. It requires all claims, about e.g. security, to be made at the level of the final classical data in hands of the end-users. This imposes a great challenge for determining attainable key rates in device-independent quantum key distribution (DIQKD), but also opens the door for consideration of eavesdropping attacks that stem from the possibility of a given data being just generated by a malicious third-party. In this work, we explore this path and present the convex-combination attack as an efficient, easy-to-use technique for upper-bounding DIQKD key rates. It allows verifying the accuracy of lower bounds on key rates for state-of-the-art protocols, whether involving one-way or two-way communication. In particular, we demonstrate with its help that the currently predicted constraints on the robustness of DIQKD protocols to experimental imperfections, such as the finite visibility or detection efficiency, are already very close to the ultimate tolerable thresholds.

quant-ph↗

Local quantum overlapping tomography

Reconstructing the full quantum state of a many-body system requires the estimation of a number of parameters that grows exponentially with system size. Nevertheless, there are situations in which one is only interested in a subset of these parameters and a full reconstruction is not needed. A paradigmatic example is a scenario where one aims at determining all the reduced states only up to a given size. Overlapping tomography provides constructions to address this problem with a number of product measurements much smaller than what is obtained when performing independent tomography of each reduced state. There are however many relevant physical systems with a natural notion of locality where one is mostly interested in the reduced states of neighboring particles. In this work, we study this form of local overlapping tomography. First of all, we show that, contrary to its full version, the number of product-measurement settings needed for local overlapping tomography does not grow with system size. Then, we present strategies for qubit and fermionic systems in selected lattice geometries. The developed methods find a natural application in the estimation of many-body systems prepared in current quantum simulators or quantum computing devices, where interactions are often local.

quant-ph↗

Quantifying the intrinsic randomness of quantum measurements

Intrinsic quantum randomness is produced when a projective measurement on a given basis is implemented on a pure state that is not an element of the basis. The prepared state and implemented measurement are perfectly known, yet the measured result cannot be deterministically predicted. In realistic situations, however, measurements and state preparation are always noisy, which introduces a component of stochasticity in the outputs that is not a consequence of the intrinsic randomness of quantum theory. Operationally, this stochasticity is modelled through classical or quantum correlations with an eavesdropper, Eve, whose goal is to make the best guess about the outcomes produced in the experiment. In this work, we study Eve's maximum guessing probability when she is allowed to have correlations with, both, the state and the measurement. We show that, unlike the case of projective measurements (as it was already known) or pure states (as we prove), in the setting of generalized measurements and mixed states, Eve's guessing probability differs depending on whether she can prepare classically or quantumly correlated strategies.

quant-ph↗

Ancillary Gaussian modes activate the potential to witness non-Markovianity

We study how the number of employed modes impacts the ability to witness non-Markovian evolutions via correlation backflows in continuous-variable quantum dynamics. We first prove the existence of non-Markovian Gaussian evolutions that do not show any revivals in the correlations between the mode evolving through the dynamics and a single ancillary mode. We then demonstrate how this scenario radically changes when two ancillary modes are considered. Indeed, we show that the same evolutions can show correlation backflows along a specific bipartition when three-mode states are employed, and where only one mode is subjected to the evolution. These results can be interpreted as a form of activation phenomenon in non-Markovianity detection and are proven for two types of correlations, entanglement and steering, and two classes of Gaussian evolutions, a classical noise model and the quantum Brownian motion model.

quant-ph↗

Three numerical approaches to find mutually unbiased bases using Bell inequalities

Mutually unbiased bases correspond to highly useful pairs of measurements in quantum information theory. In the smallest composite dimension, six, it is known that between three and seven mutually unbiased bases exist, with a decades-old conjecture, known as Zauner's conjecture, stating that there exist at most three. Here we tackle Zauner's conjecture numerically through the construction of Bell inequalities for every pair of integers $n,d \ge 2$ that can be maximally violated in dimension $d$ if and only if $n$ MUBs exist in that dimension. Hence we turn Zauner's conjecture into an optimisation problem, which we address by means of three numerical methods: see-saw optimisation, non-linear semidefinite programming and Monte Carlo techniques. All three methods correctly identify the known cases in low dimensions and all suggest that there do not exist four mutually unbiased bases in dimension six, with all finding the same bases that numerically optimise the corresponding Bell inequality. Moreover, these numerical optimisers appear to coincide with the "four most distant bases" in dimension six, found through numerically optimising a distance measure in [P. Raynal, X. Lü, B.-G. Englert, Phys. Rev. A, 83 062303 (2011)]. Finally, the Monte Carlo results suggest that at most three MUBs exist in dimension ten.

quant-ph↗

Single-photon nonlocality in quantum networks

The state obtained when a single photon impinges on a balanced beamsplitter is often known as single-photon entangled and its nonlocal properties have been the subject of intense debates in the quantum optics and foundations communities. It is however clear that a standard Bell test made only of passive optical elements cannot reveal the nonlocality of this state. We show that the nonlocality of single-photon entangled states can nevertheless be revealed in a quantum network made only of beamsplitters and photodetectors. In our protocol, three single-photon entangled states are distributed in a triangle network, introducing indeterminacy in the photons' paths and creating nonlocal correlations without the need for measurements choices. We discuss a concrete experimental realisation and provide numerical evidence of the tolerance of our protocol to standard noise sources. Our results show that single-photon entanglement may constitute a promising solution to generate genuine network-nonlocal correlations useful for Bell-based quantum information protocols.

quant-ph↗

Unveiling quantum entanglement in many-body systems from partial information

Quantum entanglement is commonly assumed to be a central resource for quantum computing and quantum simulation. Nonetheless, the capability to detect it in many-body systems is severely limited by the absence of sufficiently scalable and flexible certification tools. This issue is particularly critical in situations where the structure of entanglement is a priori unknown, and where one cannot rely on existing entanglement witnesses. Here, we implement a scheme in which the knowledge of the mean value of arbitrary observables can be used to probe multipartite entanglement in a scalable, certified and systematic manner. Specifically, we rely on positive semidefinite conditions, independent of partial-transposition-based criteria, necessarily obeyed if the data can be reproduced by a separable state. The violation of any of these conditions yields a specific entanglement witness, tailored to the data of interest, revealing the salient features of the data which are impossible to reproduce without entanglement. We validate this approach by probing theoretical many-body states of several hundreds of qubits relevant to existing experiments: a single-particle quench in a one-dimensional $XX$ chain; a many-body quench in a two-dimensional $XX$ model with $1/r^3$ interactions; and thermal equilibrium states of Heisenberg and transverse-field Ising chains. In all cases, these investigations have lead us to discover new entanglement witnesses, some of which could be characterized analytically, generalizing existing results in the literature. In summary, our paper introduces a flexible data-driven entanglement detection technique for uncharacterized quantum many-body states, of immediate relevance to experiments in a quantum advantage regime.

quant-ph↗

Quantum Channel Marginal Problem

Given a set of local dynamics, are they compatible with a global dynamics? We systematically formulate these questions as quantum channel marginal problems. These problems are strongly connected to the generalization of the no-signaling conditions to quantized inputs and outputs and can be understood as a general toolkit to study notions of quantum incompatibility. In fact, they include as special cases channel broadcasting, channel extendibility, measurement compatibility, and state marginal problems. After defining the notion of compatibility between global and local dynamics, we provide a solution to the channel marginal problem that takes the form of a semidefinite program. Using this formulation, we construct channel incompatibility witnesses, discuss their operational interpretation in terms of an advantage for a state-discrimination task, prove a gap between classical and quantum dynamical marginal problems and show that the latter is irreducible to state marginal problems.

quant-ph↗

Quantum networks self-test all entangled states

Certifying quantum properties with minimal assumptions is a fundamental problem in quantum information science. Self-testing is a method to infer the underlying physics of a quantum experiment only from the measured statistics. While all bipartite pure entangled states can be self-tested, little is known about how to self-test quantum states of an arbitrary number of systems. Here, we introduce a framework for network-assisted self-testing and use it to self-test any pure entangled quantum state of an arbitrary number of systems. The scheme requires the preparation of a number of singlets that scales linearly with the number of systems, and the implementation of standard projective and Bell measurements, all feasible with current technology. When all the network constraints are exploited, the obtained self-testing certification is stronger than what is achievable in any Bell-type scenario. Our work does not only solve an open question in the field, but also shows how properly designed networks offer new opportunities for the certification of quantum phenomena.

quant-ph↗

Coarse-grained self-testing

Self-testing is a device-independent method that usually amounts to show that the maximal quantum violation of a Bell's inequality certifies a unique quantum state, up to some symmetries inherent to the device-independent framework. In this work, we enlarge this approach and show how a coarse-grained version of self-testing is possible in which physically relevant properties of a many-body system are certified. For that we study a Bell scenario consisting of an arbitrary number of parties and show that the membership to a set of (entangled) quantum states whose size grows exponentially with the number of particles can be self-tested. Specifically, we prove that a many-body generalization of the chained Bell inequality is maximally violated if and only if the underlying quantum state is equal, up to local isometries, to a many-body singlet. The maximal violation of the inequality therefore certifies any statistical mixture of the exponentially-many orthogonal pures states spanning the singlet manifold.

quant-ph↗