Jeongho Bang

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

We compare quantum and classical machines designed to learn a binary classification problem in order to address how quantum system improves the machine learning behaviour. Two machines consist of the same number of operations and control parameters, but only quantum machine plays with quantum coherence naturally induced by unitary operators. We show that quantum superposition enables quantum learning faster than classical learning by expanding the solution regions. This is also demonstrated by numerical simulations with a standard feedback model, random search, and a practical model, differential evolution.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.

Quantum macroscopicity measure for arbitrary spin systems and its application to quantum phase transitions

We explore a previously unknown connection between two important problems in physics, i.e., quantum macroscopicity and the quantum phase transition. We devise a general and computable measure of quantum macroscopicity that can be applied to arbitrary spin states. We find that a macroscopic quantum superposition of an extremely large size arises during the quantum phase transition of the transverse Ising model in contrast to some seeming macroscopic quantum phenomena such as superconductivity, superfluidity, and Bose-Einstein condensates. Our result may be an important step forward in understanding macroscopic quantum properties of many-body systems.

A genetic-algorithm-based method to find unitary transformations for any desired quantum computation and application to a one-bit oracle decision problem

We propose a genetic-algorithm-based method to find the unitary transformations for any desired quantum computation. We formulate a simple genetic algorithm by introducing the “genetic parameter vector” of the unitary transformations to be found. In the genetic algorithm process, all components of the genetic parameter vectors are supposed to evolve to the solution parameters of the unitary transformations. We apply our method to find the optimal unitary transformations and to generalize the corresponding quantum algorithms for a realistic problem, the one-bit oracle decision problem, or the often-called Deutsch problem. By numerical simulations, we can faithfully find the appropriate unitary transformations to solve the problem by using our method. We analyze the quantum algorithms identified by the found unitary transformations and generalize the variant models of the original Deutsch’s algorithm.

Procedures for realizing an approximate universal-NOT gate

We consider procedures to realize an approximate universal-NOT gate in terms of average fidelity and fidelity deviation. The average fidelity indicates the optimality of operation on average, while the fidelity deviation does the universality of operation. We show that one-qubit operations have a sharp trade-off relation between average fidelity and fidelity deviation, and two-qubit operations show a looser trade-off relation. The genuine universality holds for operations of more than two qubits, and those of even more qubits are beneficial to compensating imperfection of control. In addition, we take into account operational noises which contaminate quantum operation in realistic circumstances. We show that the operation recovers from the contamination by a feedback procedure of differential evolution. Our feedback scheme is also applicable to finding an optimal and universal NOT operation.

Genuinely high-dimensional nonlocality optimized by complementary measurements

Qubits exhibit extreme nonlocality when their state is maximally entangled and this is observed by mutually unbiased local measurements. This criterion does not hold for the Bell inequalities of high-dimensional systems (qudits), recently proposed by Collins–Gisin–Linden–Massar–Popescu and Son–Lee–Kim. Taking an alternative approach, called the quantum-to-classical approach, we derive a series of Bell inequalities for qudits that satisfy the criterion as for the qubits. In the derivation each d-dimensional subsystem is assumed to be measured by one of d possible measurements with d being a prime integer. By applying to two qubits (d=2), we find that a derived inequality is reduced to the Clauser–Horne–Shimony–Holt inequality when the degree of nonlocality is optimized over all the possible states and local observables. Further applying to two and three qutrits (d=3), we find Bell inequalities that are violated for the three-dimensionally entangled states but are not violated by any two-dimensionally entangled states. In other words, the inequalities discriminate three-dimensional (3D) entanglement from two-dimensional (2D) entanglement and in this sense they are genuinely 3D. In addition, for the two qutrits we give a quantitative description of the relations among the three degrees of complementarity, entanglement and nonlocality. It is shown that the degree of complementarity jumps abruptly to very close to its maximum as nonlocality starts appearing. These characteristics imply that complementarity plays a more significant role in the present inequality compared with the previously proposed inequality.

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.

Protocol for secure quantum machine learning at a distant place

The application of machine learning to quantum information processing has recently attracted keen interest, particularly for the optimization of control parameters in quantum tasks without any pre-programmed knowledge. By adapting the machine learning technique, we present a novel protocol in which an arbitrarily initialized device at a learner’s location is taught by a provider located at a distant place. The protocol is designed such that any external learner who attempts to participate in or disrupt the learning process can be prohibited or noticed. We numerically demonstrate that our protocol works faithfully for single-qubit operation devices. A trade-off between the inaccuracy and the learning time is also analyzed.

Experimental demonstration of error-insensitive approximate universal-NOT gates

We propose and experimentally demonstrate an approximate universal-NOT (UNOT) operation that is robust against operational errors. In our proposal, the UNOT 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 UNOT operation. Our method can be applied in general to reduce operational errors to an arbitrary degree of precision when approximating any antiunitary operation in a stochastic manner.

A quantum heuristic algorithm for the traveling salesman problem

We propose a quantum heuristic algorithm to solve the traveling salesman problem by generalizing the Grover search. Sufficient conditions are derived to greatly enhance the probability of finding the tours with the cheapest costs reaching almost to unity. These conditions are characterized by the statistical properties of tour costs and are shown to be automatically satisfied in the large-number limit of cities. In particular for a continuous distribution of the tours along the cost, we show that the quantum heuristic algorithm exhibits a quadratic speedup compared to its classical heuristic algorithm.

Fidelity deviation in quantum teleportation

We analyze the performance of quantum teleportation in terms of average fidelity and fidelity deviation. The average fidelity is defined as the average value of the fidelities over all possible input states and the fidelity deviation is their standard deviation, which is referred to as a concept of fluctuation or universality. In the analysis, we find the condition to optimize both measures under a noisy quantum channel---we here consider the so-called Werner channel. To characterize our results, we introduce a two-dimensional space defined by the aforementioned measures, in which the performance of the teleportation is represented as a point with the channel noise parameter. Through further analysis, we specify some regions drawn for different channel conditions, establishing the connection to the dissimilar contributions of the entanglement to the teleportation and the Bell inequality violation.