Searcharxiv⌕ Search

arXiv subjects

Hyukjoon Kwon

Publications and source records attributed to Hyukjoon Kwon.

At least 55 records · Page 3Linked to original sources

Fast pseudothermalization

Quantum resources like entanglement and magic are essential for characterizing the complexity of quantum states. However, when the number of copies of quantum states and the computational time are limited by numbers polynomial in the system size $n$, accurate estimation of the amount of these resources becomes difficult. This makes it impossible to distinguish between ensembles of states with relatively small resources and one that has nearly maximal resources. Such ensembles with small resources are referred to as "pseudo-quantum" ensembles. Recent studies have introduced an ensemble known as the random subset phase state ensemble, which is pseudo-entangled, pseudo-magical, and pseudorandom. While the current state-of-the-art implementation of this ensemble is conjectured to be realized by a circuit with $O(nt)$ depth, it is still too deep for near-term quantum devices to execute for small $t$. In addition, the strict linear dependence on $t$ has only been established as a lower bound on the circuit depth. In this work, we present significantly improved implementations that only require $ω(\log n)\cdot O(t[\log t]^2)$ depth circuits, which almost saturates the theoretical lower bound. This is also the fastest known for generating pseudorandom states to the best of our knowledge. We believe that our findings will facilitate the implementation of pseudo-ensembles on near-term devices, allowing executions of tasks that would otherwise require ensembles with maximal quantum resources, by generating pseudo-ensembles at a super-polynomially fewer number of entangling and non-Clifford gates.

quant-ph↗

Snapshotting Quantum Dynamics at Multiple Time Points

Measurement-induced state disturbance is a major challenge in obtaining quantum statistics at multiple time points. We propose a method to extract dynamic information from a quantum system at intermediate time points, namely snapshotting quantum dynamics. To this end, we apply classical post-processing after performing the ancilla-assisted measurements to cancel out the impact of the measurements at each time point. Based on this, we reconstruct a multi-time quasi-probability distribution (QPD) that correctly recovers the probability distributions at the respective time points. Our approach can also be applied to simultaneously extract exponentially many correlation functions with various time-orderings. We provide a proof-of-principle experimental demonstration of the proposed protocol using a dual-species trapped-ion system by employing $^{171}\rm{Yb}^+$ and $^{138}\rm{Ba}^+$ ions as the system and the ancilla, respectively. Multi-time measurements are performed by repeated initialization and detection of the ancilla state without directly measuring the system state. The two- and three-time QPDs and correlation functions are reconstructed reliably from the experiment, negativity and complex values in the QPDs clearly indicate a contribution of the quantum coherence throughout dynamics.

quant-ph↗

Nondestructive discrimination of Bell states between distant parties

Identifying Bell states without destroying it is frequently dealt with in nowadays quantum technologies such as quantum communication and quantum computing. In practice, quantum entangled states are often distributed among distant parties, and it might be required to determine them separately at each location, without inline communication between parties. We present a scheme for discriminating an arbitrary Bell state distributed to two distant parties without destroying it. The scheme requires two entangled states that are pre-shared between the parties, and we show that without these ancillary resources, the probability of non-destructively discriminating the Bell state is bounded by 1/4, which is the same as random guessing. Furthermore, we demonstrate a proof-of-principle experiment through an IonQ quantum computer that our scheme can surpass classical bounds when applied to practical quantum processor.

quant-ph↗

Quantum error cancellation in photonic systems -- undoing photon losses

Real photonic devices are subject to photon losses that can decohere quantum information encoded in the system. In the absence of full fault tolerance, quantum error mitigation techniques have been introduced to help manage errors in noisy quantum devices. In this work, we introduce an error mitigation protocol inspired by probabilistic error cancellation (a popular error mitigation technique in discrete variable systems) for continuous variable systems. We show that our quantum error cancellation protocol can undo photon losses in expectation value estimation tasks. To do this, we analytically derive the (non-physical) inverse photon loss channel and decompose it into a sum over physically realisable channels with potentially negative coefficients. The bias of our ideal expectation value estimator can be made arbitrarily small at the cost of increasing the sampling overhead. The protocol requires a noiseless amplification followed by a series of photon-subtractions. While these operations can be implemented probabilistically, for certain classes of initial state one can avoid the burden of carrying out the amplification and photon-subtractions by leveraging Monte-Carlo methods to give an unbiased estimate of the ideal expectation value. We validate our proposed mitigation protocol by simulating the scheme on squeezed vacuum states, cat states and entangled coherent states.

