arXiv subjects

Joonwoo Bae

Publications and source records attributed to Joonwoo Bae.

At least 19 recordsLinked to original sources

arXiv2026

Semi-Device-Independent Certification for Nonlocality without Entanglement

In this work, we present the framework for demonstrating and certifying the distinction between measurements in an entangled basis, called global measurements, and local operations and classical communication (LOCC), known as nonlocality without entanglement (NLWE). To be precise, we show NLWE via a maximum-confidence measurement in terms of a guess per detection event, called a confidence, a fine-grained guessing probability that encompasses both minimum-error and unambiguous state-discrimination strategies. We show that NLWE for unknown measurements can be certified, given the measurement-outcome rates, by bounding the confidence using LOCC; the certification is semi-device-independent in that state preparation is trusted. We illustrate the demonstration and certification of NLWE for antiparallel qubit states. Our results make it feasible to experimentally realize NLWE using measurement devices with imperfections, such as non-unit detection efficiency, since maximum-confidence measurements rely only on detected events.

quant-ph↗

arXiv2026

Measurement circuit ansatz: Naimark versus quantum neural-network measurements

In this work, we present constructions of quantum circuits to implement general measurements on quantum hardware. Firstly, we investigate a quantum circuit ansatz by following the Naimark extension with a universal set of gates, such as controlled-NOT and single-qubit gates; we call it a Naimark quantum measurement. We present a circuit ansatz framed by the Naimark extension, leaving single-qubit gates with parameters, and apply a classical optimizer to determine their parameters to approximate a desired quantum measurement. Secondly, we relax the Naimark measurement with quantum neural-network (QNN) circuits, employing parameterized quantum circuits. We present hybrid Naimark-QNN measurements by incorporating QNN circuits into Naimark measurements. Thirdly, we also consider fully QNN measurements with shallow parameterized circuits. Then, we compare the constructed measurement circuits, Naimark, hybrid Naimark-QNN, and fully QNN measurements, for strategies of state discrimination, such as minimum-error and maximum-confidence measurements. We demonstrate that QNN circuits can efficiently and effectively achieve near-optimal quantum measurements with fewer training iterations.

quant-ph↗

arXiv2026

Peptide Structure Prediction Using Counter-Diabatic Quantum Approximate Optimization Algorithm (CD-QAOA)

In this study, we predicted the structure of the heptapeptide APRLRFY, a neuropeptide sequence, on a tetrahedral lattice using a Quantum Approximate Optimization Algorithm (QAOA). QAOA is based on the adiabatic approximation and has been successfully applied to a wide range of optimization problems. However, relatively slow convergence during ground-state searches has frequently been reported. To overcome this limitation, we employed the Counter-Diabatic Quantum Approximate Optimization Algorithm (CD-QAOA), which introduces an additional counter-diabatic driving term into the adiabatic framework to accelerate convergence toward the ground state during peptide structure prediction. In the heptapeptide structure prediction, intermolecular interactions were modeled using two different approaches. In the first approach, only the interaction between the second residue, proline (P), and the seventh residue, tyrosine (Y), was included in the optimization. In the second approach, all residue-residue interactions within the heptapeptide were modeled using the Miyazawa-Jernigan (MJ) interaction matrix. To validate the peptide structures predicted using CD-QAOA, we additionally employed several classical computational methods, including quantum chemistry-based Hartree-Fock (HF) calculation and Density Functional Theory (DFT) calculation, conventional molecular dynamics (MD) simulation, and Hamiltonian replica exchange molecular dynamics (H-REMD) simulation. The structural similarities among the conformations obtained from these different approaches were systematically analyzed. CD-QAOA is highly effective for predicting the structures of short peptides. In particular, we demonstrate that a quantum-classical hybrid framework can significantly improve both the efficiency and accuracy of peptide structure prediction.

q-bio.BM↗

arXiv2026

One pure steered state implies Einstein-Podolsky-Rosen steering

In this work, we show that a two-qubit entangled state admitting at least one pure steered state is Einstein-Podolsky-Rosen (EPR) steerable from Alice to Bob. Pure steered states signifies that the quantum steering ellipsoid of Bob is tangent to his Bloch sphere at least at a single point. Furthermore, we prove that for a two-qubit entangled state, Bob's quantum steering ellipsoid is tangent to his Bloch sphere at exactly $N$ points, for $N\in \{ 0,1,2,\infty\}$, if and only if Alice's quantum steering ellipsoid is tangent to her Bloch sphere at exactly $N$ points. For any two-qubit entangled state, therefore, if one party can steer the other to at least one pure state, the state is two-way EPR steerable. We also present several illuminating examples of two-qubit entangled states such that the EPR steering can be verified in terms of pure steered states. Our result addresses the Gisin theorem in a EPR steering scenario: at least a single pure steered state implies two-way steering.

