Searcharxiv⌕ Search

arXiv subjects

Joonwoo Bae

Publications and source records attributed to Joonwoo Bae.

At least 55 records · Page 3Linked to original sources

Detecting Entanglement Generating Circuits in Cloud-Based Quantum Computing

Entanglement, a direct consequence of elementary quantum gates such as controlled-NOT or Toffoli gates, is a key resource that leads to quantum advantages. In this work, we establish the framework of certifying entanglement generation in cloud-based quantum computing services. Namely, we present the construction of quantum circuits that certify entanglement generation in a circuit-based quantum computing model. The framework relaxes the assumption of the so-called qubit allocation, which is the step in a cloud service to relate physical qubits in hardware to a circuit proposed by a user. Consequently, the certification is valid no matter how unsuccessful qubit allocations may be in cloud computing or how untrustful the service may be in qubit allocations. We then demonstrate the certification of entanglement generation on two and three qubits in the IBMQ and IonQ services. Remarkably, entanglement generation is successfully certified in the IonQ service that does not provide a command of qubit allocations. The capabilities of entanglement generation in the circuits of IBMQ and IonQ are also quantified. We envisage that the proposed framework is applied when cloud-based quantum computing services are exploited for practical computation and information tasks, for which our results would find if it is possible to achieve quantum advantages.

quant-ph↗

Non-Local Network Coding in Interference Channels

In a network, a channel introduces correlations to the parties that aim to establish a communication protocol. In this work, we present a framework of non-local network coding by exploiting a Bell scenario and show the usefulness of non-local and quantum resources in network coding. Two-sender and two-receiver interference channels are considered, for which network coding is characterized by two-input and four-outcome Bell scenarios. It is shown that non-signaling (quantum) correlations lead to strictly higher channel capacities in general than quantum (local) correlations. It is also shown that, however, more non-locality does not necessarily imply a higher channel capacity. The framework can be generally applied to network communication protocols.

quant-ph↗

Optimal measurement preserving qubit channels

We consider the problem of discriminating qubit states that are sent over a quantum channel and derive a necessary and sufficient condition for an optimal measurement to be preserved by the channel. We apply the result to the characterization of optimal measurement preserving (OMP) channels for a given qubit ensemble, e.g., a set of two states or a set of multiple qubit states with equal a priori probabilities. Conversely, we also characterize qubit ensembles for which a given channel is OMP, such as unitary and depolarization channels. Finally, we show how the sets of OMP channels for a given ensemble can be constructed.

quant-ph↗

Entanglement Witness $2.0$: Compressed/Mirrored Entanglement Witnesses

An entanglement witness is an observable detecting entanglement for a subset of states. We present a framework that makes an entanglement witness twice as powerful due to the general existence of a second (lower) bound, in addition to the (upper) bound of the very definition. This second bound, if non-trivial, is violated by another subset of entangled states. Differently stated, we prove via the structural physical approximation that two witnesses can be compressed into a single one. Consequently, our framework shows that any entanglement witness can be upgraded to a witness $2.0$. The generality and its power are demonstrate by applications to bipartite and multipartite qubit/qudit systems.

quant-ph↗

Measurement-Protected Quantum Key Distribution

In the distribution of quantum states over a long distance, not only are quantum states corrupted by interactions with an environment but also a measurement setting should be re-aligned such that detection events can be ensured for the resulting states. In this work, we present measurement-protected quantum key distribution where a measurement is protected against the interactions quantum states experience during the transmission, without the verification of a channel. As a result, a receiver does not have to revise the measurement that has been prepared in a noiseless scenario since it would remain ever optimal. The measurement protection is achieved by applications of local unitary transformations before and after the transmission, that leads to a supermap transforming an arbitrary channel to a depolarization one. An experimental demonstration is presented with the polarization encoding on photonic qubits. It is shown that the security bounds for prepare-and-measure protocols can be improved, for instance, errors up to 20.7% can be tolerated in the Bennett-Brassard 1984 protocol.

quant-ph↗

Information-Theoretic Meaning of Quantum Information Flow and Its Applications to Amplitude Amplification Algorithms

