arXiv subjects

Seungbeom Chin

Publications and source records attributed to Seungbeom Chin.

At least 19 recordsLinked to original sources

arXiv2026

Non-Gaussianity in cat codes: global incompatibility and local geometric alignment with the magic resource

Non-Gaussianity is an essential resource for genuine quantum advantages in continuous-variable quantum systems and is regarded as a counterpart of the magic resource in discrete-variable systems. Recently, an exact correspondence between non-Gaussianity (NG) and the magic resource was identified within the Gottesman--Kitaev--Preskill (GKP) encoding framework. Whether such a relation persists beyond GKP encoding, however, remains unclear. Here, we address this question in the cat-code setting. By comparing the Wigner logarithmic negativity (WLN) and a magic measure defined from a phase-operator basis, we analyze the resource geometry of non-degenerate $d$-peaked cat states. We find that cat codes do not inherit the global value-preserving GKP magic--NG equivalence, but their asymptotic WLN geometry allows a constructive local alignment with the magic-measure geometry. Specifically, under a distinguished SU($d$) asymptotic cat code, we establish a sector-dependent alignment between WLN level sets and magic-measure level sets based on their intrinsic local geometries. These results identify both the global incompatibility and the locally constructive relation between magic and non-Gaussian resources in cat codes, suggesting a geometry-based approach to resource correspondences beyond the GKP framework.

quant-ph↗

arXiv2026

Linear Optical Schemes to Postselect High-Dimensional Dicke States

Multipartite entanglement is an essential quantum resource for various distributed quantum applications. One promising method for preparing multipartite entanglement is to interfere independent photons at linear optical interference setups. While heralding the successful interference and thereby the state generation is often costly, postselecting entangled states provides an achievable alternative in this framework. We introduce a family of interference schemes for postselecting symmetric qudit Dicke states, useful resources in quantum communication and variational quantum computing. We present schemes with and without ancillary photons and show that using ancillary photons can exceed the upper bound on the success probability of schemes without ancillary photons. Our results accommodate a wide range of linear optical schemes, providing multiple viable approaches for postselecting Dicke states.

quant-ph↗

arXiv2025

Heralded Linear Optical Generation of Dicke States

Entanglement is a fundamental feature of quantum mechanics and a key resource for quantum information processing. Among multipartite entangled states, Dicke states $|D_n^k\rangle$ are distinguished by their permutation symmetry, which provides robustness against particle loss and enables applications for quantum communication and computation. Although Dicke states have been realized in various platforms, most optical implementations rely on postselection, which destroys the state upon detection and prevents its further use. A heralded optical scheme is therefore highly desirable. Here, we present a linear-optical heralded scheme for generating arbitrary Dicke states $|D_n^k\rangle$ with $3n+k$ photons through the framework of the linear quantum graph (LQG) picture. By mapping the scheme design into the graph-finding problem, and exploiting the permutation symmetry of Dicke states, we overcome the structural complexity that has hindered previous approaches. Our results provide a resource-efficient pathway toward practical heralded preparation of Dicke states for quantum technologies.

quant-ph↗

arXiv2024

Heralded Optical Entanglement Generation via the Graph Picture of Linear Quantum Networks