quant-ph↗

arXiv2026

Entropy Bounds via Hypothesis Testing and Its Applications to Two-Way Key Distillation in Quantum Cryptography

Quantum key distribution (QKD) achieves information-theoretic security, without relying on computational assumptions, by distributing quantum states. To establish secret bits, two honest parties exploit key distillation protocols over measurement outcomes resulting after the the distribution of quantum states. In this work, we establish a rigorous connection between the key rate achievable by applying two-way key distillation, such as advantage distillation, and quantum asymptotic hypothesis testing, via an integral representation of the relative entropy. This connection improves key rates at small to intermediate blocklengths relative to existing fidelity-based bounds and enables the computation of entropy bounds for intermediate to large blocklengths. Moreover, this connection allows one to close the gap between known sufficient and conjectured necessary conditions for key generation in the asymptotic regime, while the precise finite blocklegth conditions remain open. More broadly, our work shows how advances in quantum multiple hypothesis testing can directly sharpen the security analyses of QKD.

quant-ph↗

arXiv2025

Sharing quantum indistinguishability with multiple parties

Quantum indistinguishability of non-orthogonal quantum states is a valuable resource in quantum information applications such as cryptography and randomness generation. In this article, we present a sequential state-discrimination scheme that enables multiple parties to share quantum uncertainty, in terms of the max relative entropy, generated by a single party. Our scheme is based upon maximum-confidence measurements and takes advantages of weak measurements to allow a number of parties to perform state discrimination on a single quantum system. We review known sequential state discrimination and show how our scheme would work through a number of examples where ensembles may or may not contain symmetries. Our results will have a role to play in understanding the ultimate limits of sequential information extraction and guide the development of quantum resource sharing in sequential settings.

quant-ph↗

arXiv2025

Practical and Efficient Verification of Entanglement with Incomplete Measurement Settings

In this work, we present a practical and efficient framework for verifying entangled states when only a tomographically incomplete measurement setting is available-specifically, when access to observables is severely limited. We show how the experimental estimation of a small number of observables can be directly exploited to construct a large family of entanglement witnesses, enabling the efficient identification of entangled states. Moreover, we introduce an optimization approach, formulated as a semidefinite program, that systematically searches for those witnesses best suited to reveal entanglement under the given measurement constraints. We demonstrate the practicality of the approach in a proof-of-principle experiment with photon-polarization qubits, where entanglement is certified using only a fraction of the full measurement data. These results reveal the maximal usefulness of incomplete measurement settings for entanglement verification in realistic scenarios.

quant-ph↗

arXiv2025

Contextual advantages across two-state discrimination strategies

Quantum state discrimination, alongside its other applications, has recently found use as a tool for witnessing generalised contextuality. In this article, we derive noncontextuality inequalities for both conclusive and inconclusive outcomes across various guessing strategies. For minimum-error discrimination, the advantage is in terms of the confidences of individual outcomes, while for unambiguous state discrimination, it is in terms of the average guessing probability. For maximum-confidence discrimination, we show that contextual advantages occur not only for the confidence but also their average, the guessing probability, as well as the inconclusive outcome rate. Our results show that contextual advantages are observed across all two-state discrimination schemes and figures of merit. We envisage that various quantum information applications based on state discrimination may offer advantages over noncontextual theories.

quant-ph↗

arXiv2025

Sequential Semi-Device-Independent Quantum Randomness Certification

Quantum measurements under realistic conditions reveal only partial information about a system. Yet, by performing sequential measurements on the same system, additional information can be accessed. We investigate this problem in the context of semi-device-independent randomness certification using sequential maximum confidence measurements. We develop a general framework and versatile numerical methods to bound the amount of certifiable randomness in such scenarios. We further introduce a technique to compute min-tradeoff functions via semidefinite programming duality, thus making the framework suitable for bounding the certifiable randomness against adaptive attacking strategies through entropy accumulation. Our results establish sufficient criteria showing that maximum confidence measurements enable the distribution and certification of randomness across a sequential measurement chain.

quant-ph↗

arXiv2025

Mirrored Entanglement Witnesses for Multipartite and High-Dimensional Quantum Systems

