Le Phuc Thinh
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
Research Interests
Le Phuc Thinh has a total of 55 co-authors. Here are the top co-authors by number of shared publications:
- Valerio Scarani
Centre for Quantum Technologies, National University of Singapore, Singapore, Singapore
5 shared publications Jean-Daniel Bancal
Department of Physics, University of Basel, Klingelbergstrasse 82, 4056 Basel, Switzerland
4 shared publicationsStephanie Wehner
QuTech, Delft University of Technology, Lorentzweg 1, Delft, 2628CJ, NETHERLANDS
4 shared publicationsLana Sheridan
3 shared publicationsJonas Helsen
QuTech, Delft University of Technology, Lorentzweg 1, 2628 CJ Delft, The Netherlands
2 shared publicationsJérémy Ribeiro
Technische Universiteit Delft, Delft, 2600 AA, NETHERLANDS
2 shared publications
Latest Publications
- Open Access
- 9 June 2026
- Published by American Physical Society (APS) in Physical Review Applied
- Vol. 25 (6)
Superconducting qubits in the millions: The potential and limitations of modularity
The development of fault-tolerant quantum computers (FTQCs) is receiving increasing attention within the quantum computing community. Like conventional digital computers, FTQCs, which utilize error correction and millions of physical qubits, have the potential to address some of humanity’s grand challenges. However, accurate estimates of the tangible scale of future FTQCs, based on transparent assumptions, are uncommon. How many physical qubits are necessary to solve a practical problem intractable for classical hardware? What costs arise from distributing quantum computation across multiple machines? This paper presents an architectural model of a potential FTQC based on superconducting qubits, divided into discrete modules and interconnected via coherent links. We employ a resource-estimation framework and software tool to assess the physical resources required to execute specific quantum algorithms compiled into their graph-state form and arranged onto a modular superconducting hardware architecture. Our tool can predict the size, power consumption, and execution time of these algorithms based on explicit assumptions about the physical layout, thermal load, and modular connectivity of the system. We assess the resources needed for quantum computation examples that serve as building blocks of proposed applications, quantifying the architectural bottlenecks and trade-offs that remain to be addressed to deliver utility.
- 9 June 2026
- Published by American Physical Society (APS) in Physical Review Applied
- Vol. 25 (6)
Open AccessSuperconducting qubits in the millions: The potential and limitations of modularity
The development of fault-tolerant quantum computers (FTQCs) is receiving increasing attention within the quantum computing community. Like conventional digital computers, FTQCs, which utilize error correction and millions of physical qubits, have the potential to address some of humanity’s grand challenges. However, accurate estimates of the tangible scale of future FTQCs, based on transparent assumptions, are uncommon. How many physical qubits are necessary to solve a practical problem intractable for classical hardware? What costs arise from distributing quantum computation across multiple machines? This paper presents an architectural model of a potential FTQC based on superconducting qubits, divided into discrete modules and interconnected via coherent links. We employ a resource-estimation framework and software tool to assess the physical resources required to execute specific quantum algorithms compiled into their graph-state form and arranged onto a modular superconducting hardware architecture. Our tool can predict the size, power consumption, and execution time of these algorithms based on explicit assumptions about the physical layout, thermal load, and modular connectivity of the system. We assess the resources needed for quantum computation examples that serve as building blocks of proposed applications, quantifying the architectural bottlenecks and trade-offs that remain to be addressed to deliver utility.
- Open Access
- 24 April 2025
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 7 (2)
Resource overheads and attainable rates for trapped-ion lattice surgery
We present estimates for the number of ions needed to implement fault-tolerant lattice surgery between spatially separated trapped-ion surface codes. Additionally, we determine attainable lattice surgery rates given a number of dedicated “communication ions” per logical qubit. Because our analysis depends heavily on the rate that syndrome extraction cycles take place, we survey the state-of the art and propose three possible cycle times between 10 and 1000 µ s that we could reasonably see realized provided certain technological milestones are met. Consequently, our numerical results indicate that hundreds of resource ions will be needed for lattice surgery in the slowest case, while close to a hundred thousand will be needed in the fastest case. The main factor contributing to these prohibitive estimates is the limited rate that ions can be coupled across traps. Our results indicate an urgent need for optical coupling to improve by one or more orders of magnitude for trapped-ion quantum computers to scale.
- 24 April 2025
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 7 (2)
Open AccessResource overheads and attainable rates for trapped-ion lattice surgery
We present estimates for the number of ions needed to implement fault-tolerant lattice surgery between spatially separated trapped-ion surface codes. Additionally, we determine attainable lattice surgery rates given a number of dedicated “communication ions” per logical qubit. Because our analysis depends heavily on the rate that syndrome extraction cycles take place, we survey the state-of the art and propose three possible cycle times between 10 and 1000 µ s that we could reasonably see realized provided certain technological milestones are met. Consequently, our numerical results indicate that hundreds of resource ions will be needed for lattice surgery in the slowest case, while close to a hundred thousand will be needed in the fastest case. The main factor contributing to these prohibitive estimates is the limited rate that ions can be coupled across traps. Our results indicate an urgent need for optical coupling to improve by one or more orders of magnitude for trapped-ion quantum computers to scale.
- 26 March 2025
- Published by Springer Nature in Nature Physics
- Vol. 21 (4) , 501-502
The limits of quantum correlations
- 26 March 2025
- Published by Springer Nature in Nature Physics
- Vol. 21 (4) , 501-502
The limits of quantum correlations
- Open Access
- 16 March 2023
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 7, 947
Quantum Correlations in the Minimal Scenario
In the minimal scenario of quantum correlations, two parties can choose from two observables with two possible outcomes each. Probabilities are specified by four marginals and four correlations. The resulting four-dimensional convex body of correlations, denoted , is fundamental for quantum information theory. We review and systematize what is known about , and add many details, visualizations, and complete proofs. In particular, we provide a detailed description of the boundary, which consists of three-dimensional faces isomorphic to elliptopes and sextic algebraic manifolds of exposed extreme points. These patches are separated by cubic surfaces of non-exposed extreme points. We provide a trigonometric parametrization of all extreme points, along with their exposing Tsirelson inequalities and quantum models. All non-classical extreme points (exposed or not) are self-testing, i.e., realized by an essentially unique quantum model.Two principles, which are specific to the minimal scenario, allow a quick and complete overview: The first is the pushout transformation, i.e., the application of the sine function to each coordinate. This transforms the classical correlation polytope exactly into the correlation body , also identifying the boundary structures. The second principle, self-duality, is an isomorphism between and its polar dual, i.e., the set of affine inequalities satisfied by all quantum correlations (“Tsirelson inequalities''). The same isomorphism links the polytope of classical correlations contained in to the polytope of no-signalling correlations, which contains .We also discuss the sets of correlations achieved with fixed Hilbert space dimension, fixed state or fixed observables, and establish a new non-linear inequality for involving the determinant of the correlation matrix.- 16 March 2023
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 7, 947
Open AccessQuantum Correlations in the Minimal Scenario
In the minimal scenario of quantum correlations, two parties can choose from two observables with two possible outcomes each. Probabilities are specified by four marginals and four correlations. The resulting four-dimensional convex body of correlations, denoted , is fundamental for quantum information theory. We review and systematize what is known about , and add many details, visualizations, and complete proofs. In particular, we provide a detailed description of the boundary, which consists of three-dimensional faces isomorphic to elliptopes and sextic algebraic manifolds of exposed extreme points. These patches are separated by cubic surfaces of non-exposed extreme points. We provide a trigonometric parametrization of all extreme points, along with their exposing Tsirelson inequalities and quantum models. All non-classical extreme points (exposed or not) are self-testing, i.e., realized by an essentially unique quantum model.Two principles, which are specific to the minimal scenario, allow a quick and complete overview: The first is the pushout transformation, i.e., the application of the sine function to each coordinate. This transforms the classical correlation polytope exactly into the correlation body , also identifying the boundary structures. The second principle, self-duality, is an isomorphism between and its polar dual, i.e., the set of affine inequalities satisfied by all quantum correlations (“Tsirelson inequalities''). The same isomorphism links the polytope of classical correlations contained in to the polytope of no-signalling correlations, which contains .We also discuss the sets of correlations achieved with fixed Hilbert space dimension, fixed state or fixed observables, and establish a new non-linear inequality for involving the determinant of the correlation matrix. - Open Access
- 11 September 2020
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 4, 320
Worst-case Quantum Hypothesis Testing with Separable Measurements
For any pair of quantum states (the hypotheses), the task of binary quantum hypotheses testing is to derive the tradeoff relation between the probability of rejecting the null hypothesis and of accepting the alternative hypothesis. The case when both hypotheses are explicitly given was solved in the pioneering work by Helstrom. Here, instead, for any given null hypothesis as a pure state, we consider the worst-case alternative hypothesis that maximizes under a constraint on the distinguishability of such hypotheses. Additionally, we restrict the optimization to separable measurements, in order to describe tests that are performed locally. The case has been recently studied under the name of ``quantum state verification''. We show that the problem can be cast as a semi-definite program (SDP). Then we study in detail the two-qubit case. A comprehensive study in parameter space is done by solving the SDP numerically. We also obtain analytical solutions in the case of commuting hypotheses, and in the case where the two hypotheses can be orthogonal (in the latter case, we prove that the restriction to separable measurements generically prevents perfect distinguishability). In regards to quantum state verification, our work shows the existence of more efficient strategies for noisy measurement scenarios.- 11 September 2020
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 4, 320
Open AccessWorst-case Quantum Hypothesis Testing with Separable Measurements
For any pair of quantum states (the hypotheses), the task of binary quantum hypotheses testing is to derive the tradeoff relation between the probability of rejecting the null hypothesis and of accepting the alternative hypothesis. The case when both hypotheses are explicitly given was solved in the pioneering work by Helstrom. Here, instead, for any given null hypothesis as a pure state, we consider the worst-case alternative hypothesis that maximizes under a constraint on the distinguishability of such hypotheses. Additionally, we restrict the optimization to separable measurements, in order to describe tests that are performed locally. The case has been recently studied under the name of ``quantum state verification''. We show that the problem can be cast as a semi-definite program (SDP). Then we study in detail the two-qubit case. A comprehensive study in parameter space is done by solving the SDP numerically. We also obtain analytical solutions in the case of commuting hypotheses, and in the case where the two hypotheses can be orthogonal (in the latter case, we prove that the restriction to separable measurements generically prevents perfect distinguishability). In regards to quantum state verification, our work shows the existence of more efficient strategies for noisy measurement scenarios. - Open Access
- 23 April 2020
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 5 (3) , 035008
Certification of a functionality in a quantum network stage
We consider testing the ability of quantum network nodes to execute multi-round quantum protocols. Specifically, we examine protocols in which the nodes are capable of performing quantum gates, storing qubits and exchanging said qubits over the network a certain number of times. We propose a simple ping-pong test, which provides a certificate for the capability of the nodes to run certain multi-round protocols. We first show that in the noise-free regime the only way the nodes can pass the test is if they do indeed possess the desired capabilities. We then proceed to consider the case where operations are noisy, and provide an initial analysis showing how our test can be used to estimate parameters that allow us to draw conclusions about the actual performance of such protocols on the tested nodes. Finally, we investigate the tightness of this analysis using example cases in a numerical simulation.
- 23 April 2020
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 5 (3) , 035008
Open AccessCertification of a functionality in a quantum network stage
We consider testing the ability of quantum network nodes to execute multi-round quantum protocols. Specifically, we examine protocols in which the nodes are capable of performing quantum gates, storing qubits and exchanging said qubits over the network a certain number of times. We propose a simple ping-pong test, which provides a certificate for the capability of the nodes to run certain multi-round protocols. We first show that in the noise-free regime the only way the nodes can pass the test is if they do indeed possess the desired capabilities. We then proceed to consider the case where operations are noisy, and provide an initial analysis showing how our test can be used to estimate parameters that allow us to draw conclusions about the actual performance of such protocols on the tested nodes. Finally, we investigate the tightness of this analysis using example cases in a numerical simulation.
- 10 May 2019
- Published by American Physical Society (APS) in Physical Review A
- Vol. 99 (5) , 052108
Geometric structure of quantum correlators via semidefinite programming
Quantum information leverages correlations between spacelike separated parties in order to perform useful tasks such as secure communication and randomness certification. Nevertheless, not much is known about the intricate geometric features of the set quantum correlators. In this paper we study the structure of the set of quantum correlators using semidefinite programming, more precisely the boundary, extreme, and exposed points. We obtain quantum Bell inequalities characterizing a certain class of bipartite scenarios. In the case of two dichotomic measurements, extremal quantum correlators coincide with the correlators that uniquely determine the state and measurement operators, a property known as self-testing. We illustrate the usefulness of our theoretical findings with many examples and extensive computational work.
- 10 May 2019
- Published by American Physical Society (APS) in Physical Review A
- Vol. 99 (5) , 052108
Geometric structure of quantum correlators via semidefinite programming
Quantum information leverages correlations between spacelike separated parties in order to perform useful tasks such as secure communication and randomness certification. Nevertheless, not much is known about the intricate geometric features of the set quantum correlators. In this paper we study the structure of the set of quantum correlators using semidefinite programming, more precisely the boundary, extreme, and exposed points. We obtain quantum Bell inequalities characterizing a certain class of bipartite scenarios. In the case of two dichotomic measurements, extremal quantum correlators coincide with the correlators that uniquely determine the state and measurement operators, a property known as self-testing. We illustrate the usefulness of our theoretical findings with many examples and extensive computational work.
- 8 May 2019
- Published by American Physical Society (APS) in Physical Review A
- Vol. 99 (5) , 052311
Practical and reliable error bars for quantum process tomography
Current techniques in quantum process tomography typically return a single point estimate of an unknown process based on a finite albeit large amount of measurement data. Due to statistical fluctuations, however, other processes close to the point estimate can also produce the observed data with near certainty. Unless appropriate error bars can be constructed, the point estimate does not carry any sound operational interpretation. Here, we provide a solution to this problem by constructing a confidence region estimator for quantum processes. Our method enables reliable estimation of essentially any figure of merit for quantum processes on few qubits, including the diamond distance to a specific noise model, the entanglement fidelity, and the worst-case entanglement fidelity, by identifying error regions which contain the true state with high probability. We also provide a software package, QPtomographer, implementing our estimator for the diamond norm and the worst-case entanglement fidelity. We illustrate its usage and performance with several simulated examples. Our tools can be used to reliably certify the performance of, e.g., error correction codes, implementations of unitary gates, or more generally any noise process affecting a quantum system.
- 8 May 2019
- Published by American Physical Society (APS) in Physical Review A
- Vol. 99 (5) , 052311
Practical and reliable error bars for quantum process tomography
Current techniques in quantum process tomography typically return a single point estimate of an unknown process based on a finite albeit large amount of measurement data. Due to statistical fluctuations, however, other processes close to the point estimate can also produce the observed data with near certainty. Unless appropriate error bars can be constructed, the point estimate does not carry any sound operational interpretation. Here, we provide a solution to this problem by constructing a confidence region estimator for quantum processes. Our method enables reliable estimation of essentially any figure of merit for quantum processes on few qubits, including the diamond distance to a specific noise model, the entanglement fidelity, and the worst-case entanglement fidelity, by identifying error regions which contain the true state with high probability. We also provide a software package, QPtomographer, implementing our estimator for the diamond norm and the worst-case entanglement fidelity. We illustrate its usage and performance with several simulated examples. Our tools can be used to reliably certify the performance of, e.g., error correction codes, implementations of unitary gates, or more generally any noise process affecting a quantum system.
- 9 October 2018
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 121 (15) , 150402
Randomness Extraction from Bell Violation with Continuous Parametric Down-Conversion
We present a violation of the Clauser-Horne-Shimony-Holt inequality without the fair sampling assumption with a continuously pumped photon pair source combined with two high efficiency superconducting detectors. Because of the continuous nature of the source, the choice of the duration of each measurement round effectively controls the average number of photon pairs participating in the Bell test. We observe a maximum violation of with an average number of pairs per round of , compatible with our system overall detection efficiencies. Systems that violate a Bell inequality are guaranteed to generate private randomness, with the randomness extraction rate depending on the observed violation and on the repetition rate of the Bell test. For our realization, the optimal rate of randomness generation is a compromise between the observed violation and the duration of each measurement round, with the latter realistically limited by the detection time jitter. Using an extractor composably secure against quantum adversary with quantum side information, we calculate an asymptotic rate of . With an experimental run of 43 min, we generated 617 920 random bits, corresponding to .- 9 October 2018
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 121 (15) , 150402
Randomness Extraction from Bell Violation with Continuous Parametric Down-Conversion
We present a violation of the Clauser-Horne-Shimony-Holt inequality without the fair sampling assumption with a continuously pumped photon pair source combined with two high efficiency superconducting detectors. Because of the continuous nature of the source, the choice of the duration of each measurement round effectively controls the average number of photon pairs participating in the Bell test. We observe a maximum violation of with an average number of pairs per round of , compatible with our system overall detection efficiencies. Systems that violate a Bell inequality are guaranteed to generate private randomness, with the randomness extraction rate depending on the observed violation and on the repetition rate of the Bell test. For our realization, the optimal rate of randomness generation is a compromise between the observed violation and the duration of each measurement round, with the latter realistically limited by the detection time jitter. Using an extractor composably secure against quantum adversary with quantum side information, we calculate an asymptotic rate of . With an experimental run of 43 min, we generated 617 920 random bits, corresponding to .- Open Access
- 21 June 2018
- Published by American Physical Society (APS) in Physical Review A
- Vol. 97 (6) , 062333
Optimizing practical entanglement distillation
The goal of entanglement distillation is to turn a large number of weakly entangled states into a smaller number of highly entangled ones. Practical entanglement distillation schemes offer a trade-off between the fidelity to the target state and the probability of successful distillation. Exploiting such trade-offs is of interest in the design of quantum repeater protocols. Here, we present a number of methods to assess and optimize entanglement distillation schemes. We start by giving a numerical method to compute upper bounds on the maximum achievable fidelity for a desired probability of success. We show that this method performs well for many known examples by comparing it to well-known distillation protocols. This allows us to show optimality for many well-known distillation protocols for specific states of interest. As an example, we analytically prove optimality of the distillation protocol utilized within the Extreme Photon Loss entanglement generation scheme, even in the asymptotic limit. We proceed to present a numerical method that can improve an existing distillation scheme for a given input state, and we present an example for which this method finds an optimal distillation protocol. An implementation of our numerical methods is available as a Julia package.
- 21 June 2018
- Published by American Physical Society (APS) in Physical Review A
- Vol. 97 (6) , 062333
Open AccessOptimizing practical entanglement distillation
The goal of entanglement distillation is to turn a large number of weakly entangled states into a smaller number of highly entangled ones. Practical entanglement distillation schemes offer a trade-off between the fidelity to the target state and the probability of successful distillation. Exploiting such trade-offs is of interest in the design of quantum repeater protocols. Here, we present a number of methods to assess and optimize entanglement distillation schemes. We start by giving a numerical method to compute upper bounds on the maximum achievable fidelity for a desired probability of success. We show that this method performs well for many known examples by comparing it to well-known distillation protocols. This allows us to show optimality for many well-known distillation protocols for specific states of interest. As an example, we analytically prove optimality of the distillation protocol utilized within the Extreme Photon Loss entanglement generation scheme, even in the asymptotic limit. We proceed to present a numerical method that can improve an existing distillation scheme for a given input state, and we present an example for which this method finds an optimal distillation protocol. An implementation of our numerical methods is available as a Julia package.