Júlia Barberà-Rodríguez

Júlia Barberà-Rodríguez

Auto-generated profile, based on publicly available information

Júlia Barberà-Rodríguez

The Barcelona Institute of Science and Technology

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
26 February 2025 in Physical Review Research
Verified
Journal Article
Open access
JBJúlia Barberà-Rodríguez
Júlia Barberà-Rodríguez
LZLeonardo Zambrano
Leonardo Zambrano
AAAntonio Acín
Antonio Acín
DFDonato Farina
Donato Farina
We introduce two methods for quantum process and detector tomography. In the quantum process tomography method, we develop an analytical procedure for projecting the linear inversion estimation of a quantum channel onto the set of completely positive trace-preserving matrices. By integrating this method with alternate projection techniques, we achieve a three-order-of-magnitude improvement in approximating the closest quantum channel to an arbitrary Hermitian matrix compared to existing methods without compromising computational efficiency. Our second method extends this approach to quantum detector tomography, demonstrating superior efficiency compared to current techniques. Through numerical simulations, we evaluate our protocols across channels of up to four qubits in quantum process tomography and systems of up to six qubits in quantum detector tomography, showcasing superior precision and efficiency. Published by the American Physical Society 2025

16 December 2024 in Physical Review Research
Verified
Journal Article
Open access
JBJúlia Barberà-Rodríguez
Júlia Barberà-Rodríguez
NGNicolas Gama
Nicolas Gama
ANAnand Kumar Narayanan
Anand Kumar Narayanan
DJDavid Joseph
David Joseph
Lattice-based cryptography has emerged as one of the most prominent candidates for postquantum cryptography, projected to be secure against the imminent threat of large-scale fault-tolerant quantum computers. The Shortest Vector Problem (SVP) is to find the shortest nonzero vector in a given lattice. It is fundamental to lattice-based cryptography and believed to be hard even for quantum computers. We study a natural generalization of the SVP known as the K -Densest Sublattice Problem ( K -DSP): to find the densest K -dimensional sublattice of a given lattice. We formulate K -DSP as finding the first excited state of a Z -basis Hamiltonian, making K -DSP amenable to investigation via an array of quantum algorithms, including Grover search, quantum Gibbs sampling, adiabatic, and variational quantum algorithms. The complexity of the algorithms depends on the basis through which the input lattice is presented. We present a classical polynomial-time algorithm that takes an arbitrary input basis and preprocesses it into inputs suited to quantum algorithms. With preprocessing, we prove that O ( K N 2 ) qubits suffice for solving K -DSP for N -dimensional input lattices. We empirically demonstrate the performance of a quantum approximate optimization algorithm K -DSP solver for low dimensions, highlighting the influence of a good preprocessed input basis. We then discuss the hardness of K -DSP in relation to the SVP, to see if there is a reason to build postquantum cryptography on K -DSP. We devise a quantum algorithm that solves K -DSP with runtime exponent ( 5 K N log 2 N ) / 2 . Therefore, for fixed K , K -DSP is no more than polynomially harder than the SVP. The central insight we use is similar in spirit to those underlying the best-known classical K -DSP algorithm due to Dadush and Micciancio. Whether the exponential dependence on K can be lowered remains an open question. Published by the American Physical Society 2024

3 July 2025 in Quantum
Verified
Journal Article
Open access
PDF file
JBJúlia Barberà-Rodríguez
Júlia Barberà-Rodríguez
MNMariana Navarro
Mariana Navarro
LZLeonardo Zambrano
Leonardo Zambrano
Direct fidelity estimation is a protocol that estimates the fidelity between an experimental quantum state and a target pure state. By measuring the expectation values of Pauli operators selected through importance sampling, the method is exponentially faster than full quantum state tomography. We propose an enhanced direct fidelity estimation protocol that uses fewer copies of the experimental state by grouping Pauli operators before the sampling process. We derive analytical bounds on the measurement cost and estimator variance, showing improvements over the standard method. Numerical simulations validate our approach, demonstrating that for 8-qubit Haar-random states, our method achieves a one-third reduction in the required number of copies and reduces variance by an order of magnitude using only local measurements. These results underscore the potential of our protocol to enhance the efficiency of fidelity estimation in current quantum devices.

20 May 2026 in Physical Review Applied
Verified
Journal Article
Closed access
EAErik Altelarrea-Ferré
Erik Altelarrea-Ferré
JBJúlia Barberà-Rodríguez
Júlia Barberà-Rodríguez
DJDavid Jansen
David Jansen
AAAntonio Acín
Antonio Acín