Searcharxiv⌕ Search

arXiv subjects

Yuan-Hong Tao

Publications and source records attributed to Yuan-Hong Tao.

12 recordsLinked to original sources

Optimal finite-copy readout of three-qubit entanglement with state retention

For unknown three-qubit pure states, we characterize the optimal trade-off among GHZ-class certification, binary probability readout of the three-tangle, and conditional state retention. The vanishing ideal of the null class specifies the optimal certification subspace, while a polynomial multiplication operator gives the spectral limit for binary readout. Four copies are necessary for a nonzero certificate. A fifth copy raises the optimal success probability from $τ^{2}/48$ to $5τ^{2}/72$ and permits the original unknown state to be retained, where $τ$ is the three-tangle. We obtain this gain as an instance of a general symmetry-based additional-copy theorem. At six copies the optimal certification probability is $(39+2S)τ^{2}/296$, with $S=\sum_{X}\mathrm{Tr}\,ρ_{X}^{2}$, whereas the largest exact binary probability is $τ^{2}/8$. Local Schur measurements and conditional local operations with classical communication attain these bounds. Retaining the full six-copy branch record yields a weighted estimator with lower variance than binary thinning of the same data. Explicit circuits and fixed-budget comparisons connect the success probabilities to input-copy consumption, retained quantum output, and coherent gate cost.

quant-ph↗

Constant-Depth Quantum Barrier Option Pricing via a Static Bivariate Oracle Framework

Quantum amplitude estimation offers a theoretical quadratic speedup over classical Monte Carlo methods for financial derivative pricing. However, extending gate-based algorithms to path-dependent barrier options has historically been hampered by sequential path discretization, where tracking price paths across $d$ monitoring dates incurs a linear escalation in qubit footprint and gate depth ($\mathcal{O}(d)$), posing severe coherence challenges for near-term quantum processors. In this work, we present a constant-depth quantum pricing framework that fundamentally eliminates the temporal dependency of barrier monitoring. Leveraging the Brownian reflection principle and Girsanov theorem, we project the continuous supremum dynamics onto a static bivariate joint distribution of the terminal price $S_T$ and running supremum $M_T$. This allows decoupling dynamic boundary checks into a static bivariate oracle comprising two parallel comparators and a dual-controlled rotation gate. We prove this architecture reduces circuit depth and comparator complexity from $\mathcal{O}(d)$ to an invariant $\mathcal{O}(1)$, while supporting discrete monitoring via zero-quantum-cost boundary corrections. Transpilation benchmarks for daily monitoring ($d = 252$) show our framework slashes physical CNOT count by 98.59% (from 2262 to 32) and compresses two-qubit depth by 98.02% (from 1514 to 30 layers). Under a realistic 127-qubit IBM Eagle noise model, the shallow circuit achieves a 7.84% relative valuation error with M3 readout mitigation. Finally, the framework seamlessly extends to nonlinear exotic payoffs lacking analytical solutions, establishing a noise-resilient pathway toward practical quantum advantage in computational finance.

quant-ph↗

Pairwise detection, chiral conversion: Resource theory of quantum multistates

Basis-independent coherence of a quantum multistate is fixed by whether its constituent states commute, and for qubits it is detected by pairwise state overlaps alone. What governs its deterministic transformation has been open. We give the exact resource-conversion theory of quantum multistates under common commutativity-preserving operations (CPOs). For qubits, pairwise Bargmann invariants determine the singular values of the unique candidate channel, while a single third-order Bargmann phase determines its orientation. Complete positivity then yields a necessary and sufficient criterion for exact conversion. The criterion identifies a chirality-sensitive shell $\mathcal C_{\rm chir}$, within which targets with identical pairwise geometry can differ in convertibility solely by the sign of their cubic invariant. This yields an order separation, $k_{\rm detect}=2<3=k_{\rm convert}$, for qubit multistates of every size $n\geqslant3$. The chirality-sensitive shell occupies exactly one third of the singular-value simplex, while mirror reflection obstructs two thirds of the admissible orientation-preserving transformations by volume. For $d\geqslant3$, by contrast, the structure is rigid: every resourceful conversion is realized by either an isotropic depolarizing or a transpose-depolarizing channel. Convertibility is then decided by centered Bargmann invariants of degree at most $d^2$.

