Searcharxiv⌕ Search

arXiv subjects

Jinhyoung Lee

Publications and source records attributed to Jinhyoung Lee.

At least 37 records · Page 2Linked to original sources
arXiv2019

Experimental Demonstration on Quantum Sensitivity to Available Information in Decision Making

We present an experimental illustration on the quantum sensitivity of decision making machinery. In the decision making process, we consider the role of available information, say hint, whether it influences the optimal choices. To the end, we consider a machinery method of decision making in a probabilistic way. Our main result shows that in decision making process our quantum machine is more highly sensitive than its classical counterpart to the hints we categorize into "good" and "poor." This quantum feature originates from the quantum superposition involved in the decision making process. We also show that the quantum sensitivity persists before the quantum superposition is completely destroyed.

quant-ph↗
arXiv2018

Experimental demonstration of quantum learning speed-up with classical input data

We consider quantum-classical hybrid machine learning in which large-scale input channels remain classical and small-scale working channels process quantum operations conditioned on classical input data. This does not require the conversion of classical (big) data to a quantum superposed state, in contrast to recently developed approaches for quantum machine learning. We performed optical experiments to illustrate a single-bit universal machine, which can be extended to a large-bit circuit for binary classification task. Our experimental machine exhibits quantum learning speed-up of approximately 36%, as compared to the fully classical machine. In addition, it features strong robustness against dephasing noise.

quant-ph↗
arXiv2018

Quantifiable simulation of quantum computation beyond stochastic ensemble computation

In this study, a distinctive feature of quantum computation (QC) is characterized. To this end, a seemingly-powerful classical computing model, called "stochastic ensemble machine (SEnM)," is considered. The SEnM runs with an ensemble consisting of finite copies of a single probabilistic machine, hence is as powerful as a probabilistic Turing machine (PTM). Then the hypothesis--that is, the SEnM can effectively simulate a general circuit model of QC--is tested by introducing an information-theoretic inequality, named readout inequality. The inequality is satisfied by the SEnM and imposes a critical condition: if the hypothesis holds, the inequality should be satisfied by the probing model of QC. However, it is shown that the above hypothesis is not generally accepted with the inequality violation, namely, such a simulation necessarily fails, implying that PTM $\subseteq$ QC.

quant-ph↗
arXiv2018

Learning unknown pure quantum states

