arXiv subjects

Hyukjoon Kwon

Publications and source records attributed to Hyukjoon Kwon.

At least 19 recordsLinked to original sources

arXiv2026

Distributed variational quantum computing with deterministic entanglement tuning

Distributed quantum computing offers a scalable route to quantum information processing by entangling spatially separated processors. Although gate teleportation enables universal computation across distributed nodes, it requires repeated consumption of high-fidelity Bell pairs, ancillary qubits, and real-time feedforward, which imposes significant overhead and reduces fidelity. However, many variational quantum algorithms do not demand full universality; rather, they rely on sufficient expressibility to explore solution spaces effectively. Building on this, we propose a distributed variational quantum computing protocol based on deterministic entanglement tuning. In contrast to probabilistic filtering, our approach deterministically modulates pre-shared entanglement using only local operations and classical communication. We validate the protocol through a proof-of-principle experiment by estimating ground-state energies of the He-H$^+$ molecule and the Schwinger model, showing that diverse entanglement levels can be engineered to match problem-specific requirements. Our results suggest a practical alternative for near-term distributed quantum applications.

quant-ph↗

arXiv2026

Local Gaussian bounds on the non-destructive discrimination of two-mode squeezed states

Typical measurement setups in quantum systems are destructive, meaning that states are irretrievably altered after measurement. In this work, we analyse non-destructive discrimination of two two-mode squeezed vacuum states using local Gaussian measurements. We investigate a tradeoff relation between the success probability of discrimination and the fidelity of the resulting state with the initial state, and construct a protocol given by local Gaussian measurements, which is optimal within our numerically explored class. We also extend to the case where we allow for additional pre-shared entanglement, and show that this regime allows us to exceed the standard local Gaussian bound for the fidelity-success probability tradeoff. Our work provides a natural extension of the tradeoff between information gain and disturbance in entangled-state discrimination, previously established for finite-dimensional quantum systems, to infinite-dimensional continuous-variable systems.

quant-ph↗

arXiv2026

Symmetric $N \to M$ telecloning and remote quantum state inference

Teleporting unknown quantum states between distant nodes of a network is a significant feature of quantum communication. Few studies, however, have been conducted on $N \to M$ telecloning, in which $N$ copies of an unknown quantum state are optimally teleported to $M \geq N$ receivers. Previous work requires global POVMs on all copies and auxiliaries; here, we show that symmetric $N \to M$ telecloning can be probabilistically performed using only sequential (or parallel) Bell state measurements (BSMs), allowing the copies to be spatially separated. When successful, the fidelity of each receiver's reduced state saturates the bound imposed by the no-cloning theorem, with the probability of success being independent of $M$. In the case of an `unsuccessful' BSM, we show that the teleportation fidelity is likely to remain high, with the measurement outcome also providing information about the closest Pauli eigenbasis to the unknown state being telecloned. In this sense, each receiver can remotely infer the unknown quantum state with a level of confidence that scales with the number of copies, even if the fidelity of their own reduced state is sub-optimal. We additionally analyze the required resources to ensure the classical-communication fidelity bound is surpassed, both in terms of two-qubit inseparability and varying classes of multipartite entanglement. Surprisingly, we uncover that, at a given iteration of the protocol, pairwise entanglement is not always necessary to increase the teleportation fidelity and is never required to beat the classical bound for $N \geq 2$.

quant-ph↗

arXiv2026

Improved sample complexity bound for sample-based Lindbladian simulation

We establish improved sample-complexity bounds for sample-based Lindbladian simulation based on the Wave Matrix Lindbladization (WML) algorithm. For a jump operator $L$ with dimension $d$, we derive an explicit non-asymptotic sample complexity bound $n_d^*(t,\varepsilon) \le \left( \frac{2d+3}{8} \right) \|L\|_\infty^2 \left( \frac{t^2}{\varepsilon} \right)$, holding for simulation time $t$ and error $\varepsilon$. This refines the dimension dependence of the best previously known bound, $O(d^2 t^2/\varepsilon)$, from [Go et al., Quantum Sci. Tech. 10, 045058 (2025)]. Remarkably, we show that this dimensional overhead can be entirely avoided when $\| L\|_\infty^2 = O(1/d)$, a condition satisfied with high probability for random Lindblad operators, yielding a typical-case sample complexity of $O(t^2/\varepsilon)$. On the other hand, in the worst case, we show that WML necessarily requires $\Omega(dt^2/\varepsilon)$ samples by constructing an explicit example with a rank-one Lindblad operator. Our results reveal a sharp dichotomy between typical and adversarial sample complexities in Lindbladian simulation, thereby strengthening the theoretical foundations of sample-based quantum algorithms.

