arXiv subjects

Kyoungho Cho

Publications and source records attributed to Kyoungho Cho.

At least 19 recordsLinked to original sources

arXiv2026

Hayden--Preskill recovery at finite temperature on a quantum processor: dynamics and initial state from the SYK model

In the original Hayden--Preskill recovery, the post-injection scrambler and initial state are {\it not related}. We extend this setup in two ways: by using a SWAP gate so that the scrambler and initial state are {\it related}, and by considering recovery at {\it finite} temperature. For this modified protocol, we show that the information is successfully recovered in the sense that the postselection probability is non-negligible and the conditional fidelity is large. We find that both the postselection probability and the conditional fidelity are proportional to temperature, reflecting the reduced entanglement of the initial state at lower temperatures. We also derive their late-time analytic estimates under the assumption of uniform operator spreading and show that they agree well with the numerical results. This demonstrates that strong scrambling is important for successful information recovery. Implementing the protocol on an IBM superconducting processor using a binary sparse SYK Hamiltonian with $N = 8$ Majoranas, we observe that the data retain the qualitative recovery dynamics and that a SWAP-based error-mitigation scheme improves both the postselection probability and the conditional fidelity.

hep-th↗

arXiv2026

Hidden Complex Structure in Quotient-Space Real Quantum Mechanics

Barrios Hita et al. [Phys. Rev. Lett. $\bf{136}$, 240202 (2026)] argued that quantum mechanics can be formulated over the real numbers by replacing the tensor-product postulate with a quotient-space construction, and concluded that complex numbers are therefore a matter of convenience. We show that the operational content of this construction is not that of a generic real Hilbert-space theory. Empirical equivalence requires a distinguished real linear operator $J$ with $J^2 = -\mathbb{1}$, and all physical effects, instruments, and dynamics must preserve the corresponding $SO(2)$ gauge. Moreover, the composite-system rule is a balanced tensor product over this hidden complex structure, not the ordinary tensor product over $\mathbb{R}$. In multipartite network scenarios, this changes the meaning of source independence: canonical real representatives are not source-factorizable in the usual tensor-product sense. Thus, the construction is best understood as standard complex quantum mechanics written in real notation, not as an independent real-amplitude theory. This clarifies what is, and is not, excluded by experiments testing the necessity of complex numbers.

quant-ph↗

arXiv2026

Breaking the One-Dimensional Expressibility-Trainability Tradeoff

Expressive parameterized quantum circuits (PQCs) are often designed under a dilemma: the growth of expressibility and entangling power (EP) that improves Hilbert-space coverage is also expected to randomize an ansatz and activate barren-plateau (BP) conditions. We show that this dilemma is not a one-dimensional tradeoff. The usual picture collapses three inequivalent objects -- parameter-ensemble coverage, fixed-circuit entangling response, and local gradient moments -- into one scalar narrative. For a fixed circuit probed by Haar-product inputs, EP is a global two-copy mean of the output-entanglement distribution, whereas entangling-power deviation (EPD) is a global four-copy fluctuation descriptor. Gradient variance, however, is a local two-copy contraction selected by a parameter light cone and a cost observable. This moment hierarchy yields an analytic separation: equal EP need not imply equal trainability, as witnessed by equal-EP circuits with different EPDs and different gradient variances. These separations turn EP and EPD into a two-dial design rule for PQC ansatzes: EP measures how far the circuit has moved along the coverage dial, while EPD monitors whether input-dependent variability remains. We find that ansatz routes can reach high, Haar-like coverage before EPD and gradient variance collapse, showing that coverage and BP activation are distinct crossover events. The EP/EPD framework thus breaks the apparent one-dimensional expressibility-trainability tradeoff into a practical design rule: search for highly expressive PQCs in the window where coverage is high but BP-like homogenization has not yet erased trainable structure.

quant-ph↗

arXiv2026

First-Quantized Relativistic Quantum Simulation with Periodic and Dirichlet Boundary Conditions