quant-ph↗

Entanglement Detection for Two-Qubit and Three-Qubit Pure States via Unitary Transformations and Ancilla State Measurements

Quantum entanglement is the fundamental hallmark of quantum mechanics and a core resource for realizing long-distance quantum communication and scalable linear quantum computing. Accordingly, the precise detection and quantitative quantification of entanglement constitute a foundational and critical problem in quantum information theory. To date, researchers have proposed numerous sufficient conditions for entanglement detection as well as a variety of entanglement measures to characterize the entanglement strength of quantum states; nevertheless, efficient and direct measurement schemes for core entanglement parameters remain underdeveloped. Based on unitary transformations and auxiliary measurements, this paper proposes a set of quantum circuit schemes capable of directly measuring the bipartite concurrence and the tripartite 3-tangle entanglement measure. By introducing auxiliary qubits and constructing specific controlled unitary operations, the proposed scheme maps the analytical expressions of the two entanglement measures onto the measurement probabilities of output states from quantum circuits. It enables efficient and direct quantitative measurement of bipartite and tripartite entanglement without performing full quantum state tomography. This work provides a feasible technical route for the experimental characterization of entanglement properties and lays a groundwork for the practical deployment of multipartite entanglement resources in quantum information processing.

quant-ph↗

Wave-Particle-Mixedness Relationships Based on lp-norm Coherence

We investigate the relationships among the wave property, particle property and mixedness of quantum states based on the lp-norm coherence. By conforming that the lp-norm coherence is an appropriate measure of wave property and introducing a measure of particle property based on the differences between the maximal l2-norm coherence and the general l2-norm coherence, we present tradeoff relationships among the wave, particle and mixedness of quantum states. For 1<= p <2, we establish two kinds of tradeoffs of the wave, particle and mixedness with respect to the upper and lower bounds of the lp-norm coherence given by the l2-norm coherence. These trade relations give rise to compressive understanding of the intrinsic connections among the wave, particle and mixedness of quantum states, and cover some existing results as particular ones.

quant-ph↗

Quantum Circuit Implementation of Two Matrix Product Operations and Elementary Column Transformations

This paper focuses on quantum algorithms for three key matrix operations: Hadamard (Schur) product, Kronecker (tensor) product, and elementary column transformations each. By designing specific unitary transformations and auxiliary quantum measurement, efficient quantum schemes with circuit diagrams are proposed. Their computational depths are: O(1) for Kronecker product; O(max(m,n)) for Hadamard product (linked to matrix dimensions); and O(m) for elementary column transformations of (2^n X 2^m) matrices (dependent only on column count).Notably, compared to traditional column transformation via matrix transposition and row transformations, this scheme reduces computation steps and quantum gate usage, lowering quantum computing energy costs.

quant-ph↗

Quantum Algorithms for Matrix Operations Based on Unitary Transformations and Ancillary State Measurements

MQuantum algorithms of matrix operations are of great significance in many fields in science and technology. In this paper, by leveraging multi-qubit Toffoli gates and basic single-qubit operations, the quantum algorithms of matrix operations of row addition, row swapping, trace calculation and transpose are obtained. In particular, the complexities of these quantum algorithms are presented, too.

quant-ph↗

Basis-independent Coherence and its Applications