We propose a learning method for estimating unknown pure quantum states. The basic idea of our method is to learn a unitary operation $\hat{U}$ that transforms a given unknown state $|ψ_τ\rangle$ to a known fiducial state $|f\rangle$. Then, after completion of the learning process, we can estimate and reproduce $|ψ_τ\rangle$ based on the learned $\hat{U}$ and $|f\rangle$. To realize this idea, we cast a random-based learning algorithm, called `single-shot measurement learning,' in which the learning rule is based on an intuitive and reasonable criterion: the greater the number of success (or failure), the less (or more) changes are imposed. Remarkably, the learning process occurs by means of a single-shot measurement outcome. We demonstrate that our method works effectively, i.e., the learning is completed with a {\em finite} number, say $N$, of unknown-state copies. Most surprisingly, our method allows the maximum statistical accuracy to be achieved for large $N$, namely $\simeq O(N^{-1})$ scales of average infidelity. This result is comparable to those yielded from the standard quantum tomographic method in the case where additional information is available. It highlights a non-trivial message, that is, a random-based adaptive strategy can potentially be as accurate as other standard statistical approaches.

quant-ph↗
arXiv2018

Geometric extension of Clauser-Horne inequality to more qubits

We propose a geometric multiparty extension of Clauser-Horne (CH) inequality. The standard CH inequality can be shown to be an implication of the fact that statistical separation between two events, $A$ and $B$, defined as $P(A\oplus B)$, where $A\oplus B=(A-B)\cup(B-A)$, satisfies the axioms of a distance. Our extension for tripartite case is based on triangle inequalities for the statistical separations of three probabilistic events $P(A\oplus B \oplus C)$. We show that Mermin inequality can be retrieved from our extended CH inequality for three subsystems. With our tripartite CH inequality, we investigate quantum violations by GHZ-type and W-type states. Our inequalities are compared to another type, so-called $N$-site CH inequality. In addition we argue how to generalize our method for more subsystems and measurement settings. Our method can be used to write down several Bell-type inequalities in a systematic manner.

quant-ph↗
arXiv2017

Operational quasiprobabilities for continuous variables

We generalize the operational quasiprobability involving sequential measurements proposed by Ryu {\em et al.} [Phys. Rev. A {\bf 88}, 052123] to a continuous-variable system. The quasiprobabilities in quantum optics are incommensurate, i.e., they represent a given physical observation in different mathematical forms from their classical counterparts, making it difficult to operationally interpret their negative values. Our operational quasiprobability is {\em commensurate}, enabling one to compare quantum and classical statistics on the same footing. We show that the operational quasiprobability can be negative against the hypothesis of macrorealism for various states of light. Quadrature variables of light are our examples of continuous variables. We also compare our approach to the Glauber-Sudarshan $\mathcal{P}$ function. In addition, we suggest an experimental scheme to sequentially measure the quadrature variables of light.

quant-ph↗
arXiv2017

Quantum noise reduction in intensity-sensitive surface plasmon resonance sensors

We investigate the use of twin-mode quantum states of light with symmetric statistical features in their photon number for improving intensity-sensitive surface plasmon resonance (SPR) sensors. For this purpose, one of the modes is sent into a prism setup where the Kretschmann configuration is employed as a sensing platform and the analyte to be measured influences the SPR excitation conditions. This influence modifies the output state of light that is subsequently analyzed by an intensity-difference measurement scheme. We show that quantum noise reduction is achieved not only as a result of the sub-Poissonian statistical nature of a single mode, but also as a result of the non-classical correlation of the photon number between the two modes. When combined with the high sensitivity of the SPR sensor, we show that the use of twin-mode quantum states of light notably enhances the estimation precision of the refractive index of an analyte. With this we are able to identify a clear strategy to further boost the performance of SPR sensors, which are already a mature technology in biochemical and medical sensing applications.

quant-ph↗
arXiv2016

Irreducibility of coherent states

We suggest an optical method which tests a nonclassical feature with a coherent state input. The test is designed with a multiplexer of on/off detectors and post-selection, adopting sub-binomiality as a nonclassical feature, replacing Mandel's $Q$-factor. The sub-binomiality is shown negative even for coherent states when the post-selection is made. However, we show that it can be reproduced also by a classical model assuming a stochastic on/off detectors. In the sense, the sub-binomiality is unlikely to identify the genuine nonclassicality. On the other hand, we propose a coincident probability of first two branches of the multiplexer and show that the classical model fails to reproduce the quantum coincident probability. The failure of the classical model results from the classical description of light, i.e. the divisibility of intensity into parts no matter how small it is. Then our optical test identifies a nonclassical feature of coherent states against the classical divisibility of light, which we call irreducibility.

quant-ph↗
arXiv2016

Quantum plasmonic sensing: beyond the shot-noise and diffraction limit

Photonic sensors have many applications in a range of physical settings, from measuring mechanical pressure in manufacturing to detecting protein concentration in biomedical samples. A variety of sensing approaches exist, and plasmonic systems in particular have received much attention due to their ability to confine light below the diffraction limit, greatly enhancing sensitivity. Recently, quantum techniques have been identified that can outperform classical sensing methods and achieve sensitivity below the so-called shot-noise limit. Despite this significant potential, the use of definite photon number states in lossy plasmonic systems for further improving sensing capabilities is not well studied. Here, we investigate the sensing performance of a plasmonic interferometer that simultaneously exploits the quantum nature of light and its electromagnetic field confinement. We show that, despite the presence of loss, specialised quantum resources can provide improved sensitivity and resolution beyond the shot-noise limit within a compact plasmonic device operating below the diffraction limit.

quant-ph↗
arXiv2015

Quantum-mechanical machinery for rational decision-making in classical guessing game

In quantum game theory, one of the most intriguing and important questions is, "Is it possible to get quantum advantages without any modification of the classical game?" The answer to this question so far has largely been negative. So far, it has usually been thought that a change of the classical game setting appears to be unavoidable for getting the quantum advantages. However, we give an affirmative answer here, focusing on the decision-making process (we call 'reasoning') to generate the best strategy, which may occur internally, e.g., in the player's brain. To show this, we consider a classical guessing game. We then define a one-player reasoning problem in the context of the decision-making theory, where the machinery processes are designed to simulate classical and quantum reasoning. In such settings, we present a scenario where a rational player is able to make better use of his/her weak preferences due to quantum reasoning, without any altering or resetting of the classically defined game. We also argue in further analysis that the quantum reasoning may make the player fail, and even make the situation worse, due to any inappropriate preferences.

quant-ph↗
arXiv2015

Entropic lower bound for distinguishability of quantum states

For a system randomly prepared in a number of quantum states, we present a lower bound for the distinguishability of the quantum states, that is, the success probability of determining the states in the form of entropy. When the states are all pure, acquiring the entropic lower bound requires only the density operator and the number of the possible states. This entropic bound shows a relation between the von Neumann entropy and the distinguishability.

quant-ph↗
arXiv2014

A quantum speedup in machine learning: Finding a N-bit Boolean function for a classification

We compare quantum and classical machines designed for learning an N-bit Boolean function in order to address how a quantum system improves the machine learning behavior. The machines of the two types consist of the same number of operations and control parameters, but only the quantum machines utilize the quantum coherence naturally induced by unitary operators. We show that quantum superposition enables quantum learning that is faster than classical learning by expanding the approximate solution regions, i.e., the acceptable regions. This is also demonstrated by means of numerical simulations with a standard feedback model, namely random search, and a practical model, namely differential evolution.

quant-ph↗
arXiv2014

Strategy for quantum algorithm design assisted by machine learning

We propose a method for quantum algorithm design assisted by machine learning. The method uses a quantum-classical hybrid simulator, where a "quantum student" is being taught by a "classical teacher." In other words, in our method, the learning system is supposed to evolve into a quantum algorithm for a given problem assisted by classical main-feedback system. Our method is applicable to design quantum oracle-based algorithm. As a case study, we chose an oracle decision problem, called a Deutsch-Jozsa problem. We showed by using Monte-Carlo simulations that our simulator can faithfully learn quantum algorithm to solve the problem for given oracle. Remarkably, learning time is proportional to the square root of the total number of parameters instead of the exponential dependance found in the classical machine learning based method.

quant-ph↗
arXiv2014

Phonon-induced dynamic resonance energy transfer

In a network of interacting quantum systems achieving fast coherent energy transfer is a challenging task. While quantum systems are susceptible to a wide range of environmental factors, in many physical settings their interactions with quantized vibrations, or phonons, of a supporting structure are the most prevalent. This leads to noise and decoherence in the network, ultimately impacting the energy-transfer process. In this work, we introduce a novel type of coherent energy-transfer mechanism for quantum systems, where phonon interactions are able to actually enhance the energy transfer. Here, a shared phonon interacts with the systems and dynamically adjusts their resonances, providing remarkable directionality combined with quantum speed- up. We call this mechanism phonon-induced dynamic resonance energy transfer and show that it enables long-range coherent energy transport even in highly disordered systems.

quant-ph↗
arXiv2014

Is Bell inequality violated once measurement independence is relaxed?

It has been believed that statistical inequality such as Bell inequality should be modified once measurement independence (MI), the assumption that observers can freely choose measurement settings without changing the probability distribution of hidden variables, is relaxed. However, we show that there exists the possibility that Bell inequality is still valid even if MI is relaxed. MI is only a sufficient condition to derive Bell inequality when both determinism and setting independence, usually called as local realism, are satisfied. We thus propose a new condition necessary and sufficient for deriving Bell inequality, called as concealed measurement dependence.

quant-ph↗
arXiv2014

Experimental demonstration of error-insensitive approximate universal-NOT gates

We propose and experimentally demonstrate an approximate universal-NOT (U-NOT) operation that is robust against operational errors. In our proposal, the U-NOT operation is composed of stochastic unitary operations represented by the vertices of regular polyhedrons. The operation is designed to be robust against random operational errors by increasing the number of unitary operations (i.e., reference axes). Remarkably, no increase in the total number of measurements nor additional resources are required to perform the U-NOT operation. Our method can be applied in general to reduce operational errors to an arbitrary degree of precision when approximating any anti-unitary operation in a stochastic manner.

quant-ph↗
arXiv2014

Multi-setting Greenberger-Horne-Zeilinger theorem

We present a generalized Greenberger-Horne-Zeilinger (GHZ) theorem, which involves more than two local measurement settings for some parties, and cannot be reduced to one with less settings. Our results hold for an odd number of parties. We use a set of observables, which are incompatible but share a common eigenstate, here a GHZ state. Such observables are called concurrent. The idea is illustrated with an example of a three-qutrit system and then generalized to systems of higher dimensions, and more parties. The GHZ paradoxes can lead to, e.g., secret sharing protocols.

quant-ph↗