In this work, we present a methodology for first-quantized relativistic quantum simulation on one-dimensional finite domains under the two boundary conditions most commonly used in lattice models: periodic boundary conditions (PBC) and Dirichlet boundary conditions (DBC). Starting from the positive-energy relativistic kinetic operator, we construct weakly relativistic lattice Hamiltonians whose leading correction requires the boundary-consistent discretized momentum moments $\langle \hat{P}^{2}\rangle$ and $\langle \hat{P}^{4}\rangle$. These moments are reconstructed in the PBC Hamiltonian from moments of a unitary cyclic translation while the DBC Hamiltonian uses the open-chain finite-difference. In a qubit-register implementation, it can be evaluated as the corresponding cyclic translation estimator plus boundary-local terms that remove the unphysical wrap-around link. The resulting energy-estimation workflow uses translation measurements for the kinetic terms, a small number of endpoints and near-endpoints overlap probabilities for DBC, and position-basis sampling for diagonal potentials. We valdate the framework of the relativistic quantum simulation in various benchmark potentials such as no potential and a cosine potential for PBC as well as an infinite square well and a harmonic potential for DBC, with finite-shot sampling tests. These benchmarks show good agreement between the estimator reconstruction and direct matrix evaluation while separating the finite-grid discretization, weak-relativistic truncation, and measurement errors.

quant-ph↗

arXiv2026

Quantum Occam Learning: Sample-Supported Expressibility for Circuit-Based Quantum Learning

A central principle in quantum machine learning is that an ansatz should be expressive enough to represent the quantum data of interest. Yet, the expressibility is statistically meaningful only insofar as it can be learned from finitely many copies of an unknown quantum state. In this work, we develop an information-theoretic Occam theory for quantum data generated by finite-size quantum circuits. For the class $S_{n,G}$ of $n$-qubit pure states preparable with at most $G$ two-qubit gates, a metric-entropy argument gives the realizable sample law $\widetilde{\Theta}(G/\epsilon^2)$ in the circuit-limited regime. For an arbitrary source $\hat{\rho}$, we introduce the best $G$-gate approximation error $d_G(\hat{\rho})$ and the approximate circuit complexity $C_\eta(\hat{\rho})$. We prove an agnostic quantum Occam theorem: with $M$ copies, one can learn up to the best $G$-gate approximation error plus a statistical penalty $\widetilde{O}(\sqrt{G/M})$. We then remove the need to know $G$ in advance through an adaptive model-selection theorem whose oracle inequality selects the circuit complexity justified by the data. Matching lower bounds yield a sample-supported expressibility law: at trace-distance accuracy $\epsilon$, $M$ samples can support only $G_{\rm supported} \simeq M\epsilon^2$ gates, up to logarithmic factors and tomography saturation at $2^n$. Thus, the circuit complexity becomes an adaptive statistical resource rather than a static promise. Our framework turns bounded circuit complexity into a model-selection principle for quantum machine learning.

quant-ph↗

arXiv2026

Learning with Active Quantum Subspaces: Scalable Hybrid Advantage without Full Quantum Data-Encoding

We study whether quantum learning advantage can persist without fully embedding a large classical input into a highly superposed quantum state. To address this question, we introduce active quantum subspace data-encoding, in which only an information-bearing subset of the input is lifted to a quantum representation while the remaining variables stay classical. For this model, we define a projected hybrid readout and prove three structural results. First, the projected hybrid kernel is positive semidefinite and its sample regularized dimension is bounded by the number of projected observables, so the dimension blow-up of naive global kernels is avoided. Second, we give a necessary and sufficient criterion for improvement over a purely classical predictor in squared loss: the projected quantum sector must contain a direction that lies outside the classical feature span and correlates with the classical residual. Third, in a realizable noisy-oracle setting, we derive a PAC sample-complexity bound proportional to the inverse square of the oracle reliability. We then show, for a canonical Clifford active-subspace family under local dephasing noise, that this reliability can remain inverse-polynomial even when the encoding gate complexity grows polynomially with system size. Hence, the polynomial encoding cost does not by itself destroy the hybrid learning advantage. A sixty-four-qubit family and a synthetic contextual classification task illustrate how one projected quantum feature can compress a useful high-order interaction into a low-dimensional hybrid model. Our results generalize QRAM-free hybrid learning and provide a scalable route toward NISQ-compatible quantum advantage without full quantum data-encoding.

quant-ph↗

arXiv2026

Universality cost of non-Gaussian enhancement in continuous-variable quantum teleportation: A fidelity--deviation trade-off

Continuous-variable (CV) quantum teleportation is usually benchmarked by average fidelity, but when the teleportation is repeatedly used within optical networks or measurement-based architectures, uniformity across the input ensemble becomes equally important. We analyze this issue using two complementary figures of merit: the average fidelity and the fidelity deviation, which quantifies the input dependence of the single-shot teleportation fidelity. We prove that any deterministic unity-gain teleportation channel that is displacement covariant has vanishing fidelity deviation for coherent-state benchmarking, irrespective of whether the shared entangled resource is Gaussian or non-Gaussian. Nonzero deviation therefore diagnoses covariance breaking rather than non-Gaussianity. We then show that when a protocol raises the average fidelity through input-selective conditioning, the deviation generically increases in tandem, giving a quantitative universality cost. As a concrete example, we study teleportation enhanced by the so-called measurement-based noiseless linear amplification, where a heralded filter acts on the Bell-measurement record. The resulting trade-off among average fidelity, fidelity deviation, and success probability shows that stronger filtering can improve the conditional fidelity only by concentrating the successful events in favored regions of phase space, thereby suppressing the success probability and reducing input uniformity. Our results provide an operational framework for distinguishing genuine channel improvement from selectivity-driven post-selected advantage and suggest that the probabilistic CV teleportation should be assessed with average quality, universality, and heralding rate treated on an equal footing.