In the quantitative theory of quantum coherence, the amount of coherence for given states can be meaningfully discussed only when referring to a preferred basis. One of the objections to this quantification is that the amount of coherence is an intrinsically basis-dependent quantity. This limitation can, however, be lifted when considering a set of quantum states invariant under arbitrary unitary transformations. Thus, we analyze a basis-independent definition of quantum coherence, and the incoherent state is taken as the maximally mixed state. We describe the relationship between the basis-independent and the basis-dependent approaches and give several applications to show the advantages of the former method. The relations among basis-independent coherence, quantum entanglement, and quantum discord are discussed by using the relative entropy within a multipartite system.

quant-ph↗

Concurrence triangle induced genuine multipartite entanglement measure

We study the quantification of genuine multipartite entanglement (GME) for general multipartite states. A set of inequalities satisfied by the entanglement of $N$-partite pure states is derived by exploiting the restrictions on entanglement distributions, showing that the bipartite entanglement between each part and its remaining ones cannot exceed the sum of the other partners with their remaining ones. Then a series of triangles, named concurrence triangles, are established corresponding to these inequalities. Proper genuine multipartite entanglement measures are thus constructed by using the geometric mean area of these concurrence triangles, which are non-increasing under local operation and classical communication. The GME measures classify which parts are separable or entangled with the rest ones for non genuine entangled pure states. The GME measures for mixed states are given via the convex roof construction, and a witness to detect the GME of multipartite mixed states is presented by an approach based on state purifications. Detailed examples are given to illustrate the effectiveness of our GME measures.

quant-ph↗

Quantum coherence in mutually unbiased bases

We investigate the $l_{1}$ norm of coherence of quantum states in mutually unbiased bases. We find that the sum of squared $l_{1}$ norm of coherence of the mixed state single qubit is less than two. We derive the $l_{1}$ norm of coherence of three classes of $X$ states in nontrivial mutually unbiased bases for $4$-dimensional Hilbert space is equal. We proposed "autotensor of mutually unbiased basis(AMUB)" by the tensor of mutually unbiased bases, and depict the level surface of constant the sum of the $l_{1}$ norm of coherence of Bell-diagonal states in AMUB. We find the $l_{1}$ norm of coherence of Werner states and isotropic states in AMUB is equal respectively.

quant-ph↗

Unextendible Maximally Entangled Bases in $\mathbb{C}^{pd}\otimes \mathbb{C}^{qd}$

The construction of unextendible maximally entangled bases is tightly related to quantum information processing like local state discrimination. We put forward two constructions of UMEBs in $\mathbb {C}^{pd}\otimes \mathbb {C}^{qd}$($p\leq q$) based on the constructions of UMEBs in $\mathbb {C}^{d}\otimes \mathbb {C}^{d}$ and in $\mathbb {C}^{p}\otimes \mathbb {C}^{q}$, which generalizes the results in [Phys. Rev. A. 94, 052302 (2016)] by two approaches. Two different 48-member UMEBs in $\mathbb {C}^{6}\otimes \mathbb {C}^{9}$ have been constructed in detail.

quant-ph↗

Constructions of Unextendible Maximally Entangled Bases in \(\mathbb {C}^{d}\otimes \mathbb {C}^{d^{\prime}}\)

We study unextendible maximally entangled bases (UMEBs) in \(\mathbb {C}^{d}\otimes \mathbb {C}^{d^{\prime}}\) ($d<d'$). An operational method to construct UMEBs containing $d(d^{\prime}-1)$ maximally entangled vectors is established, and two UMEBs in \(\mathbb {C}^{5}\otimes \mathbb {C}^{6}\) and \(\mathbb {C}^{5}\otimes \mathbb {C}^{12}\) are given as examples. Furthermore, a systematic way of constructing UMEBs containing $d(d^{\prime}-r)$ maximally entangled vectors in \(\mathbb {C}^{d}\otimes \mathbb {C}^{d^{\prime}}\) is presented for $r=1,2,\cdots, d-1$. Correspondingly, two UMEBs in \(\mathbb {C}^{3}\otimes \mathbb {C}^{10}\) are obtained.

quant-ph↗