quant-ph↗

Enhancing Quantum State Discrimination with Indefinite Causal Order

The standard quantum state discrimination problem can be understood as a communication scenario involving a sender and a receiver following these three steps: (i) the sender encodes information in pre-agreed quantum states, (ii) sends them over a noiseless channel, and (iii) the receiver decodes the information by performing appropriate measurements on the received states. In a practical setting, however, the channel is not only noisy but often also unknown, thus altering the states and making optimal decoding generally not possible. In this work, we study this noisy discrimination scenario using a protocol based on indefinite causal order. To this end, we consider the quantum switch and define its higher-order generalisations, which we call superswitches. We find that, for certain channels and ensembles, the guessing probability can be significantly improved compared to both single- and multi-copy state discrimination.

quant-ph↗

Universal Auto-encoder Framework for MIMO CSI Feedback

Existing auto-encoder (AE)-based channel state information (CSI) frameworks have focused on a specific configuration of user equipment (UE) and base station (BS), and thus the input and output sizes of the AE are fixed. However, in the real-world scenario, the input and output sizes may vary depending on the number of antennas of the BS and UE and the allocated resource block in the frequency dimension. A naive approach to support the different input and output sizes is to use multiple AE models, which is impractical for the UE due to the limited HW resources. In this paper, we propose a universal AE framework that can support different input sizes and multiple compression ratios. The proposed AE framework significantly reduces the HW complexity while providing comparable performance in terms of compression ratio-distortion trade-off compared to the naive and state-of-the-art approaches.

cs.IT↗

Gaussian boson sampling with click-counting detectors

Gaussian boson sampling constitutes a prime candidate for an experimental demonstration of quantum advantage within reach with current technological capabilities. The original proposal employs photon-number-resolving detectors, however the latter are not widely available. On the other hand, inexpensive threshold detectors can be combined into a single click-counting detector to achieve approximate photon number resolution. We investigate the problem of sampling from a general multi-mode Gaussian state using click-counting detectors and show that the probability of obtaining a given outcome is related to a new matrix function which is dubbed as the Kensingtonian. We show how the latter relates to the Torontonian and the Hafnian, thus bridging the gap between known Gaussian boson sampling variants. We then prove that, under standard complexity-theoretical conjectures, the model can not be simulated efficiently.

quant-ph↗

Gaussian boson sampling at finite temperature

Gaussian boson sampling (GBS) is a promising candidate for an experimental demonstration of quantum advantage using photons. However, sufficiently large noise might hinder a GBS implementation from entering the regime where quantum speedup is achievable. Here, we investigate how thermal noise affects the classical intractability of generic quantum optical sampling experiments, GBS being a particular instance of the latter. We do so by establishing sufficient conditions for an efficient simulation to be feasible, expressed in the form of inequalities between the relevant parameters that characterize the system and its imperfections. We demonstrate that the addition of thermal noise has the effect of tightening the constraints on the remaining noise parameters, required to show quantum advantage. Furthermore, we show that there exist a threshold temperature at which any quantum sampling experiment becomes classically simulable, and provide an intuitive physical interpretation by relating this occurrence with the disappearance of the quantum state's non-classical properties.

quant-ph↗

Estimating Entanglement Entropy via Variational Quantum Circuits with Classical Neural Networks