quant-ph↗

arXiv2026

Sharpening Worst-Case Error Assessment for Fault-Tolerant Quantum Computing: Fidelity and Its Deviation

Gate fidelity -- an average fidelity over all possible input states -- is the workhorse metric for benchmarking quantum gates or circuits, yet fault-tolerant quantum computing ultimately depends on the worst-case behavior, typically quantifiable by so-called the diamond distance. In the low-error regime, the coherent errors can inflate the worst-case error even when the reported gate fidelity is high, making the gate fidelity alone an unreliable proxy for fault-tolerance readiness. To capture the missing information, we introduce a companion observable -- what we dub the fidelity deviation -- that quantifies how strongly the state-dependent fidelities fluctuate across input states. Adopting such fluctuations in assessing the fault-tolerance is physically natural because some input directions are nearly unaffected while others form narrow "valleys" that dominate adversarial circuit behavior. For coherent (unitary) gate errors on two or more qubits, we show that the gate fidelity together with the fidelity deviation constrains the relevant spectral moments of the error unitary, enabling an explicit and tight certificate of the worst-case error. Both quantities are estimated directly from the same randomized input-measurement experiment, without full process tomography. We show that the fidelity and its deviation can provide an economical, operationally meaningful, and accurate standard for assessing the fault tolerance of the engineered quantum gates and circuits.

quant-ph↗

arXiv2026

Physics-Aware Learnability: From Set-Theoretic Independence to Operational Constraints

Beyond binary classification, learnability can become a logically fragile notion: in EMX, even the class of all finite subsets of $[0,1]$ is learnable in some models of ZFC and not in others. We argue the paradox is operational. The standard definitions quantify over arbitrary set-theoretic learners that implicitly assume non-operational resources (infinite precision, unphysical data access, and non-representable outputs). We introduce physics-aware learnability (PL), which defines the learnability relative to an explicit access model -- a family of admissible physical protocols. Finite-precision coarse-graining reduces continuum EMX to a countable problem, via an exact pushforward/pullback reduction that preserves the EMX objective, making the independence example provably learnable with explicit $(\epsilon,\delta)$ sample complexity. For quantum data, admissible learners are exactly POVMs on $d$ copies, turning sample size into copy complexity and yielding Helstrom(-type) lower bounds. For finite no-signaling and quantum models, PL feasibility becomes linear or semidefinite and is therefore decidable.

cs.LG↗

arXiv2026

Quantum Interference Needs Convention: Overlap-Determinability and Unified No-Superposition Principle

Quantum superposition is often phrased as the ability to add state vectors. In practice, however, the physical quantity is a ray (a rank-one projector), so each input specifies only a projector and leaves a gauge freedom in the phases of its vector representatives. This becomes a real operational barrier when one asks for a device that, given two independently prepared unknown pure states, outputs a coherent state proportional to a prescribed linear combination. We identify the missing ingredient as not probabilistic but phase-like. One needs a physical scenario that fixes a single phase convention on the relevant set of rays, so that the overlaps become well defined complex numbers. Thus, we formalize this through phase conventions and a single notion -- dubbed as "overlap-determinability." Our main theorem gives an exact equivalence: A nonzero completely positive trace-nonincreasing map that probabilistically produces superposition on a domain exists if and only if that domain is overlap-determinable. This unifies modern no-superposition results and characterizes the exceptional yes-go protocols, which succeed precisely when side information supplies the required missing resource. We then show that granting universal access to such convention-fixed overlaps destabilizes the familiar foundational and computational constraints. It enables forbidden transformations akin to quantum cloning and yields super-luminal signaling. It would also permit reflections about unknown states, leading to exponentially fast overlap amplification and a collapse of Grover's search lower bound to a logarithmic query complexity.

quant-ph↗

arXiv2026

Learning at the Edge of Causality: Optimal Learning-Sample Complexity from No-Signaling Constraints

