arXiv subjects

Sangchul Oh

Publications and source records attributed to Sangchul Oh.

At least 19 recordsLinked to original sources

arXiv2026

Frozen-Tree Sampling Refutes Quantum Advantage of Random Circuit Sampling

Random circuit sampling of bitstrings from a Haar-random quantum state is widely believed to be classically intractable, and has therefore been implemented as a primary benchmark for demonstrating quantum advantage. Here, we challenge this premise by proposing an efficient classical frozen-tree sampling algorithm that exploits the conditional scale invariance of Haar-random quantum states [Oh, arXiv:2602.19448]. The frozen-tree sampler draws bitstrings of $n$ qubits in $O(n)$ time per sample. Moreover, its output probability $p_F(x)$ is statistically identical to the probability $p_C(x)$ of a random quantum circuit, since both are independent instances of the same Dirichlet distribution. Consequently, no statistical test acting on samples alone can distinguish the classical frozen-tree sampler from a quantum random circuit. The claimed quantum advantage of random circuit sampling therefore does not withstand scrutiny: its hardness lies not in sampling from the Dirichlet distribution, which is classically efficient, but in identifying a specific circuit realization.

quant-ph↗

arXiv2026

Subsystem Statistics and Conditional Self-Similarity of Random Quantum States

We analytically derive the bit-string probability distributions of subsystems of random pure states and depolarized random states using the Dirichlet distribution. We identify the exact Beta distribution as the universal statistical law of random quantum states, providing a unified finite-size description of full-system, subsystem, and conditional statistics. In the presence of depolarizing noise, these distributions are scaled and shifted by the noise strength, producing a noise-induced gap in their support. Remarkably, we prove that random states exhibit exact conditional self-similarity: the distribution of subsystem bit-string probabilities conditioned on specific outcomes of the complementary subsystem is identical to that of the full system. This hidden scale invariance enables the exact restoration of the full-system statistics from the marginalized Beta distribution via post-selection, and persists under depolarizing noise. Our results uncover a fundamental symmetry of Hilbert space and provide a scalable, rigorous framework for validating random circuit sampling via subsystem or conditional cross-entropy benchmarking.

quant-ph↗

arXiv2024

Random Projection using Random Quantum Circuits

The random sampling task performed by Google's Sycamore processor gave us a glimpse of the "Quantum Supremacy era". This has definitely shed some spotlight on the power of random quantum circuits in this abstract task of sampling outputs from the (pseudo-) random circuits. In this manuscript, we explore a practical near-term use of local random quantum circuits in dimensional reduction of large low-rank data sets. We make use of the well-studied dimensionality reduction technique called the random projection method. This method has been extensively used in various applications such as image processing, logistic regression, entropy computation of low-rank matrices, etc. We prove that the matrix representations of local random quantum circuits with sufficiently shorter depths ($\sim O(n)$) serve as good candidates for random projection. We demonstrate numerically that their projection abilities are not far off from the computationally expensive classical principal components analysis on MNIST and CIFAR-100 image data sets. We also benchmark the performance of quantum random projection against the commonly used classical random projection in the tasks of dimensionality reduction of image datasets and computing Von Neumann entropies of large low-rank density matrices. And finally using variational quantum singular value decomposition, we demonstrate a near-term implementation of extracting the singular vectors with dominant singular values after quantum random projecting a large low-rank matrix to lower dimensions. All such numerical experiments unequivocally demonstrate the ability of local random circuits to randomize a large Hilbert space at sufficiently shorter depths with robust retention of properties of large datasets in reduced dimensions.

quant-ph↗

arXiv2023

Cutoff phenomenon and entropic uncertainty for random quantum circuits

How fast a state of a system converges to a stationary state is one of the fundamental questions in science. Some Markov chains and random walks on finite groups are known to exhibit the non-asymptotic convergence to a stationary distribution, called the cutoff phenomenon. Here, we examine how quickly a random quantum circuit could transform a quantum state to a Haar-measure random quantum state. We find that random quantum states, as stationary states of random walks on a unitary group, are invariant under the quantum Fourier transform. Thus the entropic uncertainty of random quantum states has balanced Shannon entropies for the computational bases and the quantum Fourier transform bases. By calculating the Shannon entropy for random quantum states and the Wasserstein distances for the eigenvalues of random quantum circuits, we show that the cutoff phenomenon occurs for the random quantum circuit. It is also demonstrated that the Dyson-Brownian motion for the eigenvalues of a random unitary matrix as a continuous random walk exhibits the cutoff phenomenon. The results here imply that random quantum states could be generated with shallow random circuits.