Entropy plays a crucial role in both physics and information science, encompassing classical and quantum domains. In this work, we present the Quantum Neural Entropy Estimator (QNEE), a novel approach that combines classical neural network (NN) with variational quantum circuits to estimate the von Neumann and Renyi entropies of a quantum state. QNEE provides accurate estimates of entropy while also yielding the eigenvalues and eigenstates of the input density matrix. Leveraging the capabilities of classical NN, QNEE can classify different phases of quantum systems that accompany the changes of entanglement entropy. Our numerical simulation demonstrates the effectiveness of QNEE by applying it to the 1D XXZ Heisenberg model. In particular, QNEE exhibits high sensitivity in estimating entanglement entropy near the phase transition point. We expect that QNEE will serve as a valuable tool for quantum entropy estimation and phase classification.

quant-ph↗

Causal Asymmetry of Classical and Quantum Autonomous Agents

Why is it that a ticking clock typically becomes less accurate when subject to outside noise but rarely the reverse? Here, we formalize this phenomenon by introducing process causal asymmetry - a fundamental difference in the amount of past information an autonomous agent must track to transform one stochastic process to another over an agent that transforms in the opposite direction. We then illustrate that this asymmetry can paradoxically be reversed when agents possess a quantum memory. Thus, the spontaneous direction in which processes get 'simpler' may be different, depending on whether quantum information processing is allowed or not.

quant-ph↗

Engineering a heat engine purely driven by quantum coherence

The question of whether quantum coherence is a resource beneficial or detrimental to the performance of quantum heat engines has been thoroughly studied but remains undecided. To isolate the contribution of coherence, we analyze the performance of a purely coherence-driven quantum heat engine, a device that does not include any heat flow during the thermodynamic cycle. The engine is powered by the coherence of a multiqubit system, where each qubit is charged via interaction with a coherence bath using the Jaynes-Cummings model. We demonstrate that optimal coherence charging and hence extractable work is achieved when the coherence bath has an intermediate degree of coherence. In our model, the extractable work is maximized when four copies of the charged qubits are used. Meanwhile, the efficiency of the engine, given by the extractable work per input coherence flow, is optimized by avoiding the coherence being stored in the system-bath correlations that is inaccessible to work. We numerically find that the highest efficiency is obtained for slightly lower temperatures and weaker system-bath coupling than those for optimal coherence charging.

quant-ph↗

Demonstrating Quantum Microscopic Reversibility Using Coherent States of Light

The principle of microscopic reversibility lies at the core of fluctuation theorems, which have extended our understanding of the second law of thermodynamics to the statistical level. In the quantum regime, however, this elementary principle should be amended as the system energy cannot be sharply determined at a given quantum phase space point. In this Letter, we propose and experimentally test a quantum generalization of the microscopic reversibility when a quantum system interacts with a heat bath through energy-preserving unitary dynamics. Quantum effects can be identified by noting that the backward process is less likely to happen in the existence of quantum coherence between the system's energy eigenstates. The experimental demonstration has been realized by mixing coherent and thermal states in a beam-splitter, followed by heterodyne detection in an optical setup. We verify that the quantum modification for the principle of microscopic reversibility is critical in the low-temperature limit, while the quantum-to-classical transition is observed as the temperature of the thermal field gets higher.

quant-ph↗

Noise thresholds for classical simulability of non-linear Boson sampling

Boson sampling, a computational problem conjectured to be hard to simulate on a classical machine, is a promising candidate for an experimental demonstration of quantum advantage using bosons. However, inevitable experimental noise and imperfections, such as loss in the interferometer and random counts at the detectors, could challenge the sampling task from entering the regime where quantum advantage is achievable. In this work we introduce higher order non-linearities as a mean to enhance the computational complexity of the problem and the protocol's robustness against noise, i.e. increase the noise threshold that allows to perform an efficient classical simulation of the problem. Using a phase-space method based on the negativity volume of the relevant quasi-probability distributions, we establish a necessary non-classicality condition that any experimental proof of quantum advantage must satisfy. Our results indicate that the addition of single-mode Kerr non-linearity at the input state preparation level, while retaining a linear-optical evolution, makes the Boson sampling protocol more robust against noise and consequently relaxes the constraints on noise parameters required to show quantum advantage.