Non-destructive heralded entanglement with photons is a valuable resource for quantum information processing. However, they generally entail ancillary particles and modes that amplify the circuit intricacy. To address this challenge, a recent work (\href{https://www.nature.com/articles/s41534-024-00845-6}{npj Quantum Information 10, 67 (2024)}) introduced a graph approach for creating multipartite entanglements with boson subtractions. Nonetheless, it remains an essential intermediate step toward practical heralded schemes: the proposition of heralded subtraction operators in bosonic linear quantum networks. This research establishes comprehensive translation rules from subtraction operators to linear optical operators, which provides a seamless path to design heralded schemes with single photons. Our method begets enhanced or previously unreported schemes for the $N$-partite GHZ state with $2N$ photons, $N$-partite W state with $2N+1$ photons and superposition of $N=3$ GHZ and W states with 9 photons. Our streamlined approach can straightforwardly design heralded schemes for multipartite entangled states by assembling the operators according to the guidence of sculpting bigraphs, hence significantly simplifies the quantum circuit design process.

quant-ph↗

arXiv2024

Exponentially Enhanced Scheme for the Heralded Qudit GHZ State in Linear Optics

High-dimensional multipartite entanglement plays a crucial role in quantum information science. However, existing schemes for generating such entanglement become complex and costly as the dimension of quantum units increases. In this work, we overcome the limitation by proposing a significantly enhanced linear optical heralded scheme that generates the $d$-level $N$-partite GHZ state with single-photon sources and linear operations. Our scheme requires $dN$ photons, which is the minimal required photon number, with substantially improved success probability from previous schemes. It employs linear optical logic gates compatible with any qudit encoding system and can generate generalized GHZ states with installments of beamsplitters. With efficient generations of high-dimensional resource states, our work opens avenues for further exploration in high-dimensional quantum information processing.

quant-ph↗

arXiv2024

Heralded optical entanglement distribution via lossy quantum channels: A comparative study

Quantum entanglement serves as a foundational resource for various quantum technologies. In optical systems, entanglement distribution rely on the indistinguishability and spatial overlap of photons. Heralded schemes play a crucial role in ensuring the reliability of entanglement generation by detecting ancillary photons to signal the creation of desired entangled states. However, photon losses in quantum channels remain a significant challenge, limiting the distance and capacity of entanglement distributions. This study suggests three heralded schemes that distribute multipartite Greenberger-Horne-Zeilinger (GHZ) states via lossy quantum channels. These schemes utilize different photon sources (Bell states or single-photons) and channel structures (centralized or decentralized heralding detectors). By comparing success probabilities and heralding efficiency, we find that each scheme has its own advantage according to the number of parties and the channel distance and the security requirement. This analysis provides insights into designing resilient heralded circuits for quantum information processing over lossy channels.

quant-ph↗

arXiv2024

Shortcut to Multipartite Entanglement Generation: A Graph Approach to Boson Subtractions

We propose a graph method for systematically searching for schemes that can generate multipartite entanglement in linear bosonic systems with heralding. While heralded entanglement generation offers more tolerable schemes for quantum tasks than postselected ones, it is generally more challenging to find appropriate circuits for multipartite systems. We show that our graph mapping from boson subtractions provides handy tactics to overcome the limitations in circuit designs. We present a practical strategy to mitigate the limitation through the implementation of our graph technique. Our physical setup is based on the sculpting protocol, which utilizes an $ N$ spatially overlapped subtractions of single bosons to convert Fock states of evenly distributed bosons into entanglement. We have identified general schemes for qubit N-partite GHZ and W states, which are significantly more efficient than previous schemes. In addition, our scheme for generating the superposition of $N=3$ GHZ and W entangled states illustrates that our approach can be extended to derive more generalized forms of entangled states. Furthermore, we have found an N-partite GHZ state generation scheme for qudits, which requires substantially fewer particles than previous proposals. These results demonstrate the power of our approach in discovering optimized solutions for the generation of intricate heralded entangled states. As a proof of concept, we propose a linear optical scheme for the generation of the Bell state by heralding detections. We expect our method to serve as a promising tool in generating diverse entanglement.

quant-ph↗

arXiv2024

Creating highly symmetric qudit heralded entanglement through highly symmetric graphs

Recent attention has turned to exploring quantum information within larger Hilbert spaces by utilizing qudits, which offer increased information capacity and potential for robust quantum communications. While the efficient generation of multipartite qudit entanglement is crucial for studying quantum correlations in high-dimensional Hilbert spaces, the increased dimension makes the circuit design challanging, especially when the entanglement is generated by heralding detections. In this work, we demonstrate that the graph picture of linear quantum networks (LQG picture) can provide a simplified method to generate qudit multipartite heralded entanglement of high symmetries. The LQG picture enables the reduction of circuit complexity by directly imposing the state symmetry onto the circuit structure. Leveraging this insight, we propose heralded schemes for generating $N$-partite $N$-level anti-symmetric (singlet) and symmetric (Dicke) states. Our study shed light on the optimal circuit design of high-dimensional entanglement with a systematic graphical strategy.

quant-ph↗

arXiv2023

Efficient Graph State Generation in Linear Optics

Graph states are central resources for quantum information processing, supporting applications in computation, communication, and error correction. In photonic systems, they are typically assembled from smaller entangled states using probabilistic fusion gates, which demand many photons and suffer from low success rates. We present an optimized scheme for directly generating caterpillar graph states (CGSs)---essential resource states for constructing high-dimensional lattice graph states---using only single-photon sources, linear optics, and heralded measurements. Based on the linear quantum graph (LQG) picture, our method produces CGSs efficiently. For CGSs of length $l\ge 3$, it requires $l-2$ fewer photons and achieves a success rate $2^{l-2}$ times higher than fusion-based approaches. These results demonstrate that the LQG picture provides a powerful and flexible route to generating complex photonic graph states for efficient quantum information processing.

quant-ph↗

arXiv2023

Quantum circuit simulation of linear optics using fermion to qubit encoding

This work proposes a digital quantum simulation protocol for the linear scattering process of bosons, which provides a simple extension to partially distinguishable boson cases. Our protocol is achieved by combining the boson-fermion correspondence relation and fermion to qubit encoding protocols. As a proof of concept, we designed quantum circuits for generating the Hong-Ou-Mandel dip by varying particle distinguishability. The circuits were verified with the classical and quantum simulations using the IBM Quantum and IonQ cloud services.

quant-ph↗

arXiv2022

Entangling three identical particles via spatial overlap

Quantum correlations between identical particles are at the heart of quantum technologies. Several studies with two identical particles have shown that the spatial overlap and indistinguishability between the particles are necessary for generating bipartite entanglement. On the other hand, researches on the extension to more than two-particle systems are limited by the practical difficulty to control multiple identical particles in laboratories. In this work, we propose schemes to generate two fundamental classes of genuine tripartite entanglement, i.e., GHZ and W classes, which are experimentally demonstrated with three identical photons. We also show that the tripartite entanglement class decays from the genuine entanglement to the full separability as the particles become more distinguishable from each other. Our results support the prediction that particle indistinguishability is a fundamental element for entangling identical particles.

quant-ph↗

arXiv2021

Graph Picture of Linear Quantum Networks and Entanglement

The indistinguishability of quantum particles is widely used as a resource for the generation of entanglement. Linear quantum networks (LQNs), in which identical particles linearly evolve to arrive at multimode detectors, exploit the indistinguishability to generate various multipartite entangled states by the proper control of transformation operators. However, it is challenging to devise a suitable LQN that carries a specific entangled state or compute the possible entangled state in a given LQN as the particle and mode number increase. This research presents a mapping process of arbitrary LQNs to graphs, which provides a powerful tool for analyzing and designing LQNs to generate multipartite entanglement. We also introduce the perfect matching diagram (PM diagram), which is a refined directed graph that includes all the essential information on the entanglement generation by an LQN. The PM diagram furnishes rigorous criteria for the entanglement of an LQN and solid guidelines for designing suitable LQNs for the genuine entanglement. Based on the structure of PM diagrams, we compose LQNs for fundamental $N$-partite genuinely entangled states.

quant-ph↗

arXiv2021

Taming identical particles for discerning the genuine non-locality

This work provides a comprehensive approach to analyze the entanglement between subsystems generated by identical particles, based on the symmetric/exterior algebra (SEA) and microcausality. Our method amends the no-labeling approach (NLA) to quantify any type of identical particles' entanglement, especially fermions with the parity superselection rule. We can analyze the non-local properties of identical particles' states in a fundamentally equivalent way to those for non-identical particles, which is achieved by the factorizability of the total Hilbert space of identical particles. This formal correspondence between identical and non-identical particle systems turns out to be useful for quantifying the non-locality generated by identical particles, such as the maximal CHSH inequality violation and the GHJW theorem of identical particles.

quant-ph↗

arXiv2020

Reduced density matrix of nonlocal identical particles

We probe the theoretical connection among three different approaches to analyze the entanglement of identical particles, i.e., the first quantization language (1QL), elementary-symmetric/exterior products (which has the mathematical equivalence to no-labeling approaches), and the algebraic approach based on the GNS construction. Among several methods to quantify the entanglement of identical particles, we focus on the computation of reduced density matrices, which can be achieved by the concept of \emph{symmetrized partial trace} defined in 1QL. We show that the symmetrized partial trace corresponds to the interior product in symmetric and exterior algebra (SEA), which also corresponds to the subalgebra restriction in the algebraic approach based on GNS representation. Our research bridges different viewpoints for understanding the quantum correlation of identical particles in a consistent manner.

quant-ph↗

arXiv2019

Entangling Bosons through Particle Indistinguishability and Spatial Overlap

Particle identity and entanglement are two fundamental quantum properties that work as major resources for various quantum information tasks. However, it is still a challenging problem to understand the correlation of the two properties in the same system. While recent theoretical studies have shown that the spatial overlap between identical particles is necessary for nontrivial entanglement, the exact role of particle indistinguishability in the entanglement of identical particles has never been analyzed quantitatively before. Here, we theoretically and experimentally investigate the behavior of entanglement between two bosons as spatial overlap and indistinguishability simultaneously vary. The theoretical computation of entanglement for generic two bosons with pseudospins is verified experimentally in a photonic system. Our results show that the amount of entanglement is a monotonically increasing function of both quantities. We expect that our work provides an insight into deciphering the role of the entanglement in quantum networks that consist of identical particles.

quant-ph↗

arXiv2019

Partial Distinguishability as a Coherence Resource in Boson Sampling

Quantum coherence is a useful resource that is consumed to accomplish several tasks that classical devices are hard to fulfill. Especially, it is considered to be the origin of quantum speedup for many computational algorithms. In this work, we interpret the computational time cost of boson sampling with partially distinguishable photons from the perspective of coherence resource theory. With incoherent operations that preserve the diagonal elements of quantum states up to permutation, which we name \emph{permuted genuinely incoherent operation} (pGIO), we present some evidence that the decrease of coherence corresponds to a computationally less complex system of partially distinguishable boson sampling. Our result shows that coherence is one of crucial resources for the computational time cost of boson sampling. We expect our work presents an insight to understand the quantum complexity of the linear optical network system.

quant-ph↗

arXiv2019

Majorization and the time complexity of linear optical networks

This work shows that the majorization of photon distributions is related to the runtime of classically simulating multimode passive linear optics, which explains one aspect of the boson sampling hardness. A Shur-concave quantity which we name the \emph{Boltzmann entropy of elementary quantum complexity} ($S_B^q$) is introduced to present some quantitative analysis of the relation between the majorization and the classical runtime for simulating linear optics. We compare $S_B^q$ with two quantities that are important criteria for understanding the computational cost of the photon scattering process, $\mathcal{T}$ (the runtime for the classical simulation of linear optics) and $\mathcal{E}$ (the additive error bound for an approximated amplitude estimator). First, for all the known algorithms for computing the permanents of matrices with repeated rows and columns, the runtime $\mathcal{T}$ becomes shorter as the input and output distribution vectors are more majorized. Second, the error bound $\mathcal{E}$ decreases as the majorization difference of input and output states increases. We expect that our current results would help in understanding the feature of linear optical networks from the perspective of quantum computation.

quant-ph↗

arXiv2019

Entanglement of Identical Particles and Coherence in the First Quantization Language

We suggest a formalism to illustrate the entanglement of identical particles in the first quantization language (1QL). Our 1QL formalism enables one to exploit all the well-established quantum information tools to understand the indistinguishable ones, including the reduced density matrix and familiar entanglement measures. The rigorous quantitative relation between the amount of entanglement and the spatial coherence of particles is possible in this formalism. Our entanglement detection process is a generalization of the entanglement extraction protocol for identical particles with mode splitting proposed by Killoran et al. (2014).

quant-ph↗