quant-ph↗

arXiv2022

Race for Quantum Advantage using Random Circuit Sampling

Random circuit sampling, the task to sample bit strings from a random unitary operator, has been performed to demonstrate quantum advantage on the Sycamore quantum processor with 53 qubits and on the Zuchongzhi quantum processor with 56 and 61 qubits. Recently, it has been claimed that classical computers using tensor network simulation could catch on current noisy quantum processors for random circuit sampling. While the linear cross entropy benchmark fidelity is used to certify all these claims, it may not capture in detail statistical properties of outputs. Here, we compare the bit strings sampled from classical computers using tensor network simulation by Pan et al. [Phys. Rev. Lett. 129, 090502 (2022)] and by Kalachev et al. [arXiv:2112.15083 (2021)] and from the Sycamore and Zuchongzhi quantum processors. It is shown that all Kalachev et al.'s samples pass the NIST random number tests. The heat maps of bit strings show that Pan et al.'s and Kalachev et al.'s samples are quite different from the Sycamore or Zuzhongzhi samples. The analysis with the Marchenko-Pastur distribution and the Wasssertein distances demonstrates that Kalachev et al.'s samples are statistically close to the Sycamore samples than Pan et al.'s while the three datasets have similar values of the linear cross entropy fidelity. Our finding implies that further study is needed to certify or beat the claims of quantum advantage for random circuit sampling.

quant-ph↗

arXiv2022

Statistical Analysis on Random Quantum Sampling by Sycamore and Zuchongzhi Quantum Processors

Random quantum sampling, a task to sample bit-strings from a random quantum circuit, is considered one of suitable benchmark tasks to demonstrate the outperformance of quantum computers even with noisy qubits. Recently, random quantum sampling was performed on the Sycamore quantum processor with 53 qubits [Nature 574, 505 (2019)] and on the Zuchongzhi quantum processor with 56 qubits [Phys. Rev. Lett. 127, 180501 (2021)]. Here, we analyze and compare statistical properties of the outputs of random quantum sampling by Sycamore and Zuchongzhi. Using the Marchenko-Pastur law and the Wasssertein distances, we find that quantum random sampling of Zuchongzhi is more closer to classical uniform random sampling than those of Sycamore. Some Zuchongzhi's bit-strings pass the random number tests while both Sycamore and Zuchongzhi show similar patterns in heatmaps of bit-strings. It is shown that statistical properties of both random quantum samples change little as the depth of random quantum circuits increases. Our findings raise a question about computational reliability of noisy quantum processors that could produce statistically different outputs for the same random quantum sampling task.

quant-ph↗

arXiv2021

Non-Randomness of Google's Quantum Supremacy Benchmark

The first achievement of quantum supremacy has been claimed recently by Google for the random quantum circuit benchmark with 53 superconducting qubits. Here, we analyze the randomness of Google's quantum random-bit sampling. The heat maps of Google's random bit-strings show stripe patterns at specific qubits in contrast to the Haar-measure or classical random-bit strings. Google's data contains more bit 0 than bit 1, i.e., about 2.8\% difference, and fail to pass the NIST random number tests, while the Haar-measure or classical random-bit samples pass. Their difference is also illustrated by the Marchenko-Pastur distribution and the Girko circular law of random matrices of random bit-strings. The calculation of the Wasserstein distances shows that Google's random bit-strings are farther away from the Haar-measure random bit-strings than the classical random bit-strings. Our results imply that random matrices and the Wasserstein distance could be new tools for analyzing the performance of quantum computers.

quant-ph↗

arXiv2021

Implementation of Quantum Machine Learning for Electronic Structure Calculations of Periodic Systems on Quantum Computing Devices

Quantum machine learning algorithms, the extensions of machine learning to quantum regimes, are believed to be more powerful as they leverage the power of quantum properties. Quantum machine learning methods have been employed to solve quantum many-body systems and have demonstrated accurate electronic structure calculations of lattice models, molecular systems, and recently periodic systems. A hybrid approach using restricted Boltzmann machines and a quantum algorithm to obtain the probability distribution that can be optimized classically is a promising method due to its efficiency and ease of implementation. Here we implement the benchmark test of the hybrid quantum machine learning on the IBM-Q quantum computer to calculate the electronic structure of typical 2-dimensional crystal structures: hexagonal-Boron Nitride and graphene. The band structures of these systems calculated using the hybrid quantum machine learning are in good agreement with those obtained by the conventional electronic structure calculation. This benchmark result implies that the hybrid quantum machine learning, empowered by quantum computers, could provide a new way of calculating the electronic structures of quantum many-body systems.