The advantages of quantum information processing are in many cases obtained as consequences of quantum interactions, especially for computational tasks where two-qubit interactions are essential. In this work, we establish the framework of analyzing and quantifying loss or gain of information on a quantum system when the system interacts with its environment. We show that the information flow, the theoretical method of characterizing (non-)Markovianity of quantum dynamics, corresponds to the rate of the minimum uncertainty about the system given quantum side information. Thereafter, we analyze the information exchange among subsystems that are under the performance of quantum algorithms, in particular, the amplitude amplification algorithms where the computational process relies fully on quantum evolution. Different realizations of the algorithm are considered, such as i)quantum circuits, ii) analog computation, and iii) adiabatic computation. It is shown that, in all the cases, our formalism provides insights about the process of amplifying the amplitude from the information flow or leakage on the subsystems.

quant-ph↗

Channel Coding of a Quantum Measurement

In this work, we consider the preservation of a measurement for quantum systems interacting with an environment. Namely, a method of preserving an optimal measurement over a channel is devised, what we call channel coding of a quantum measurement in that operations are applied before and after a channel in order to protect a measurement. A protocol that preserves a quantum measurement over an arbitrary channel is shown only with local operations and classical communication without the use of a larger Hilbert space. Therefore, the protocol is readily feasible with present day's technologies. Channel coding of qubit measurements is presented, and it is shown that a measurement can be preserved for an arbitrary channel for both i) pairs of qubit states and ii) ensembles of equally probable states. The protocol of preserving a quantum measurement is demonstrated with IBM quantum computers.

quant-ph↗

Quantifying the nonclassicality of pure dephasing

One of the central problems in quantum theory is to characterize, detect, and quantify quantumness in terms of classical strategies. Dephasing processes, caused by non-dissipative information exchange between quantum systems and environments, provides a natural platform for this purpose, as they control the quantum-to-classical transition. Recently, it has been shown that dephasing dynamics itself can exhibit (non)classical traits, depending on the nature of the system-environment correlations and the related (im)possibility to simulate these dynamics with Hamiltonian ensembles---the classical strategy. Here we establish the framework of detecting and quantifying the nonclassicality for pure dephasing dynamics. The uniqueness of the canonical representation of Hamiltonian ensembles is shown, and a constructive method to determine the latter is presented. We illustrate our method for qubit, qutrit, and qubit-pair pure dephasing and describe how to implement our approach with quantum process tomography experiments. Our work is readily applicable to present-day quantum experiments.

quant-ph↗

Detecting Noisy Channels by Channel Discrimination : Local versus Entangled Resources

Dynamics of many-qubit systems, that may correspond to computational processing with quantum systems, can be efficiently and generally approximated by a sequence of two- and single-qubit gates. In practical applications, however, a quantum gate prepared as a unitary transformation may appear as a noisy channel and consequently may inhibit quantum advantages. In this work, we apply the scheme of channel discrimination to detect if a quantum gate that is actually realized is unitary or noisy. We show that a two-qubit unitary transformation and its noisy counterpart can be optimally discriminated by local resources, without the necessity of creating entanglement repeatedly. It is also shown that the scheme can be applied to estimation of the fraction of noise existing in quantum gates.

quant-ph↗

Preserving Measurements for Optimal State Discrimination over Quantum Channels

In this work, we consider optimal state discrimination for a quantum system that interacts with an environment, i.e., states evolve under a quantum channel. We show the conditions on a quantum channel and an ensemble of states such that a measurement for optimal state discrimination is preserved. In particular, we show that when an ensemble of states with equal {\it a priori} probabilities is given, an optimal measurement can be preserved over any quantum channel by applying local operations and classical communication, that is, by manipulating the quantum states before and after the channel application. Examples are provided for illustration. Our results can be readily applied to quantum communication protocols over various types of noise.

quant-ph↗

Quantum entropy and non-Markovian evolution

Entropy, and its temporal evolution, play a central role in the foundations of quantum theory and in modern quantum technologies. Here we study, in particular, the relations between the --- in general, non-Markovian --- evolution of an open quantum system, the notions of divisibility of a dynamical map and of distinguishability of quantum states, and the temporal behaviour of various entropy-related quantities such as the Renyi (and sandwiched Renyi) divergences, and the so-called min- and max- conditional entropies. This, in turn, gives rise to an operational meaning of (non-)Markovianity.

