José Ignacio Latorre
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
José Ignacio Latorre has a total of 154 co-authors. Here are the top co-authors by number of shared publications:
- Stefano Forte
Universitá di Milano and INFN, Sezione di Milano
26 shared publications - Luigi Del Debbio
The University of Edinburgh
19 shared publications - Juan Rojo
Nationaal instituut voor subatomaire fysica
18 shared publications - Richard D. Ball
University of Edinburgh
17 shared publications - Maria Ubiali
DAMTP, University of Cambridge
16 shared publications - Alberto Guffanti
University of Copenhagen
15 shared publications
Latest Publications
- Open Access
- 26 May 2026
- Published by American Physical Society (APS) in Physical Review D
- Vol. 113 (9)
Gauge and diffeomorphism invariance from quantum information principles
Entanglement is a hallmark of quantum theory, yet it alone does not capture the full extent of quantum complexity: some highly entangled states can still be classically simulated. Nonclassical behavior also requires magic, the non-Clifford component that enables universal quantum computation. Here, we investigate whether the interplay between entanglement and magic-state resources constrains the structure of fundamental interactions. We study gluon-gluon and graviton-graviton scattering at tree level. We focus on the high-energy limit, where mass-dependent terms are negligible, and conformal symmetry is preserved. In this regime, all particles behave as massless degrees of freedom, allowing us to isolate their transverse helicities as two-qubit states. We explicitly break gauge and general covariance by modifying the quartic vertices and analyzing the resulting generation of entanglement and magic. We find that imposing maximal entanglement (MaxEnt) alone does not uniquely recover gauge-invariant and diffeomorphism-invariant interactions, but adding the condition of minimal, but nonzero, magic-state generation singles it out. Our results indicate that nature favors MaxEnt and low magic: maximal quantum correlations with limited non-Cliffordness, sufficient for universal quantum computing but close to classical simulability. This dual informational principle may underlie the emergence of gauge invariance in fundamental physics.
- 26 May 2026
- Published by American Physical Society (APS) in Physical Review D
- Vol. 113 (9)
Open AccessGauge and diffeomorphism invariance from quantum information principles
Entanglement is a hallmark of quantum theory, yet it alone does not capture the full extent of quantum complexity: some highly entangled states can still be classically simulated. Nonclassical behavior also requires magic, the non-Clifford component that enables universal quantum computation. Here, we investigate whether the interplay between entanglement and magic-state resources constrains the structure of fundamental interactions. We study gluon-gluon and graviton-graviton scattering at tree level. We focus on the high-energy limit, where mass-dependent terms are negligible, and conformal symmetry is preserved. In this regime, all particles behave as massless degrees of freedom, allowing us to isolate their transverse helicities as two-qubit states. We explicitly break gauge and general covariance by modifying the quartic vertices and analyzing the resulting generation of entanglement and magic. We find that imposing maximal entanglement (MaxEnt) alone does not uniquely recover gauge-invariant and diffeomorphism-invariant interactions, but adding the condition of minimal, but nonzero, magic-state generation singles it out. Our results indicate that nature favors MaxEnt and low magic: maximal quantum correlations with limited non-Cliffordness, sufficient for universal quantum computing but close to classical simulability. This dual informational principle may underlie the emergence of gauge invariance in fundamental physics.
- 21 September 2022
- Published by Springer Nature
- p. 3-23
Hybrid Decoding – Classical-Quantum Trade-Offs for Information Set Decoding
- 21 September 2022
- Published by Springer Nature
- p. 3-23
Hybrid Decoding – Classical-Quantum Trade-Offs for Information Set Decoding
Post-traumatic stress disorder, suggestibility, and dissociation related to alleged alien abductions
- 6 June 2022
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 55 (26) , 265301
Variational quantum eigensolver for SU( N ) fermions
Variational quantum algorithms aim at harnessing the power of noisy intermediate-scale quantum (NISQ) computers, by using a classical optimizer to train a parameterized quantum circuit to solve tractable quantum problems. The variational quantum eigensolver (VQE) is one of the aforementioned algorithms designed to determine the ground-state of many-body Hamiltonians. Here, we apply the VQE to study the ground-state properties of N -component fermions. With such knowledge, we study the persistent current of interacting SU( N ) fermions, which is employed to reliably map out the different quantum phases of the system. Our approach lays out the basis for a current-based quantum simulator of many-body systems that can be implemented on NISQ computers.
- 6 June 2022
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 55 (26) , 265301
Variational quantum eigensolver for SU( N ) fermions
Variational quantum algorithms aim at harnessing the power of noisy intermediate-scale quantum (NISQ) computers, by using a classical optimizer to train a parameterized quantum circuit to solve tractable quantum problems. The variational quantum eigensolver (VQE) is one of the aforementioned algorithms designed to determine the ground-state of many-body Hamiltonians. Here, we apply the VQE to study the ground-state properties of N -component fermions. With such knowledge, we study the persistent current of interacting SU( N ) fermions, which is employed to reliably map out the different quantum phases of the system. Our approach lays out the basis for a current-based quantum simulator of many-body systems that can be implemented on NISQ computers.
- Open Access
An Optimized Quantum Implementation of ISD on Scalable Quantum Resources
The security of code based constructions is usually assessed by Information Set Decoding (ISD) algorithms. In the quantum setting, amplitude amplification yields an asymptotic square root gain over the classical analogue. However, it is still unclear whether a real quantum circuit could yield actual improvements or suffer an enormous overhead due to its implementation. This leads to different considerations of these quantum attacks in the security analysis of code based proposals. In this work we clarify this doubt by giving the first quantum circuit design of the fully-fledged ISD procedure, an implementation in the quantum simulation library Qibo as well as precise estimates of its complexities. We show that against common belief, Prange's ISD algorithm can be implemented rather efficiently on a quantum computer, namely with only a logarithmic overhead in circuit depth compared to a classical implementation. As another major contribution, we leverage the idea of classical co-processors to design hybrid classical-quantum trade-offs, that allow to tailor the necessary qubits to any available amount, while still providing quantum speedups. Interestingly, when constraining the width of the circuit instead of its depth we are able to overcome previous optimality results on constraint quantum search.
Open AccessAn Optimized Quantum Implementation of ISD on Scalable Quantum Resources
The security of code based constructions is usually assessed by Information Set Decoding (ISD) algorithms. In the quantum setting, amplitude amplification yields an asymptotic square root gain over the classical analogue. However, it is still unclear whether a real quantum circuit could yield actual improvements or suffer an enormous overhead due to its implementation. This leads to different considerations of these quantum attacks in the security analysis of code based proposals. In this work we clarify this doubt by giving the first quantum circuit design of the fully-fledged ISD procedure, an implementation in the quantum simulation library Qibo as well as precise estimates of its complexities. We show that against common belief, Prange's ISD algorithm can be implemented rather efficiently on a quantum computer, namely with only a logarithmic overhead in circuit depth compared to a classical implementation. As another major contribution, we leverage the idea of classical co-processors to design hybrid classical-quantum trade-offs, that allow to tailor the necessary qubits to any available amount, while still providing quantum speedups. Interestingly, when constraining the width of the circuit instead of its depth we are able to overcome previous optimality results on constraint quantum search.
- Open Access
- 1 September 2021
- Published by Rinton Press in Quantum Information & Computation
- Vol. 21 (13&14) , 1081-1090
Platonic entanglement
We present a construction of highly entangled states defined on the topology of a platonic solid using tensor networks based on ancillary Absolute Maximally Entangled (AME) states. We illustrate the idea using the example of a quantum state based on AME(5,2) over a dodecahedron. We analyze the entropy of such states on many different partitions, and observe that they come on integer numbers and are almost maximal. We also observe that all platonic solids accept the construction of AME states based on Reed-Solomon codes since their number of facets, vertices and edges are always a prime number plus one.
- 1 September 2021
- Published by Rinton Press in Quantum Information & Computation
- Vol. 21 (13&14) , 1081-1090
Open AccessPlatonic entanglement
We present a construction of highly entangled states defined on the topology of a platonic solid using tensor networks based on ancillary Absolute Maximally Entangled (AME) states. We illustrate the idea using the example of a quantum state based on AME(5,2) over a dodecahedron. We analyze the entropy of such states on many different partitions, and observe that they come on integer numbers and are almost maximal. We also observe that all platonic solids accept the construction of AME states based on Reed-Solomon codes since their number of facets, vertices and edges are always a prime number plus one.
- Open Access
- 10 May 2021
- Published by Springer Nature in Quantum Information Processing
- Vol. 20 (5) , 1-28
Quantum search for scaled hash function preimages
We present the implementation of Grover’s algorithm in a quantum simulator to perform a quantum search for preimages of two scaled hash functions, whose design only uses modular addition, word rotation and bitwise exclusive or. Our implementation provides the means to assess with precision the scaling of the number of gates and depth of a full-fledged quantum circuit designed to find the preimages of a given hash digest. The detailed construction of the quantum oracle shows that the presence of AND gates, OR gates, shifts of bits and the reuse of the initial state along the computation require extra quantum resources as compared with other hash functions based on modular additions, XOR gates and rotations. We also track the entanglement entropy present in the quantum register at every step along the computation, showing that it becomes maximal at the inner core of the first action of the quantum oracle, which implies that no classical simulation based on tensor networks would be of relevance. Finally, we show that strategies that suggest a shortcut based on sampling the quantum register after a few steps of Grover’s algorithm can only provide some marginal practical advantage in terms of error mitigation.
- 10 May 2021
- Published by Springer Nature in Quantum Information Processing
- Vol. 20 (5) , 1-28
Open AccessQuantum search for scaled hash function preimages
We present the implementation of Grover’s algorithm in a quantum simulator to perform a quantum search for preimages of two scaled hash functions, whose design only uses modular addition, word rotation and bitwise exclusive or. Our implementation provides the means to assess with precision the scaling of the number of gates and depth of a full-fledged quantum circuit designed to find the preimages of a given hash digest. The detailed construction of the quantum oracle shows that the presence of AND gates, OR gates, shifts of bits and the reuse of the initial state along the computation require extra quantum resources as compared with other hash functions based on modular additions, XOR gates and rotations. We also track the entanglement entropy present in the quantum register at every step along the computation, showing that it becomes maximal at the inner core of the first action of the quantum oracle, which implies that no classical simulation based on tensor networks would be of relevance. Finally, we show that strategies that suggest a shortcut based on sampling the quantum register after a few steps of Grover’s algorithm can only provide some marginal practical advantage in terms of error mitigation.
- Open Access
- 11 December 2020
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 4, 371
The Prime state and its quantum relatives
The Prime state of qubits, , is defined as the uniform superposition of all the computational-basis states corresponding to prime numbers smaller than . This state encodes, quantum mechanically, arithmetic properties of the primes. We first show that the Quantum Fourier Transform of the Prime state provides a direct access to Chebyshev-like biases in the distribution of prime numbers. We next study the entanglement entropy of up to qubits, and find a relation between its scaling and the Shannon entropy of the density of square-free integers. This relation also holds when the Prime state is constructed using a qudit basis, showing that this property is intrinsic to the distribution of primes. The same feature is found when considering states built from the superposition of primes in arithmetic progressions. Finally, we explore the properties of other number-theoretical quantum states, such as those defined from odd composite numbers, square-free integers and starry primes. For this study, we have developed an open-source library that diagonalizes matrices using floats of arbitrary precision.- 11 December 2020
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 4, 371
Open AccessThe Prime state and its quantum relatives
The Prime state of qubits, , is defined as the uniform superposition of all the computational-basis states corresponding to prime numbers smaller than . This state encodes, quantum mechanically, arithmetic properties of the primes. We first show that the Quantum Fourier Transform of the Prime state provides a direct access to Chebyshev-like biases in the distribution of prime numbers. We next study the entanglement entropy of up to qubits, and find a relation between its scaling and the Shannon entropy of the density of square-free integers. This relation also holds when the Prime state is constructed using a qudit basis, showing that this property is intrinsic to the distribution of primes. The same feature is found when considering states built from the superposition of primes in arithmetic progressions. Finally, we explore the properties of other number-theoretical quantum states, such as those defined from odd composite numbers, square-free integers and starry primes. For this study, we have developed an open-source library that diagonalizes matrices using floats of arbitrary precision. - Open Access
Scaling of variational quantum circuit depth for condensed matter systems
We benchmark the accuracy of a variational quantum eigensolver based on a finite-depth quantum circuit encoding ground state of local Hamiltonians. We show that in gapped phases, the accuracy improves exponentially with the depth of the circuit. When trying to encode the ground state of conformally invariant Hamiltonians, we observe two regimes. A finite-depth regime, where the accuracy improves slowly with the number of layers, and a finite-size regime where it improves again exponentially. The cross-over between the two regimes happens at a critical number of layers whose value increases linearly with the size of the system. We discuss the implication of these observations in the context of comparing different variational ansatz and their effectiveness in describing critical ground states.
Open AccessScaling of variational quantum circuit depth for condensed matter systems
We benchmark the accuracy of a variational quantum eigensolver based on a finite-depth quantum circuit encoding ground state of local Hamiltonians. We show that in gapped phases, the accuracy improves exponentially with the depth of the circuit. When trying to encode the ground state of conformally invariant Hamiltonians, we observe two regimes. A finite-depth regime, where the accuracy improves slowly with the number of layers, and a finite-size regime where it improves again exponentially. The cross-over between the two regimes happens at a critical number of layers whose value increases linearly with the size of the system. We discuss the implication of these observations in the context of comparing different variational ansatz and their effectiveness in describing critical ground states.
- Open Access
Data re-uploading for a universal quantum classifier
A single qubit provides sufficient computational capabilities to construct a universal quantum classifier when assisted with a classical subroutine. This fact may be surprising since a single qubit only offers a simple superposition of two states and single-qubit gates only make a rotation in the Bloch sphere. The key ingredient to circumvent these limitations is to allow for multiple data re-uploading. A quantum circuit can then be organized as a series of data re-uploading and single-qubit processing units. Furthermore, both data re-uploading and measurements can accommodate multiple dimensions in the input and several categories in the output, to conform to a universal quantum classifier. The extension of this idea to several qubits enhances the efficiency of the strategy as entanglement expands the superpositions carried along with the classification. Extensive benchmarking on different examples of the single- and multi-qubit quantum classifier validates its ability to describe and classify complex data.
Open AccessData re-uploading for a universal quantum classifier
A single qubit provides sufficient computational capabilities to construct a universal quantum classifier when assisted with a classical subroutine. This fact may be surprising since a single qubit only offers a simple superposition of two states and single-qubit gates only make a rotation in the Bloch sphere. The key ingredient to circumvent these limitations is to allow for multiple data re-uploading. A quantum circuit can then be organized as a series of data re-uploading and single-qubit processing units. Furthermore, both data re-uploading and measurements can accommodate multiple dimensions in the input and several categories in the output, to conform to a universal quantum classifier. The extension of this idea to several qubits enhances the efficiency of the strategy as entanglement expands the superpositions carried along with the classification. Extensive benchmarking on different examples of the single- and multi-qubit quantum classifier validates its ability to describe and classify complex data.