quant-ph↗

arXiv2026

A Levitated Random Telegraph Noise Spectrometer

Random Telegraph Noise is a ubiquitous process manifesting across technology and the natural world. It is characterized by random jumps between two distinct states with Poissonian waiting times, and is the origin of 1/f noise. Understanding and characterizing this noise is critical for the reliable operation of micro-, nano- and quantum-technologies. In this work we probe random telegraph noise using a levitated microparticle sensor whose dynamics are driven almost entirely by this non-white source of noise. We observe a startling resonant behaviour, characterized by a thousand-fold increase in the underdamped sensor's position fluctuations, enabling us to measure the spectral properties of the noise over six decades of timescale. This work not only provides a unique way to probe random telegraph noise, but also demonstrates a platform for studying non-equilibrium stochastic dynamics in the presence of realistic non-white noise, with applications from biology to social behaviour.

physics.ins-det↗

arXiv2026

Code-agnostic bosonic noise suppression with hybrid rotations

Physical-level noise on traveling bosonic modes remains a critical bottleneck for scalable quantum information processing. We show that for any single-mode bosonic code (qumode) corrupted by thermal or Gaussian displacement noise at loss rate $\mu$ and amplification $G$, a hybrid continuous-discrete-variable (CV-DV) interferometer using a single qubit ancilla and two controlled-Fourier (CF) gates sandwiching the noise channel suppresses its effects from linear to quadratic scaling. This is achieved without active error correction or destructive measurements of the encoded state, maintaining high success probabilities $\geq 0.5$ when $\mu G \leq 0.5$. When supplemented with multiple ancillas, the protocol converts photon loss into coherent Fock-damping, and thermal or displacement noise into a mixture of Fock-diagonal noise. The protocol is entirely code-agnostic. For the special case of $2^K$-fold rotation-symmetric bosonic codes, it simplifies to conventional error detection and projection with $K$ ancillas. Suppression with simple gates and few ancillas demonstrates a clear hardware-efficient advantage over previously proposed ``bypass'' schemes, where quantum information transferred to the DV ancillas is readily corrupted by ancilla noise. Finally, we extend the protocol to a qutrit DV ancilla. This demonstrates resilience to both CV noise and composite DV damping noise, achieving a truly hybrid noise suppression scheme that operates effectively even on CV encodings lacking a well-defined photon-number parity syndrome.

quant-ph↗

arXiv2026

The power of entanglement in distributed quantum machine learning

The quantum internet aims to interconnect distant devices and enable large-scale computation through distributed quantum algorithms. One of the key obstacles is communication latency during computation. Even separations of a few hundred kilometers introduce millisecond-scale delays, which exceed the coherence times of many solid-state qubit platforms. In contrast, entanglement can be established beforehand and used as a practical resource to reduce communication complexity between remote nodes. Here we examine the utility of entanglement in distributed quantum machine learning for binary classification tasks. Drawing an analogy with the CHSH game, we show that entanglement improves classification accuracy across all datasets considered. We also find that excessive entanglement may degrade performance by reducing the effective dimension of the parameter space. This highlights the importance of using an appropriate amount and structure of entanglement in data embedding. Our findings bridge nonlocality and machine-learning advantage, providing a pathway toward distributed quantum computation beyond coherence-time constraints.

quant-ph↗

arXiv2026

Autonomous Quantum Error Correction of Spin-Oscillator Hybrid Qubits

We propose a novel measurement-free scheme for stabilizing a spin-oscillator hybrid qubit via autonomous quantum error correction. The engineered Lindbladian renders the code space into an attractive steady-state subspace, realized by coupling the storage mode to a rapidly cooled bath through a controlled beam-splitter and spin-dependent displacement interactions. The continuous variable-discrete variable hybrid approach to autonomous quantum error correction preserves the hardware efficiency of conventional dissipation engineering while simplifying the required system-bath coupling. The construction is compatible with simple logical gates and leverages primitives already demonstrated in experimental platforms, such as trapped-ion systems, suggesting a practical route to hardware-efficient, noise-biased logical qubits without repeated syndrome measurements and feedforward.

quant-ph↗

arXiv2026

On the Entanglement Entropy Distribution of a Hybrid Quantum Circuit