Entanglement witnesses (EWs) are a versatile tool to detect entangled states and characterize related properties of entanglement in quantum information theory. A witness $W$ corresponds to an observable satisfying $\mathrm{tr}[W\sigma_{\mathrm{sep}}]\geq 0$ for all separable states $\sigma_{\mathrm{sep}}$; entangled states are detected once the inequality is violated. Recently, mirrored EWs have been introduced by showing that there exist non-trivial upper bounds to EWs, \begin{eqnarray} u_W\geq \mathrm{tr}[W\sigma_{\mathrm{sep}}]\geq 0. \nonumber \end{eqnarray} An upper bound to a witness $W$ signifies the existence of the other one $M$, called a mirrored EW, such that $W+M = u_W I \otimes I$. The framework of mirrored EWs shows that a single EW can be even more useful, as it can detect a larger set of entangled states by lower and upper bounds. In this work, we develop and investigate mirrored EWs for multipartite qubit states and also for high-dimensional systems, to find the efficiency and effectiveness of mirrored EWs in detecting entangled states. We provide mirrored EWs for $n$-partite GHZ states, graph states such as two-colorable states, and tripartite bound entangled states. We also show that optimal EWs can be reflected with each other. For bipartite systems, we present mirrored EWs for existing optimal EWs and also construct a mirrored pair of optimal EWs in dimension three. Finally, we generalize mirrored EWs such that a pair of EWs can be connected by another EW, i.e., $W+M =K$ is also an EW. Our results enhance the capability of EWs to detect a larger set of entangled states in multipartite and high-dimensional quantum systems.

quant-ph↗

arXiv2025

Enhancing Sum Capacity via Quantum and No-Signaling Cooperation Between Transmitters

We consider communication over discrete memoryless interference channels or multiple access channels without feedback, where transmitters exploit classical, quantum, or no-signaling cooperation. Previous works have shown that, for channels associated with pseudo-telepathy games, quantum or no-signaling cooperation can increase the sum capacity. However, a full characterization of channels admitting such an improvement remains open. Motivated by common features of previously studied examples, we propose a broader class of game-induced channels. In these channels, each input is a question-answer pair from a nonlocal game. When the inputs satisfy the game's winning condition, the channel has lower conditional output uncertainty, and the channel decomposes into parallel weakly symmetric subchannels with a unique capacity-achieving input distribution. We show that, for this class, quantum or no-signaling cooperation strictly increases the sum capacity whenever the associated game is a quantum or no-signaling pseudo-telepathy game, respectively. The proposed class recovers several previously studied channels and includes new examples.

quant-ph↗

arXiv2025

Carrier-Assisted Entanglement Purification

Entanglement distillation, a fundamental building block of quantum networks, enables the purification of noisy entangled states shared among distant nodes by local operations and classical communication. Its practical realization presents several technical challenges, including the storage of quantum states in quantum memory and the execution of coherent quantum operations on multiple copies of states within the quantum memory. In this work, we present an entanglement purification protocol via quantum communication, namely a carrier-assisted entanglement purification protocol, which utilizes two elements only: i) quantum memory for a single-copy entangled state shared by parties and ii) single qubits travelling between parties. We show that the protocol, when single-qubit transmission is noiseless, can purify a noisy entangled state shared by parties. When single-qubit transmission is noisy, the purification relies on types of noisy qubit channels; we characterize Pauli channels such that the protocol works for the purification. We address this limitation by using multiple carrier qubits, and show that for any non-entanglement-breaking Pauli channel, the protocol's fixed-point fidelity approaches unity as the number of carriers increases. Our results significantly reduce the experimental overhead required for distilling entanglement: the practical advantage is demonstrated through parameters directly related to the capability of entanglement purification, such as noise in quantum memory, local measurements, channel use, and entanglement fidelity. We envisage that the protocol would make long-distance pure entanglement closer to a practical realization.

quant-ph↗

arXiv2025

Protocol for Purifying Noisy Preparation and Measurements of Qubits

Noise affecting qubit preparation and measurements accounts for a significant fraction of errors in quantum information processing. This is especially critical in tasks like variational quantum algorithms, quantum error correction, and entanglement distribution through repeaters. In this work, we present a protocol to purify noisy SPAM, effectively suppressing these errors to an arbitrarily low level. For instance, in a realistic scenario where qubits contain error rates around $0.05$ in both preparation and measurement, the protocol can suppress error rates up to $10^{-3}$ with two ancillas and $10^{-6}$ with four ancillas. We show how to distill error-free SPAM by repeating noisy SPAMs. The protocol is also feasible with superconducting qubits. We envisage that our results can be used to realize quantum information tasks in computing and communication with negligible SPAM errors.