physics.comp-ph↗

arXiv2020

Quantum Photovoltaic Cells Driven by Photon Pulses

We investigate the quantum thermodynamics of two quantum systems, a two-level system and a four-level quantum photocell, each driven by photon pulses as a quantum heat engine. We set these systems to be in thermal contact only with a cold reservoir while the heat (energy) source, conventionally given from a hot thermal reservoir, is supplied by a sequence of photon pulses. The dynamics of each system is governed by a coherent interaction due to photon pulses in terms of the Jaynes-Cummings Hamiltonian together with the system-bath interaction described by the Lindblad master equation. We calculate the thermodynamic quantities for the two-level system and the quantum photocell including the change in system energy, power delivered by photon pulses, power output to an external load, heat dissipated to a cold bath, and entropy production. We thereby demonstrate how a quantum photocell in the cold bath can operate as a continuum quantum heat engine with the sequence of photon pulses continuously applied. We specifically introduce the power efficiency of the quantum photocell in terms of the ratio of output power delivered to an external load with current and voltage to the input power delivered by the photon pulse. Our study indicates a possibility that a quantum system driven by external fields can act as an efficient quantum heat engine under non-equilibrium thermodynamics.

quant-ph↗

arXiv2020

Entropy, Free Energy, and Work of Restricted Boltzmann Machines

A restricted Boltzmann machine is a generative probabilistic graphic network. A probability of finding the network in a certain configuration is given by the Boltzmann distribution. Given training data, its learning is done by optimizing parameters of the energy function of the network. In this paper, we analyze the training process of the restricted Boltzmann machine in the context of statistical physics. As an illustration, for small size Bar-and-Stripe patterns, we calculate thermodynamic quantities such as entropy, free energy, and internal energy as a function of training epoch. We demonstrate the growth of the correlation between the visible and hidden layers via the subadditivity of entropies as the training proceeds. Using the Monte-Carlo simulation of trajectories of the visible and hidden vectors in configuration space, we also calculate the distribution of the work done on the restricted Boltzmann machine by switching the parameters of the energy function. We discuss the Jarzynski equality which connects the path average of the exponential function of the work and the difference in free energies before and after training.

cond-mat.dis-nn↗

arXiv2017

How Much is the Efficiency of Solar Cells Enhanced by Quantum Coherence?

We study how much the efficiency of a solar cell as a quantum heat engine could be enhanced by quantum coherence. In contrast to the conventional approach that a quantum heat engine is in thermal equilibrium with both hot and cold reservoirs, we propose a new description that the quantum heat engine is in the cold reservoir and the thermal radiation from the hot reservoir is described by the pumping term in the master equation. This pumping term solves the problem of the incorrect mean photon number of the hot reservoir assumed by the previous studies. By solving the master equation, we obtain the current-voltage and the power-voltage curves of the photocell for different pumping rates. We find that, as the photon flux increases, the power output of the photocell increases linearly at first and then becomes saturated, but the efficiency decreases rapidly. It is demonstrated that while the power output is enhanced significantly by the quantum coherence via the dark state of the coupled donors, the improvement of the efficiency is not significant.

quant-ph↗

arXiv2016

Cooperative Interference Mitigation Algorithm in Heterogeneous Networks

Heterogeneous hetworks (HetNets) have been introduced as an emerging technology in order to meet the increasing demand for mobile data. HetNets are a combination of multi-layer networks such as macrocells and small cells. In such networks, users may suffer significant cross-layer interference. To manage this interference, the 3rd Generation Partnership Project (3GPP) has introduced enhanced Inter-Cell Interference Coordination (eICIC) techniques. Almost Blank SubFrame (ABSF) is one of the time-domain techniques used in eICIC solutions. We propose a dynamically optimal Signal-to-Interference-and-Noise Ratio (SINR)-based ABSF framework to ensure macro user performance while maintaining small user performance. We also study cooperative mechanisms to help small cells collaborate efficiently in order to reduce mutual interference. Simulations show that our proposed scheme achieves good performance and outperforms the existing ABSF frameworks.

cs.NI↗

arXiv2015

Singularity of the time-energy uncertainty in adiabatic perturbation and cycloids on a Bloch sphere