quant-ph↗

Faster Born probability estimation via gate merging and frame optimisation

Outcome probability estimation via classical methods is an important task for validating quantum computing devices. Outcome probabilities of any quantum circuit can be estimated using Monte Carlo sampling, where the amount of negativity present in the circuit frame representation quantifies the overhead on the number of samples required to achieve a certain precision. In this paper, we propose two classical sub-routines: circuit gate merging and frame optimisation, which optimise the circuit representation to reduce the sampling overhead. We show that the runtimes of both sub-routines scale polynomially in circuit size and gate depth. Our methods are applicable to general circuits, regardless of generating gate sets, qudit dimensions and the chosen frame representations for the circuit components. We numerically demonstrate that our methods provide improved scaling in the negativity overhead for all tested cases of random circuits with Clifford+$T$ and Haar-random gates, and that the performance of our methods compares favourably with prior quasi-probability simulators as the number of non-Clifford gates increases.

quant-ph↗

Speed limit for a highly irreversible process and tight finite-time Landauer's bound

Landauer's bound is the minimum thermodynamic cost for erasing one bit of information. As this bound is achievable only for quasistatic processes, finite-time operation incurs additional energetic costs. We find a tight finite-time Landauer's bound by establishing a general form of the classical speed limit. This tight bound well captures the divergent behavior associated with the additional cost of a highly irreversible process, which scales differently from a nearly irreversible process. We also find an optimal dynamics which saturates the equality of the bound. We demonstrate the validity of this bound via discrete one-bit and coarse-grained bit systems. Our work implies that more heat dissipation than expected occurs during high-speed irreversible computation.

cond-mat.stat-mech↗

Reversing Lindblad Dynamics via Continuous Petz Recovery Map

An important issue in developing quantum technology is that quantum states are so sensitive to noise. We propose a protocol that introduces reverse dynamics, in order to precisely control quantum systems against noise described by the Lindblad master equation. The reverse dynamics can be obtained by constructing the Petz recovery map in continuous time. By providing the exact form of the Hamiltonian and jump operators for the reverse dynamics, we explore the potential of utilizing the near-optimal recovery of the Petz map in controlling noisy quantum dynamics. While time-dependent dissipation engineering enables us to fully recover a single quantum trajectory, we also design a time-independent recovery protocol to protect encoded quantum information against decoherence. Our protocol can efficiently suppress only the noise part of dynamics thereby providing an effective unitary evolution of the quantum system.

quant-ph↗

Many-body probes for quantum features of spacetime

Many theories of quantum gravity can be understood as imposing a minimum length scale the signatures of which can potentially be seen in precise table top experiments. In this work we inspect the capacity for correlated many body systems to probe non-classicalities of spacetime through modifications of the commutation relations. We find an analytic derivation of the dynamics for a single mode light field interacting with a single mechanical oscillator and with coupled oscillators to first order corrections to the commutation relations. Our solution is valid for any coupling function as we work out the full Magnus expansion. We numerically show that it is possible to have superquadratic scaling of a non-classical phase term, arising from the modification to the commutation relations, with coupled mechanical oscillators.

quant-ph↗

Violating the Leggett-Garg inequalities with classical light

In an endeavour to better define the distinction between classical macroscopic and quantum microscopic regimes, the Leggett-Garg inequalities were established as a test of macroscopic-realistic theories, which are commonly thought to be a suitable class of descriptions for classical dynamics. The relationship between their violation and non-classicality is however not obvious. We show that classical states of light, which in the quantum optical sense are any convex sums of coherent states, may not satisfy the Leggett-Garg inequalities. After introducing a simple Mach-Zehnder setup and showing how to obtain a violation with a single photon using negative measurements, we focus on classical states of light, in particular those of low average photon number. We demonstrate how one can still perform negative measurements with an appropriate assignment of variables, and show that the inequalities are violable with coherent states. Finally, we abandon initial phase reference and demonstrate that the violation is still possible, in particular with thermal states of light, and we investigate the effect of intermediate dephasing.

quant-ph↗