What ultimately fixes the sample cost of quantum learning -- algorithmic ingenuity or physical law? We study this question in an arena where computation, learning, and causality collide. A twist on Grover's search that reflects about an a priori unknown state can collapse the query complexity from $O(\sqrt{N})$ to $O(\log N)$ over a search space $N$, i.e., an exponential speedup. Yet, standard quantum theory forbids such a unknown-state reflection (no-reflection theorem). We therefore build a state-learning-assisted architecture, called ``amplify-learn,'' which alternates the coherent amplitude amplification with state learning. Embedding this amplify-learn into the Bao-Bouland-Jordan no-signaling framework, we show that the logarithmic-round dream would open a super-luminal communication channel unless each round expends the learning-sample and reflection-circuit budgets scaling at least as $\Omega(\sqrt{N}/\log N)$. In parallel, we derive tight computational learning-theoretic sample bounds for learning circuit-generated pure states, revealing a state-universal ansatz ``lock'' at order $N$ in the worst case. The dramatic closure is that no-signaling does not merely veto the unphysical primitive, but it fixes the only consistent reflection-circuit complexity, and feeding this causality-enforced complexity into the computational learning bound makes it collapse onto the very same $\sqrt{N}/\log N$ scaling demanded by no-signaling alone. No-signaling thus acts as a regulator of learnability: a constraint that mediates between physics and computation, welding query, gate, and sample complexities into a single causality-compatible triangle.

quant-ph↗

arXiv2025

Witness wedges in fidelity-deviation plane: separating teleportation advantage and Bell-inequality violation

We develop a unified framework to analyze $d$-dimensional quantum teleportation through the joint geometry of two complementary figures of merit: average fidelity $F$ (how well a protocol works on average) and fidelity deviation $D$ (how uniformly it works across the inputs). Technically, we formulate a representation-theoretical framework based on Schur-Weyl duality and permutation symmetry calculus that reduce the higher-moment Haar averages to a finite set of trace invariants of the composed correction unitaries. This yields closed-form expressions for $F$ and $D$ in arbitrary Hilbert-space dimension and delivers tight bounds that link the admissible deviation directly to the gap from the optimal average performance. In particular, any measured pair $(F, D)$ can be ported into a visibility estimate for isotropic channel resources, turning the $(F, D)$-plane into a calibrated diagnostic map. We further cast the teleportation advantage and CGLMP-inequality violation as two witnesses lines in the $(F,D)$ plane: one line certifies that $F$ beats the classical benchmark $2/(d{+}1)$, while the other line certifies the Bell nonlocality. Their identical slope but distinct intercepts expose a quantitative gap between "entangled yet local" and "genuinely nonlocal" resources.

quant-ph↗

arXiv2025

Fundamental limits to contrast reversal of survival probability correlations

In measurement design, it is common to engineer anti-contrast readouts -- two measurements that respond as differently as possible to the same inputs so that contributions that affect both readouts in the same way are suppressed. To assess the fundamental scope of this strategy in unitary dynamics, we ask whether two evolutions can be made uniformly opposite over a broad input ensemble, or whether quantum mechanics imposes a structural limit on such opposition. We address this by treating survival probability as a random variable on projective state space and adopting the Pearson correlation coefficient as a device-agnostic measure of global opposition between two evolutions. Within this framework we establish the following theorem: For any nontrivial pair of unitaries, survival probability maps cannot be point-wise complementary correlation on the entire state space. Consequently, the mathematical lower edge of the correlation bound is not physically attainable, which we interpret as a unitary-geometric floor on anti-contrast, independent of hardware specifics and noise models. We make this floor explicit in realizable settings. In a single-qubit Bloch-sphere Ramsey model, a closed-form relation shows that a residual shared (channel-symmetric) component persists even under nominally optimal tuning. In higher dimensions, Haar/design moment identities reduce ensemble means and covariances of survival probability to a small set of unitary invariants, yielding the same conclusion irrespective of implementation details. Taken together, these results provide a model-independent criterion for what anti-contrast can and cannot achieve in unitary sensing protocols.

quant-ph↗

arXiv2025

Entangling Power and Its Deviation: A Quantitative Analysis on Input-State Dependence and Variability in Entanglement Generation