The adiabatic perturbation is shown to be singular from the exact solution of a spin-1/2 particle in a uniformly rotating magnetic field. Due to a non-adiabatic effect, its quantum trajectory on a Bloch sphere is a cycloid traced by a circle rolling along an adiabatic path. As the magnetic field rotates more and more slowly, the time-energy uncertainty, proportional to the distance of the quantum trajectory, calculated by the exact solution is entirely different from the one obtained by the adiabatic path traced by the instantaneous state. However, the non-adiabatic Aharonov-Anandan geometric phase, measured by the area enclosed by the exact path, approaches smoothly the adiabatic Berry phase, proportional to the area enclosed by the adiabatic path. The singular limit of the time-energy uncertainty and the regular limit of the geometric phase are associated with the arc length and arc area of the cycloid on a Bloch sphere, respectively. Prolate and curtate cycloids are also traced by different initial states outside and inside of the rolling circle, respectively. The axis trajectory of the rolling circle, parallel to the adiabatic path, is shown to be an example of transitionless driving. The non-adiabatic resonance is visualized by the number of complete cycloid arcs.

quant-ph↗

arXiv2014

Delocalized Quantum States Enhance Photocell Efficiency

The high quantum efficiency of photosynthetic complexes has inspired researchers to explore new routes to utilize this process for photovoltaic devices. Quantum coherence has been demonstrated to play a crucial role within this process. Herein, we propose a three-dipole system as a model of a new photocell type which exploits the coherence among its three dipoles. We have proved that the efficiency of such a photocell is greatly enhanced by quantum coherence. We have also predicted that the photocurrents can be enhanced by about 49.5 % in such a coherent coupled dipole system compared with the uncoupled dipoles. These results suggest a promising novel design aspect of photosynthesis-mimicking photovoltaic devices.

physics.chem-ph↗

arXiv2014

Non-Adiabatic Quantum Dynamics of Grover's Adiabatic Search Algorithm

We study quantum dynamics of Grover's adiabatic search algorithm with the equivalent two-level system. Its adiabatic and non-adiabatic evolutions are visualized as trajectories of Bloch vectors on a Bloch sphere. We find the change in the non-adiabatic transition probability from exponential decay for short running time to inverse-square decay for long running time. The size dependence of the critical running time is expressed in terms of Lambert $W$ function. The transitionless driving Hamiltonian is obtained to make a quantum state follow the adiabatic path. We demonstrate that a constant Hamiltonian, approximate to the exact time-dependent driving Hamiltonian, can alter the non-adiabatic transition probability from the inverse square decay to the inverse fourth power decay with running time. This may open up a new way of reducing errors in adiabatic quantum computation.

quant-ph↗

arXiv2013

Single-qubit gates in two steps with rotation axes in a single plane

Any single-qubit unitary operation or quantum gate can be considered a rotation. Typical experimental implementations of single-qubit gates involve two or three fixed rotation axes, and up to three rotation steps. Here we show that, if the rotation axes can be tuned arbitrarily in a fixed plane, then two rotation steps are sufficient for implementing a single-qubit gate, and one rotation step is sufficient for implementing a state transformation. The results are relevant for "exchange-only" logical qubits encoded in three-spin blocks, which are important for universal quantum computation in decoherence free subsystems and subspaces.

cond-mat.mes-hall↗

arXiv2013

Probing Quantum Phase Transitions on a Spin Chain with a Double Quantum Dot

Quantum phase transitions (QPTs) in qubit systems are known to produce singularities in the entanglement, which could in turn be used to probe the QPT. Current proposals to measure the entanglement are challenging however, because of their nonlocal nature. Here we show that a double quantum dot coupled locally to a spin chain provides an alternative and efficient probe of QPTs. We propose an experiment to observe a QPT in a triple dot, based on the well-known singlet projection technique.

cond-mat.mes-hall↗

arXiv2013

Mediated gates between spin qubits

In a typical quantum circuit, nonlocal quantum gates are applied to nonproximal qubits. If the underlying physical interactions are short-range (e.g., exchange interactions between spins), intermediate swap operations must be introduced, thus increasing the circuit depth. Here we develop a class of "mediated" gates for spin qubits, which act on nonproximal spins via intermediate ancilla qubits. At the end of the operation, the ancillae return to their initial states. We show how these mediated gates can be used (1) to generate arbitrary quantum states and (2) to construct arbitrary quantum gates. We provide some explicit examples of circuits that generate common states [e.g., Bell, Greenberger-Horne-Zeilinger (GHZ), W, and cluster states] and gates (e.g.,square-root-SWAP, SWAP, CNOT, and Toffoli gates). We show that the depths of these circuits are often shorter than those of conventional swap-based circuits. We also provide an explicit experimental proposal for implementing a mediated gate in a triple-quantum-dot system.

quant-ph↗