YTYong Siah Teo

Yong Siah Teo

*This is an algorithmically generated author record based on publicly available information.

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


Yong Siah Teo has a total of 198 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Experimental evidence-based sub-Rayleigh source discrimination

    by Saurabh U. Shringarpure, Yong Siah Teo, Hyunseok Jeong, Michael Evans, Luis L. Sánchez-Soto, Antonin Grateau, Alexander Boeschoten, Nicolas Treps

    We propose a Bayesian evidence-based inference framework built on relative belief ratios and apply it to discriminating between one and two incoherent optical point sources using spatial-mode demultiplexing (SPADE). Unlike the Helstrom measurement, SPADE requires no collective detection and is optimal for asymptotically large samples. Our method avoids statistical constructs and draws inference directly from the information contained in the data, with all assumptions entering only through the likelihood model and prior beliefs. Using experimental evidence, we demonstrate the superior resolving performance of SPADE over direct imaging from a perspective that generalizes to multiple sources and offers a practical, robust approach to analyzing quantum-enhanced superresolution.

  • Open Access

    Photonic hybrid quantum computing

    by Jaehak Lee, Srikrishna Omkar, Yong Siah Teo, Seok-Hyung Lee, Hyukjoon Kwon, M.S. Kim, Hyunseok Jeong


  • Open Access

    Photonic Hybrid Quantum Computing

    by Jaehak Lee, Srikrishna Omkar, Yong Siah Teo, Seok-Hyung Lee, Hyukjoon Kwon, M. S. Kim, Hyunseok Jeong

    Photons are a ubiquitous carrier of quantum information: they are fast, suffer minimal decoherence, and do not require huge cryogenic facilities. Nevertheless, their intrinsically weak photon-photon interactions remain a key obstacle to scalable quantum computing. This review surveys hybrid photonic quantum computing, which exploits multiple photonic degrees of freedom to combine the complementary strengths of discrete and bosonic encodings, thereby significantly mitigating the challenge of weak photon-photon interactions. We first outline the basic principles of discrete-variable, native continuous-variable, and bosonic-encoding paradigms. We then summarise recent theoretical advances and state-of-the-art experimental demonstrations with particular emphasis on the hybrid approach. Its unique advantages, such as efficient generation of resource states and nearly ballistic (active-feedforward-free) operations, are highlighted alongside remaining technical challenges. To facilitate a clear comparison, we explicitly present the error thresholds and resource overheads required for fault-tolerant quantum computing. Our work offers a focused overview that clarifies how the hybrid approach enables scalable and compatible architectures for quantum computing.

  • Open Access

    Resource-efficient shadow tomography using equatorial stabilizer measurements

    by Guedong Park, Yong Siah Teo, Hyunseok Jeong

    We propose a resource-efficient shadow-tomography scheme using equatorial-stabilizer measurements generated from subsets of Clifford unitaries. For n -qubit systems, equatorial-stabilizer-based shadow-tomography schemes can estimate M observables (up to an additive error ɛ ) using O ( log ( M ) , poly ( n ) , 1 / ɛ 2 ) sampling copies for a large class of observables, including those with traceless parts possessing polynomially bounded Frobenius norms. For arbitrary quantum-state observables with a constant Frobenius norm, sampling complexity becomes n independent. Our scheme only requires an n -depth controlled- Z (CZ) circuit [ O ( n 2 ) CZ gates] and Pauli measurements per sampling copy. Alternatively, our scheme is realizable with 2 n -depth circuits comprising n 2 nearest-neighboring gates, exhibiting a smaller maximal gate count relative to previously known randomized-Clifford-based proposals. We numerically confirm our theoretically derived shadow-tomographic sampling complexities with random pure states and multiqubit graph states. Finally, we demonstrate that equatorial-stabilizer-based shadow tomography is more noise tolerant than randomized-Clifford-based schemes in terms of fidelity estimation for the Greenberger–Horne–Zeilinger state and W state.


  • Open Access

    Linear-optical protocols for mitigating and suppressing noise in bosonic systems

    by Y S Teo, S U Shringarpure, S Cho, H Jeong

    Quantum-information processing and computation with bosonic qubits are corruptible by noise channels. Using interferometers and photon-subtraction gadgets (PSGs) accompanied by linear amplification and attenuation, we establish linear-optical methods to mitigate and suppress bosonic noise channels. We first show that by employing amplifying and attenuating PSGs respectively at the input and output of either a thermal or random-displacement channel, probabilistic error cancellation (PEC) can be carried out to mitigate errors in expectation-value estimation. We also derive optimal physical estimators that are properly constrained to improve the sampling accuracy of PEC. Next, we prove that a purely-dephasing channel is coherently suppressible using a multimode Mach–Zehnder interferometer and conditional vacuum measurements (vacuum-based Mach–Zehnder scheme or the VMZ scheme). In the limit of infinitely-many ancillas, with nonvanishing success rates, VMZ using either Hadamard or two-design interferometers turns any dephasing channel into a phase-space-rotated linear-attenuation channel that can subsequently be inverted with (rotated) linear amplification without Kerr nonlinearity. Moreover, for weak central-Gaussian dephasing, the suppression fidelity increases monotonically with the number of ancillas and most optimally with Hadamard interferometers. We demonstrate the performance of these linear-optical mitigation and suppression schemes on common noise channels (and their compositions) and popular bosonic codes. While the theoretical formalism pertains to idling noise channels, we also provide numerical evidence supporting mitigation and suppression capabilities with respect to noise from universal gate operations.


  • Top Cited Papers
    Open Access

    Scaling and networking a modular photonic quantum computer

    by H. Aghaee Rad, T. Ainsworth, R. N. Alexander, B. Altieri, M. F. Askarani, R. Baby, L. Banchi, B. Q. Baragiola, J. E. Bourassa, R. S. Chadwick, et al.

    Photonics offers a promising platform for quantum computing1,2,3,4, owing to the availability of chip integration for mass-manufacturable modules, fibre optics for networking and room-temperature operation of most components. However, experimental demonstrations are needed of complete integrated systems comprising all basic functionalities for universal and fault-tolerant operation5. Here we construct a (sub-performant) scale model of a quantum computer using 35 photonic chips to demonstrate its functionality and feasibility. This combines all the primitive components as discrete, scalable rack-deployed modules networked over fibre-optic interconnects, including 84 squeezers6 and 36 photon-number-resolving detectors furnishing 12 physical qubit modes at each clock cycle. We use this machine, which we name Aurora, to synthesize a cluster state7 entangled across separate chips with 86.4 billion modes, and demonstrate its capability of implementing the foliated distance-2 repetition code with real-time decoding. The key building blocks needed for universality and fault tolerance are demonstrated: heralded synthesis of single-temporal-mode non-Gaussian resource states, real-time multiplexing actuated on photon-number-resolving detection, spatiotemporal cluster-state formation with fibre buffers, and adaptive measurements implemented using chip-integrated homodyne detectors with real-time single-clock-cycle feedforward. We also present a detailed analysis of our architecture’s tolerances for optical loss, which is the dominant and most challenging hurdle to crossing the fault-tolerant threshold. This work lays out the path to cross the fault-tolerant threshold and scale photonic quantum computers to the point of addressing useful applications.


  • Open Access

    Relative-belief inference in quantum information theory

    by Y. S. Teo, S. U. Shringarpure, H. Jeong, N. Prasannan, B. Brecht, C. Silberhorn, M. Evans, D. Mogilevtsev, L. L. Sánchez-Soto

    We introduce the framework of Bayesian relative belief that directly evaluates whether or not the experimental data at hand support a given hypothesis regarding a quantum system by directly comparing the prior and posterior probabilities for the hypothesis. In model-dimension certification tasks, we show that the relative-belief procedure typically chooses Hilbert spaces that are never smaller in dimension than those selected from optimizing a broad class of information criteria, including Akaike's criterion. As a concrete and focused exposition of this powerful evidence-based technique, we apply the relative-belief procedure to an important application: state reconstruction of imperfect quantum sources. In particular, just by comparing prior and posterior probabilities based on data, we demonstrate its capability of tracking multiphoton emissions using (realistically lossy) single-photon detectors in order to assess the actual quality of photon sources without making ad hoc assumptions, thereby reliably safeguarding source integrity for general quantum-information and communication tasks with Bayesian reasoning. Finally, we discuss how relative belief can be exploited to carry out parametric model certification and estimate the total dimension of the quantum state for the combined (measured) physical and interacting external systems described by the Tavis-Cummings model.


  • Open Access

    Evidence-Based Certification of Quantum Dimensions

    by Y. S. Teo, S. U. Shringarpure, H. Jeong, N. Prasannan, B. Brecht, C. Silberhorn, M. Evans, D. Mogilevtsev, L. L. Sánchez-Soto

    Identifying a reasonably small Hilbert space that completely describes an unknown quantum state is crucial for efficient quantum information processing. We introduce a general dimension-certification protocol for both discrete and continuous variables that is fully evidence based, relying solely on the experimental data collected and no other unjustified assumptions whatsoever. Using the Bayesian concept of relative belief, we take the effective dimension of the state as the smallest one such that the posterior probability is larger than the prior, as dictated by the data. The posterior probabilities associated with the relative-belief ratios measure the strength of the evidence provide by these ratios so that we can assess whether there is weak or strong evidence in favor or against a particular dimension. Using experimental data from spectral-temporal and polarimetry measurements, we demonstrate how to correctly assign Bayesian plausible error bars for the obtained effective dimensions. This makes relative belief a conservative and easy-to-use model-selection method for any experiment. Published by the American Physical Society 2024


  • Open Access

    Dequantizing quantum machine learning models using tensor networks

    by Seongwook Shin, Yong Siah Teo, Hyunseok Jeong

    Ascertaining whether a classical model can efficiently replace a given quantum model—dequantization—is crucial in assessing the true potential of quantum algorithms. In this work, we introduced the dequantizability of the function class of variational quantum-machine-learning (VQML) models by employing the tensor network formalism, effectively identifying every VQML model as a subclass of matrix product state (MPS) model characterized by constrained coefficient MPS and tensor product-based feature maps. From this formalism, we identify the conditions for which a VQML model's function class is dequantizable or not. Furthermore, we introduce an efficient quantum kernel-induced classical kernel which is as expressive as given any quantum kernel, hinting at a possible way to dequantize quantum kernel methods. This presents a thorough analysis of VQML models and demonstrates the versatility of our tensor-network formalism to properly distinguish VQML models according to their genuine quantum characteristics, thereby unifying classical and quantum machine-learning models within a single framework.


  • Error suppression in multicomponent cat codes with photon subtraction and teleamplification

    by Saurabh U. Shringarpure, Yong Siah Teo, Hyunseok Jeong

    It is known that multiphoton states can be protected from decoherence due to a passive loss channel by applying noiseless attenuation before and noiseless amplification after the channel. In this work, we propose the combined use of multiphoton subtraction on four-component cat codes and teleamplification to effectively suppress errors under detection and environmental losses. The back-action from multiphoton subtraction modifies the encoded qubit encoded on cat states by suppressing the higher photon numbers, while simultaneously ensuring that the original qubit can be recovered effectively through teleamplification followed by error correction, thus preserving its quantum information. With realistic photon subtraction and teleamplification-based scheme followed by optimal error-correcting maps, one can achieve a worst-case fidelity (over all encoded pure states) of over 93.5% (82% with only noisy teleamplification) at a minimum success probability of about 3.42%, under a 10% environmental-loss rate, 95% detector efficiency and sufficiently large cat states with the coherent-state amplitudes of 2. This sets a promising standard for combating large passive losses in quantum-information tasks in the noisy intermediate-scale quantum (NISQ) era, such as direct quantum communication or the storage of encoded qubits on the photonic platform.