quant-ph↗

arXiv2025

Random Exclusion Codes: Quantum Advantages of Single-Shot Communication

Useful applications of quantum information technologies can be found by identifying tasks in which quantum resources outperform their classical counterparts. In this work, we introduce a two-party communication primitive, random exclusion code (REC), which is a single-shot prepare-and-measure protocol where a sender encodes a random message into a shorter sequence and a receiver attempts to exclude a randomly chosen letter in the original message. We present quantum advantages in RECs in two ways: probability and dimension. We show that RECs with quantum resources achieve higher success probabilities than classical strategies. We verify that the quantum resources required to describe detection events of RECs have a smaller dimension than classical ones. We also show that a guessing counterpart, random access codes (RACs), may not have a dimension advantage over classical resources. Our results elucidate various possibilities of achieving quantum advantages in two-party communication.

quant-ph↗

arXiv2025

Composable framework for device-independent state certification

Certifying a quantum state in a device-independent (DI) manner, in which no trust is placed on the internal workings of any physical components, is a fundamental task bearing various applications in quantum information theory. The composability of a state certification protocol is key to its integration as a subroutine within information-theoretic protocols. In this work, we present a composable certification of quantum states in a DI manner under the assumption that a source prepares a finite sequence of independent quantum states that are not necessarily identical. We show that the security relies on the DI analog of the fidelity, called the extractability. We develop methods to compute this quantity under local operations and classical communication in certain Bell scenarios that self-test the singlet state, which may also be of independent interest. Finally, we demonstrate our framework by certifying the singlet state in a composable and DI manner using the Clauser-Horne-Shimony-Holt inequality.

quant-ph↗

arXiv2025

A mirrored pair of optimal non-decomposable entanglement witnesses for two qudits does exist

Two approaches can be utilized to handle the separability problem, finding out whether a given bipartite qudit state is separable or not: a direct procedure on the state space or the effective tool of entanglement witnesses (EWs). This contribution studies the structure of EWs. Exploiting the very concept of mirrored EWs, increasing the detection power, we show, in contrast to the conjecture in a recent paper (Sci. Rep. {\bf 13}, 10733 (2023)), there exist pairs of optimal EWs, which are both non-decomposible, i.e. can detect bound/PPT-entangled states in an optimal way. Since we show that the structure also extends to higher dimensions, our results reveal a further structure of entanglement witnesses.

quant-ph↗

arXiv2025

Quantum Advantage in Locally Differentially Private Hypothesis Testing

We consider a private hypothesis testing scenario, including both symmetric and asymmetric testing, based on classical data samples. The utility is measured by the error exponents, namely the Chernoff information and the relative entropy, while privacy is measured in terms of classical or quantum local differential privacy. In this scenario, we show a quantum advantage with respect to the optimal privacy-utility trade-off (PUT) in certain cases. Specifically, we focus on distributions referred to as smoothed point mass distributions, along with the uniform distribution, as hypotheses. We then derive upper bounds on the optimal PUTs achievable by classical privacy mechanisms, which are tight in specific instances. To show the quantum advantage, we propose a particular quantum privacy mechanism that achieves better PUTs than these upper bounds in both symmetric and asymmetric testing, specifically under stringent privacy constraints and small discrete data alphabet sizes ranging from 3 to 9. The proposed mechanism consists of a classical-quantum channel that prepares symmetric informationally complete (SIC) states, followed by a depolarizing channel.

quant-ph↗

arXiv2024

Quantum Advantages in (n,d)->1 Random Access Codes

A random access code (RAC), corresponding to a communication primitive with various applications in quantum information theory, is an instance of a preparation-and-measurement scenario. In this work, we consider (n,d)-RACs constituting an "n"-length string, constructed from a "d" size set of letters, and send an encoding of the string in a single d-level physical system and present their quantum advantages. We first characterize optimal classical RACs, proving that the well-known classical strategy known as majority-encoding-identity-decoding is indeed optimal. We then construct a quantum protocol by exploiting only two incompatible measurements, the minimal requirement, and show the advantages beyond the classical one. We also discuss the generality of our results and whether quantum advantages are valid for all types of (n, d)->1 RACs.

quant-ph↗