Quantifying the entangling capability of quantum operations is a fundamental task in quantum information science. Traditionally, this capability is measured by the entangling power (EP), defined as the average entanglement generated when a quantum operation acts uniformly on all possible product states. However, EP alone cannot capture the intricate input-state-dependent nature of entanglement generation. To address this, we define a complementary metric -- entangling power deviation (EPD) -- as the standard deviation of entanglement generated over all product input states, thereby capturing the multifaceted nature of entangling behavior. We develop a general group-theoretical framework that yields closed-form expressions for both EP and EPD. Our analysis shows that any nontrivial entangling operation necessarily exhibits input-state dependence: nonzero EP implies a nonzero EPD. By analyzing representative two-qubit gates, we show that the gates with identical EP can exhibit markedly different EPD values, illustrating that the nature of entanglement generation can significantly differ depending on the gate functionality. Extending our framework to a class of generalized controlled-unitary operations acting on bipartite Hilbert spaces of arbitrary dimensions, we further analyze the interplay between the entangling strength and uniformity, as quantified by EP and EPD. Moreover, we uncover a subtle dimension-parity-dependent behavior in entanglement generation, which EP alone fails to detect. These findings highlight EPD as an indispensable diagnostic tool -- one that, alongside EP, provides a deeper and more complete characterization of the entangling structure.

quant-ph↗

arXiv2024

Perturbations of General Relativity to All Orders and the General $n^{\rm th}$ Order Terms

We derive all-order expressions for perturbations of the Einstein-Hilbert action and the Einstein equation with the general $n$-th order terms. To this end, we employ Cheung and Remmen's perturbation conventions both in tensor density and the usual metric tensor formalisms, including the Einstein-dilaton theory. Remarkably, we find minimal building blocks that generate the entire perturbations for each of our formulations. We show that the number of terms of perturbations grows linearly as the order of perturbations increases. We regard our results as the reference and discuss how to derive perturbations in other conventions from the reference. As a consistency check, we compute graviton scattering amplitudes using the perturbiner method based on the perturbative Einstein equation. Finally we discuss how to generalise the results to curved backgrounds and incorporate additional matter.

hep-th↗

arXiv2023

Binary Black Holes and Quantum Off-Shell Recursion

The quantum off-shell recursion provides an efficient and universal computational tool for loop-level scattering amplitudes. In this work, we present a new comprehensive computational framework based on the quantum off-shell recursion for binary black hole systems. Using the quantum perturbiner method, we derive the recursions and solve them explicitly up to two-loop order. We develop a power-counting prescription that enables the straightforward separation of classical diagrams. We also devise a classification scheme that optimizes the integration by parts (IBP) reduction process, which makes higher-loop calculations more tractable. By employing the soft expansion technique, we remove irrelevant terms from the loop integrands and express them in terms of master integrals. We classify the one-loop and the two-loop classical diagrams, and their loop integrands are represented by linear combinations of the master integrals. Finally, we explicitly calculate the classical scalar 2 to 2 amplitudes in the potential region up to the 3PM order and reproduce the known results.

hep-th↗

arXiv2022

The Off-Shell Recursion for Gravity and the Classical Double Copy for currents

We construct the off-shell recursion for gravity and the graviton current for the perturbative double field theory (DFT). We first formulate the perturbative DFT, which is equivalent but simpler to perturbative general relativity, to all-orders in fluctuations of generalised metric. The perturbative action and equations of motion (EoM) are derived to arbitrary order for pure gravity case. We then derive the graviton off-shell recursion, the gravity counterpart of the Berends-Giele recursion in Yang-Mills theory, through the so-called perturbiner method using the EoM of the perturbative DFT. We solve the recursion iteratively and obtain the graviton off-shell currents explicitly. We then discuss the classical double copy for the off-shell currents. We present the current KLT relation for gravity by extending the result proposed by Mizera and Skrzypek for the non-gravitational effective field theories. The relation represents graviton currents by squaring gluon currents with the KLT kernel up to gauge transformation and regular terms that do not have any pole. Finally we discuss the off-shell conservation of currents for nonlinear gauge choices.

hep-th↗

arXiv2021

The Classical Double Copy for Half-Maximal Supergravities and T-duality

We study the classical double copy for ungauged half-maximal supergravities using the Kaluza-Klein reduction of double field theory (DFT). We construct a general formula for the Kaluza-Klein (KK) reduction of the DFT Kerr-Schild ansatz. The KK reduction of the ansatz is highly nonlinear, but the associated equations of motion are linear. This linear structure implies that half-maximal supergravities admit a classical double copy. We show that their single copy is given by a pair of Maxwell-scalar theories, which are the KK reduction of a higher-dimensional single copy of DFT. We also investigate their T-duality transformations - both the Buscher rule and continuous O(D,D) rotations. Applying the Buscher rule to the Kerr BH, we obtain a solution with a nontrivial Kalb-Ramond field and dilaton. We also identify the single copy of Sen's heterotic BH and the chiral null model and show that the chiral null model is self-dual under T-duality rotations.

hep-th↗