We investigate the distribution of entanglement entropy in hybrid quantum circuits consisting of random unitary gates and local measurements applied at a finite rate. We demonstrate that higher moments of the entanglement entropy distribution, such as the ratio between the variance and the mean and the skewness, capture nontrivial features of the measurement-induced dynamics that are invisible to the mean entropy alone. We demonstrate that these quantities exhibit distinct and robust behaviors across the volume-law and area-law phases, and can serve as effective diagnostics of measurement-induced entanglement transitions. We propose a phenomenological model describing the effect of measurements in the area-law regime, which, when combined with the directed polymer in a random environment description of the volume-law phase, well matches numerical simulations across the entire phase diagram.

quant-ph↗

arXiv2026

Gluing Randomness via Entanglement: Tight Bound from Second R\'enyi Entropy

The efficient generation of random quantum states is a long-standing challenge, motivated by their diverse applications in quantum information processing tasks. In this work, we identify entanglement as the key resource that enables local random unitaries to generate global random states by effectively gluing randomness across the system. Specifically, we demonstrate that approximate random states can be produced from an entangled state $|\psi\rangle$ through the application of local random unitaries. We show that the resulting ensemble forms an approximate state design with an error saturating as $\Theta(e^{-\mathcal{N}_2(\psi)})$, where $\mathcal{N}_2(\psi)$ is the second R\'enyi entanglement entropy of $|\psi\rangle$. Furthermore, we prove that this tight bound also applies to the second R\'enyi entropy of coherence when the ensemble is constructed using coherence-free operations. These results imply that, when restricted to resource-free gates, the quality of the generated random states is determined entirely by the resource content of the initial state. Notably, we find that among all $\alpha$-R\'enyi entropeis, the second R\'enyi entropy yields the tightest bounds. Consequently, these second R\'enyi entropies can be interpreted as the maximal capacities for generating randomness using resource-free operations. Finally, moving beyond approximate state designs, we utilize this entanglement-assisted gluing mechanism to present a novel method for generating pseudorandom states in multipartite systems from a locally entangled state via pseudorandom unitaries in each of parties.

quant-ph↗

arXiv2026

Continuous-time noise mitigation in analogue quantum simulation

Analogue quantum simulators offer a promising route to explore quantum many-body dynamics beyond classical reach in the near term. However, their vulnerability to noise limits the accuracy of simulations. Here, we establish a new framework for mitigating noise in analogue quantum simulation, operating in a time-continuous manner. To our knowledge, this is the first protocol that is fully analogue and that achieves exact noise cancellation. Our method requires a small number of ancillary qubits, whose interaction with the system$-$combined with classical post-processing of joint measurement data$-$is tailored to cancel the effect of noise. Furthermore, the protocol is Hamiltonian-independent, robust to realistic ancilla noise, and avoids any discretization, preserving the continuous-time nature of the system's dynamics. This work opens a new direction for achieving high-fidelity analogue quantum simulation in the presence of noise.

quant-ph↗

arXiv2025

No-go theorem for norm-based quantumness-certification with linear functionals

Despite several approaches proposed to operationally characterize quantum states of light-those that cannot be sampled with a positive distribution over classical states-most existing formulations suffer from limited practicality or rely on convex optimization procedures that are computationally demanding. In this work, we develop a general convex resource-theoretic framework to quantify optical quantumness directly from the norms of linear functionals of quantum states, thereby avoiding any optimization. We further establish a no-go theorem demonstrating that no universal measure of quantumness can exist in the absence of optimization. Finally, we substantiate our theoretical result through explicit examples involving both Gaussian and non-Gaussian states.

quant-ph↗

arXiv2025

Ballistic bosonic noise suppression with hybrid qumode-qubit rotation gates

Noise suppression is of paramount importance for reliable quantum information processing and computation. We show that for any single-mode bosonic code (qumode) corrupted by thermal~noise at rate~$\eta$ and mean \mbox{excitation}~$\bar{n}$, a hybrid continuous-discrete-variable~(CV-DV) interferometer using only a single qubit ancilla~(DV) and two controlled~Fourier~(CF) gates sandwiching the noise channel suppresses its effects to $\mathcal{O}(\eta^2)$ \emph{without} any active error correction or destructive measurements of the encoded state and with high success probabilities~$>0.5$ if~$\eta(1+\bar{n})<0.5$. This suppression scheme works by conditionally monitoring the photon-number parities after the interferometer. Bosonic codes with two logical states of the same photon-number parity (like-parity codes) are \emph{completely resilient} to DV amplitude- and phase-damping ancilla noise. For such codes, the interferometer simplifies to the use of a qumode rotation gate and a \emph{single} CF~gate. This presents a clear advantage of our CF-gate-based error suppression scheme over previously-proposed ``bypass'' protocols, where qubit information transferred to the DV mode is readily corrupted by damping~noise. Finally, we present a simple extension to direct communication of qumode states between two parties over a noisy channel using a preshared DV entangled state, by implementing a CF gate in the first laboratory and its inverse in the other. Such a communication protocol achieves a similar fidelity performance at the same success rate as the single-party case, but with greater resilience to the ancilla noise than DV~teleportation. Resource-efficient multi-qubit codes that depend on a few essential long-range interactions can benefit from it.

