Raúl García-Patrón
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Raúl García-Patrón has a total of 27 co-authors. Here are the top co-authors by number of shared publications:
Jelmer J. Renema
Clarendon Laboratory, Department of Physics, University of Oxford, Oxford OX1 3PU, United Kingdom
2 shared publications- Samo Novák
Laboratory for the Foundations of Computer Science
2 shared publications Valery Shchesnovich
Centro de Ciências Naturais e Humanas, Universidade Federal do ABC, Santo André, SP, 09210-170 Brazil
2 shared publications- Alexander Makarovskiy
ORCA Computing, London, UK
1 shared publication - Andreas Winter
Departament de Física Grup d'Informació Quàntica Universitat Autònoma de Barcelona 08193 Bellaterra (Barcelona Spain
1 shared publication Ashley Montanaro
Phasecraft Ltd
1 shared publication
Latest Publications
- Open Access
- 16 October 2026
- Published by American Association for the Advancement of Science (AAAS) in Science Advances
- Vol. 12 (42)
A fast and frugal Gaussian boson sampling emulator
Classical algorithms have successfully reproduced expectation values of observables for certain quantum circuits using off-the-shelf computing resources; however, matching the performance of the most advanced quantum devices on sampling problems typically incurs extreme memory and computational costs, restricting such simulations to only a handful of supercomputers worldwide. In this work, we demonstrate a classical simulation outperforming Gaussian boson sampling experiments of 100 modes on established benchmark tests using a single central processing unit (CPU) or graphics processing unit (GPU). Being embarrassingly parallelizable, a small number of CPUs or GPUs allows us to match previous sampling rates that required more than 100 GPUs. We believe that algorithmic and implementation improvements have the potential to generalize our tools to photocounting and pseudo–photon number–resolving scenarios and larger system sizes. Last, most of the innovations in our tools remain valid for generic probability distributions over binary variables, rendering them potentially applicable to the simulation of qubit-based sampling problems and creating classical surrogates for classical-quantum algorithms.
- 16 October 2026
- Published by American Association for the Advancement of Science (AAAS) in Science Advances
- Vol. 12 (42)
Open AccessA fast and frugal Gaussian boson sampling emulator
Classical algorithms have successfully reproduced expectation values of observables for certain quantum circuits using off-the-shelf computing resources; however, matching the performance of the most advanced quantum devices on sampling problems typically incurs extreme memory and computational costs, restricting such simulations to only a handful of supercomputers worldwide. In this work, we demonstrate a classical simulation outperforming Gaussian boson sampling experiments of 100 modes on established benchmark tests using a single central processing unit (CPU) or graphics processing unit (GPU). Being embarrassingly parallelizable, a small number of CPUs or GPUs allows us to match previous sampling rates that required more than 100 GPUs. We believe that algorithmic and implementation improvements have the potential to generalize our tools to photocounting and pseudo–photon number–resolving scenarios and larger system sizes. Last, most of the innovations in our tools remain valid for generic probability distributions over binary variables, rendering them potentially applicable to the simulation of qubit-based sampling problems and creating classical surrogates for classical-quantum algorithms.
- Open Access
- 20 August 2026
- Published by American Physical Society (APS) in Physical Review A
- Vol. 114 (2) , 022443
Entropy density benchmarking of near-term quantum circuits
Understanding the limitations imposed by noise on current and next-generation quantum devices is a crucial step toward demonstrating practical quantum advantage. In this work, we investigate the accumulation of entropy density as a benchmark to monitor the performance of quantum processing units (QPUs). We provide a proof-of-principle demonstration of our methodology which entails developing simple heuristic models of how entropy accumulates, testing them against real QPU data, and finally using these models to determine a circuit volume threshold above which quantum advantage is unattainable. Monitoring entropy density not only offers an alternative approach that complements existing circuit-level benchmarking techniques, but, more importantly, it bridges the gap between circuit-level and application-level benchmarking protocols. In particular, our heuristic model of entropy accumulation allows us to outperform existing techniques that bound the circuit-size threshold for quantum advantage.
- 20 August 2026
- Published by American Physical Society (APS) in Physical Review A
- Vol. 114 (2) , 022443
Open AccessEntropy density benchmarking of near-term quantum circuits
Understanding the limitations imposed by noise on current and next-generation quantum devices is a crucial step toward demonstrating practical quantum advantage. In this work, we investigate the accumulation of entropy density as a benchmark to monitor the performance of quantum processing units (QPUs). We provide a proof-of-principle demonstration of our methodology which entails developing simple heuristic models of how entropy accumulates, testing them against real QPU data, and finally using these models to determine a circuit volume threshold above which quantum advantage is unattainable. Monitoring entropy density not only offers an alternative approach that complements existing circuit-level benchmarking techniques, but, more importantly, it bridges the gap between circuit-level and application-level benchmarking protocols. In particular, our heuristic model of entropy accumulation allows us to outperform existing techniques that bound the circuit-size threshold for quantum advantage.
- Open Access
- 16 March 2026
- Published by American Physical Society (APS) in Physical Review A
- Vol. 113 (3)
Laplace expansions and tree decompositions: A faster polytime algorithm for shallow nearest-neighbor boson sampling
In a boson sampling quantum optical experiment, we send n individual photons into an m -mode interferometer and measure the occupation pattern on the output. The statistics of this process depend on the permanent of a matrix representing the experiment, which is itself a #P-hard problem to compute, and this is the reason why ideal and fully general boson sampling is hard to simulate on a classical computer. We exploit the fact that, for a nearest-neighbor shallow circuit, i.e., depth D = O ( log m ) , one can adapt the algorithm by Clifford and Clifford [SODA '18 (2018), pp. 146–155] to exploit the sparsity of the shallow interferometer using an algorithm by Cifuentes and Parrilo [] that can efficiently compute a permanent of a structured matrix from a tree decomposition. Our algorithm generates a sample from a shallow circuit in time O ( n 2 2 ω ω 2 ) + O ( ω n 3 ) , where ω is the treewidth of the decomposition that satisfies ω ≤ 2 D for nearest-neighbor shallow circuits. The key difference in our work with respect to previous work using similar methods is the reuse of the structure of the tree decomposition, allowing us to adapt the Laplace expansion used by Clifford and Clifford, which removes a significant factor of m from the running time, especially as m > n 2 is a requirement of the original boson sampling proposal.
- 16 March 2026
- Published by American Physical Society (APS) in Physical Review A
- Vol. 113 (3)
Open AccessLaplace expansions and tree decompositions: A faster polytime algorithm for shallow nearest-neighbor boson sampling
In a boson sampling quantum optical experiment, we send n individual photons into an m -mode interferometer and measure the occupation pattern on the output. The statistics of this process depend on the permanent of a matrix representing the experiment, which is itself a #P-hard problem to compute, and this is the reason why ideal and fully general boson sampling is hard to simulate on a classical computer. We exploit the fact that, for a nearest-neighbor shallow circuit, i.e., depth D = O ( log m ) , one can adapt the algorithm by Clifford and Clifford [SODA '18 (2018), pp. 146–155] to exploit the sparsity of the shallow interferometer using an algorithm by Cifuentes and Parrilo [] that can efficiently compute a permanent of a structured matrix from a tree decomposition. Our algorithm generates a sample from a shallow circuit in time O ( n 2 2 ω ω 2 ) + O ( ω n 3 ) , where ω is the treewidth of the decomposition that satisfies ω ≤ 2 D for nearest-neighbor shallow circuits. The key difference in our work with respect to previous work using similar methods is the reuse of the structure of the tree decomposition, allowing us to adapt the Laplace expansion used by Clifford and Clifford, which removes a significant factor of m from the running time, especially as m > n 2 is a requirement of the original boson sampling proposal.
- Top Cited PapersOpen Access
- 5 March 2026
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 7 (1)
Quantum Phase Estimation Without Controlled Unitaries
In this work we demonstrate the use of adapted classical phase retrieval algorithms to perform control-free quantum phase estimation. We eliminate the costly controlled time evolution and Hadamard test commonly required to access the complex time-series needed to reconstruct the spectrum. This significant reduction of the number of coherent controlled-operations lowers the circuit depth and considerably simplifies the implementation of statistical quantum phase estimation in near-term devices. This seemingly impossible task can be achieved by extending the problem that one wishes to solve to one with a larger set of input signals while exploiting natural constraints on the signal and/or the spectrum. We leverage well-established algorithms that are widely used in the context of classical signal processing, demonstrating two complementary methods to do this, vectorial phase retrieval and two-dimensional phase retrieval. We numerically investigate the feasibility of both approaches for estimating the spectrum of the Fermi-Hubbard model and discuss their resilience to inherent statistical noise.
- 5 March 2026
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 7 (1)
Top Cited PapersOpen AccessQuantum Phase Estimation Without Controlled Unitaries
In this work we demonstrate the use of adapted classical phase retrieval algorithms to perform control-free quantum phase estimation. We eliminate the costly controlled time evolution and Hadamard test commonly required to access the complex time-series needed to reconstruct the spectrum. This significant reduction of the number of coherent controlled-operations lowers the circuit depth and considerably simplifies the implementation of statistical quantum phase estimation in near-term devices. This seemingly impossible task can be achieved by extending the problem that one wishes to solve to one with a larger set of input signals while exploiting natural constraints on the signal and/or the spectrum. We leverage well-established algorithms that are widely used in the context of classical signal processing, demonstrating two complementary methods to do this, vectorial phase retrieval and two-dimensional phase retrieval. We numerically investigate the feasibility of both approaches for estimating the spectrum of the Fermi-Hubbard model and discuss their resilience to inherent statistical noise.
- Open Access
- 17 November 2025
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 9, 1915
Boundaries for quantum advantage with single photons and loop-based time-bin interferometers
Loop-based boson samplers interfere photons in the time degree of freedom using a sequence of delay lines. Since they require few hardware components while also allowing for long-range entanglement, they are strong candidates for demonstrating quantum advantage beyond the reach of classical emulation. We propose a method to exploit this loop-based structure to more efficiently classically sample from such systems. Our algorithm exploits a causal-cone argument to decompose the circuit into smaller effective components that can each be simulated sequentially by calling a state vector simulator as a subroutine. To quantify the complexity of our approach, we develop a new lattice path formalism that allows us to efficiently characterize the state space that must be tracked during the simulation. In addition, we develop a heuristic method that allows us to predict the expected average and worst-case memory requirements of running these simulations. We use these methods to compare the simulation complexity of different families of loop-based interferometers, allowing us to quantify the potential for quantum advantage of single-photon Boson Sampling in loop-based architectures.
- 17 November 2025
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 9, 1915
Open AccessBoundaries for quantum advantage with single photons and loop-based time-bin interferometers
Loop-based boson samplers interfere photons in the time degree of freedom using a sequence of delay lines. Since they require few hardware components while also allowing for long-range entanglement, they are strong candidates for demonstrating quantum advantage beyond the reach of classical emulation. We propose a method to exploit this loop-based structure to more efficiently classically sample from such systems. Our algorithm exploits a causal-cone argument to decompose the circuit into smaller effective components that can each be simulated sequentially by calling a state vector simulator as a subroutine. To quantify the complexity of our approach, we develop a new lattice path formalism that allows us to efficiently characterize the state space that must be tracked during the simulation. In addition, we develop a heuristic method that allows us to predict the expected average and worst-case memory requirements of running these simulations. We use these methods to compare the simulation complexity of different families of loop-based interferometers, allowing us to quantify the potential for quantum advantage of single-photon Boson Sampling in loop-based architectures.
- Open Access
- 5 August 2019
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 3
Simulating boson sampling in lossy architectures
Photon losses are among the strongest imperfections affecting multi-photon interference. Despite their importance, little is known about their effect on boson sampling experiments. In this work we show that using classical computers, one can efficiently simulate multi-photon interference in all architectures that suffer from an exponential decay of the transmission with the depth of the circuit, such as integrated photonic circuits or optical fibers. We prove that either the depth of the circuit is large enough that it can be simulated by thermal noise with an algorithm running in polynomial time, or it is shallow enough that a tensor network simulation runs in quasi-polynomial time. This result suggests that in order to implement a quantum advantage experiment with single-photons and linear optics new experimental platforms may be needed.
- 5 August 2019
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 3
Open AccessSimulating boson sampling in lossy architectures
Photon losses are among the strongest imperfections affecting multi-photon interference. Despite their importance, little is known about their effect on boson sampling experiments. In this work we show that using classical computers, one can efficiently simulate multi-photon interference in all architectures that suffer from an exponential decay of the transmission with the depth of the circuit, such as integrated photonic circuits or optical fibers. We prove that either the depth of the circuit is large enough that it can be simulated by thermal noise with an algorithm running in polynomial time, or it is shallow enough that a tensor network simulation runs in quasi-polynomial time. This result suggests that in order to implement a quantum advantage experiment with single-photons and linear optics new experimental platforms may be needed.
- Open Access
Simulating boson sampling in lossy architectures
Photon losses are among the strongest imperfections affecting multi-photon interference. Despite their importance, little is known about their effect on boson sampling experiments. In this work we show that using classical computers, one can efficiently simulate multi-photon interference in all architectures that suffer from an exponential decay of the transmission with the depth of the circuit, such as integrated photonic circuits or optical fibers. We prove that either the depth of the circuit is large enough that it can be simulated by thermal noise with an algorithm running in polynomial time, or it is shallow enough that a tensor network simulation runs in quasi-polynomial time. This result suggests that in order to implement a quantum advantage experiment with single-photons and linear optics new experimental platforms may be needed.
Open AccessSimulating boson sampling in lossy architectures
Photon losses are among the strongest imperfections affecting multi-photon interference. Despite their importance, little is known about their effect on boson sampling experiments. In this work we show that using classical computers, one can efficiently simulate multi-photon interference in all architectures that suffer from an exponential decay of the transmission with the depth of the circuit, such as integrated photonic circuits or optical fibers. We prove that either the depth of the circuit is large enough that it can be simulated by thermal noise with an algorithm running in polynomial time, or it is shallow enough that a tensor network simulation runs in quasi-polynomial time. This result suggests that in order to implement a quantum advantage experiment with single-photons and linear optics new experimental platforms may be needed.
- Open Access
- 30 March 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 64 (6) , 4664-4673
Quantum Enhancement of Randomness Distribution
The capability of a given channel to communicate information is, a priori, distinct from its capability to distribute shared randomness. In this paper, we define randomness distribution capacities of quantum channels assisted by forward, back, or two-way classical communication and compare these to the corresponding communication capacities. With forward assistance or no assistance, we find that they are equal. We establish the mutual information of the channel as an upper bound on the two-way assisted randomness distribution capacity. This implies that all of the capacities are equal for classical-quantum channels. On the other hand, we show that the back-assisted randomness distribution capacity of a quantum-classical channel is equal to its mutual information. This is often strictly greater than the back-assisted communication capacity. We give an explicit example of such a separation where the randomness distribution protocol is noiseless.
- 30 March 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 64 (6) , 4664-4673
Open AccessQuantum Enhancement of Randomness Distribution
The capability of a given channel to communicate information is, a priori, distinct from its capability to distribute shared randomness. In this paper, we define randomness distribution capacities of quantum channels assisted by forward, back, or two-way classical communication and compare these to the corresponding communication capacities. With forward assistance or no assistance, we find that they are equal. We establish the mutual information of the channel as an upper bound on the two-way assisted randomness distribution capacity. This implies that all of the capacities are equal for classical-quantum channels. On the other hand, we show that the back-assisted randomness distribution capacity of a quantum-classical channel is equal to its mutual information. This is often strictly greater than the back-assisted communication capacity. We give an explicit example of such a separation where the randomness distribution protocol is noiseless.
- Open Access
- 18 November 2017
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 1, 33
Semi-device-independent framework based on natural physical assumptions
The semi-device-independent approach provides a framework for prepare-and-measure quantum protocols using devices whose behavior must not be characterized nor trusted, except for a single assumption on the dimension of the Hilbert space characterizing the quantum carriers. Here, we propose instead to constrain the quantum carriers through a bound on the mean value of a well-chosen observable. This modified assumption is physically better motivated than a dimension bound and closer to the description of actual experiments. In particular, we consider quantum optical schemes where the source emits quantum states described in an infinite-dimensional Fock space and model our assumption as an upper bound on the average photon number in the emitted states. We characterize the set of correlations that may be exhibited in the simplest possible scenario compatible with our new framework, based on two energy-constrained state preparations and a two-outcome measurement. Interestingly, we uncover the existence of quantum correlations exceeding the set of classical correlations that can be produced by devices behaving in a purely pre-determined fashion (possibly including shared randomness). This feature suggests immediate applications to certified randomness generation. Along this line, we analyze the achievable correlations in several prepare-and-measure optical schemes with a mean photon number constraint and demonstrate that they allow for the generation of certified randomness. Our simplest optical scheme works by the on-off keying of an attenuated laser source followed by photocounting. It opens the path to more sophisticated energy-constrained semi-device-independent quantum cryptography protocols, such as quantum key distribution.
- 18 November 2017
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 1, 33
Open AccessSemi-device-independent framework based on natural physical assumptions
The semi-device-independent approach provides a framework for prepare-and-measure quantum protocols using devices whose behavior must not be characterized nor trusted, except for a single assumption on the dimension of the Hilbert space characterizing the quantum carriers. Here, we propose instead to constrain the quantum carriers through a bound on the mean value of a well-chosen observable. This modified assumption is physically better motivated than a dimension bound and closer to the description of actual experiments. In particular, we consider quantum optical schemes where the source emits quantum states described in an infinite-dimensional Fock space and model our assumption as an upper bound on the average photon number in the emitted states. We characterize the set of correlations that may be exhibited in the simplest possible scenario compatible with our new framework, based on two energy-constrained state preparations and a two-outcome measurement. Interestingly, we uncover the existence of quantum correlations exceeding the set of classical correlations that can be produced by devices behaving in a purely pre-determined fashion (possibly including shared randomness). This feature suggests immediate applications to certified randomness generation. Along this line, we analyze the achievable correlations in several prepare-and-measure optical schemes with a mean photon number constraint and demonstrate that they allow for the generation of certified randomness. Our simplest optical scheme works by the on-off keying of an attenuated laser source followed by photocounting. It opens the path to more sophisticated energy-constrained semi-device-independent quantum cryptography protocols, such as quantum key distribution.
- Open Access
- 2 November 2007
- Published by American Physical Society (APS) in Physical Review A
- Vol. 76 (5) , 052301
Tight bounds on the eavesdropping of a continuous-variable quantum cryptographic protocol with no basis switching
The Gaussian continuous-variable quantum key distribution protocol based on coherent states and heterodyne detection [Phys. Rev. Lett. 93, 170504 (2004)] has the advantage that no active random basis switching is needed on the receiver’s side. Its security is, however, not very satisfyingly understood today because the bounds on the secret key rate that have been derived from Heisenberg relations are not attained by any known scheme. Here, we address the problem of the optimal Gaussian individual attack against this protocol, and derive tight upper bounds on the information accessible to an eavesdropper. Interestingly, this protocol is proven to be even more resistant to individual attacks than originally thought. Optical schemes achieving these bounds are also exhibited, which concludes the security analysis of Gaussian protocols against individual attacks.
- 2 November 2007
- Published by American Physical Society (APS) in Physical Review A
- Vol. 76 (5) , 052301
Open AccessTight bounds on the eavesdropping of a continuous-variable quantum cryptographic protocol with no basis switching
The Gaussian continuous-variable quantum key distribution protocol based on coherent states and heterodyne detection [Phys. Rev. Lett. 93, 170504 (2004)] has the advantage that no active random basis switching is needed on the receiver’s side. Its security is, however, not very satisfyingly understood today because the bounds on the secret key rate that have been derived from Heisenberg relations are not attained by any known scheme. Here, we address the problem of the optimal Gaussian individual attack against this protocol, and derive tight upper bounds on the information accessible to an eavesdropper. Interestingly, this protocol is proven to be even more resistant to individual attacks than originally thought. Optical schemes achieving these bounds are also exhibited, which concludes the security analysis of Gaussian protocols against individual attacks.