quant-ph↗

Linking Entanglement Detection and State Tomography via Quantum 2-Designs

We present an experimentally feasible and efficient method for detecting entangled states with measurements that extend naturally to a tomographically complete set. Our detection criterion is based on measurements from subsets of a quantum 2-design, e.g., mutually unbiased bases or symmetric informationally complete states, and has several advantages over standard entanglement witnesses. First, as more detectors in the measurement are applied, there is a higher chance of witnessing a larger set of entangled states, in such a way that the measurement setting converges to a complete setup for quantum state tomography. Secondly, our method is twice as effective as standard witnesses in the sense that both upper and lower bounds can be derived. Thirdly, the scheme can be readily applied to measurement-device-independent scenarios.

quant-ph↗

Quantum state discrimination and its applications

Quantum state discrimination underlies various applications in quantum information processing tasks. It essentially describes the distinguishability of quantum systems in different states, and the general process of extracting classical information from quantum systems. It is also useful in quantum information applications, such as the characterisation of mutual information in cryptographic protocols, or as a technique to derive fundamental theorems in quantum foundations. It has deep connections to physical principles such as relativistic causality. Quantum state discrimination traces a long history of several decades, starting with the early attempts to formalise information processing of physical systems such as optical communication with photons. Nevertheless, in most cases, optimal strategies of quantum state discrimination remain unsolved, and related applications are valid in some limited cases only. The present review aims to provide an overview on quantum state discrimination, covering some recent progress, and addressing applications in some selected topics. This review serves to strengthen the link between results in quantum state discrimination and quantum information applications, by showing the ways in which the fundamental results are exploited in applications and vice versa.

quant-ph↗

Designing Quantum Information Processing via Structural Physical Approximation

In quantum information processing it may be possible to have efficient computation and secure communication beyond the limitations of classical systems. In a fundamental point of view, however, evolution of quantum systems by the laws of quantum mechanics is more restrictive than classical systems, identified to a specific form of dynamics, that is, unitary transformations and, consequently, positive and completely positive maps to subsystems. This also characterizes classes of disallowed transformations on quantum systems, among which positive but not completely maps are of particular interest as they characterize entangled states, a general resource in quantum information processing. Structural physical approximation offers a systematic way of approximating those non-physical maps, positive but not completely positive maps, with quantum channels. Since it has been proposed as a method of detecting entangled states, it has stimulated fundamental problems on classifications of positive maps and the structure of Hermitian operators and quantum states, as well as on quantum measurement such as quantum design in quantum information theory. It has developed efficient and feasible methods of directly detecting entangled states in practice, for which proof-of-principle experimental demonstrations have also been performed with photonic qubit states. Here, we present a comprehensive review on quantum information processing with structural physical approximations and the related progress. The review mainly focuses on properties of structural physical approximations and their applications toward practical information applications.

quant-ph↗

Distilling Entanglement with Noisy Operations

Entanglement distillation is a fundamental task in quantum information processing. It not only extracts entanglement out of corrupted systems but also leads to protecting systems of interest against intervention with environment. In this work, we consider a realistic scenario of entanglement distillation where noisy quantum operations are applied. In particular, the two-way distillation protocol that tolerates the highest error rate is considered. We show that among all types of noise there are only four equivalence classes according to the distillability condition. Since the four classes are connected by local unitary transformations, our results can be used to improve entanglement distillability in practice when entanglement distillation is performed in a realistic setting.

quant-ph↗

Structure of Optimal State Discrimination in Generalized Probabilistic Theories

We consider optimal state discrimination in a general convex operational framework, so-called generalized probabilistic theories (GPTs), and present a general method of optimal discrimination by applying the complementarity problem from convex optimization. The method exploits the convex geometry of states but not other detailed conditions or relations of states and effects. We also show that properties in optimal quantum state discrimination are shared in GPTs in general: i) no measurement sometimes gives optimal discrimination, and ii) optimal measurement is not unique.

quant-ph↗