quant-ph↗

arXiv2025

Exact and approximate conditions of tabletop reversibility: when is Petz recovery cost-free?

Channels $\mathcal{N}$ that describe open quantum dynamics are inherently irreversible: it is impossible to undo their effect completely, but one can study partial recovery of the information. The Petz recovery map $\hat{\mathcal{N}}_{\gamma}^{(\texttt{P})}$ is a systematic construction that depends only on $\mathcal{N}$ and on a reference state $\gamma$, which will be recovered exactly. If the real input state was different from $\gamma$, the recovery is partial, with a guarantee of near-optimality. Generically, an implementation of the Petz recovery map would look very different from the implementation of the channel. It is natural to study under which conditions the two maps require similar or even identical resources. The noisy forward channel $\mathcal{N}$ is called ``tabletop time-reversible'' for a given $\gamma$ when the corresponding Petz recovery map is realizable in such a way. First, we study the exact tabletop reversibility (TTR) conditions. We show in particular that a time-sensitive control of an ancilla system is needed. Second, we present the approximate TTR conditions, which do not require such a time-sensitive control. Third, we derive Lindbladian TTR conditions under a random-time collision model.

quant-ph↗

arXiv2025

Optimal Quantum Information Transmission Under a Continuous-Variable Erasure Channel

Quantum capacity gives the fundamental limit of information transmission through a channel. However, evaluating the quantum capacities of a continuous-variable bosonic quantum channel, as well as finding an optimal code to achieve the optimal information transmission rate, is in general challenging. In this work, we derive the quantum capacity and entanglement-assisted quantum capacity of the bosonic continuous-variable erasure channel when subject to energy constraints. We then construct random codes based on scrambling information within the typical subspace of the encoding state and prove that these codes are asymptotically optimal up to a constant gap. Finally, using our random coding scheme we design a bosonic variation of the Hayden-Preskill protocol and find that information recovery depends on the ratio between the input and output modes. This is in contrast with the conventional discrete-variable scenario which requires only a fixed number of additional output qudits.

quant-ph↗

arXiv2025

Photonic Hybrid Quantum Computing

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.

quant-ph↗

arXiv2025

Nonstabilizerness without Magic: Classically Simulatable Quantum States That Are Indistinguishable by Classically Simulatable Quantum Circuits

Quantum state discrimination plays a central role in defining the possible and impossible operations through a restricted class of quantum operations. A seminal result by Bennett et al. [Phys. Rev. A 59, 1070 (1999)] demonstrates the existence of a set of mutually orthogonal separable quantum states that cannot be perfectly distinguished by local operations and classical communication, a phenomenon known as nonlocality without entanglement. We show that a parallel structure exists in the resource theory of magic: there exists a set of mutually orthogonal stabilizer states that cannot be perfectly distinguished by stabilizer operations, which consist of Clifford gates, measurements in the computational basis, and additional ancillary stabilizer states. This phenomenon, which we term 'nonstabilizerness without magic,' reveals a fundamental asymmetry between the preparation of classically efficiently simulatable stabilizer states and their discrimination, which cannot be performed by classically efficiently simulatable quantum circuits. We further discuss the implications of our findings for quantum data hiding, the no-cloning of stabilizer states, and unconditional verification of non-Clifford gates.

quant-ph↗

arXiv2025

How Quantum Agents Can Change Which Strategies Are More Complex

Whether winning blackjack or navigating busy streets, achieving desired outcomes requires agents to execute adaptive strategies, strategies where actions depend contextually on past events. In complexity science, this motivates memory as an operational quantifier of complexity: given two strategies, the more complex one demands the agent to track more about the past. Here, we show that conclusions about complexity fundamentally depend on whether agents can process and store quantum information. Thus, while classical agents might find Strategy A more complex to execute than Strategy B, quantum agents can reach the opposite conclusion. We derive sufficient conditions for such contradictory conclusions and illustrate the phenomenon across multiple scenarios. As a byproduct, our results yield an information-theoretic lower bound on the minimal memory required by any agent - classical or quantum - to execute a given strategy.

quant-ph↗