Search arXivSearch

arXiv · 2502.03820

Nonlocal characteristics and argand diagram of two-qubit gates

Abstract

Nonlocal characteristics of a two-qubit gate are determined by its nonlocal part. The squared eigenvalues of the nonlocal part of a two-qubit gate exist on the unit circle in the complex plane. We show that two sets of chords, the chords connecting the squared eigenvalues with each other and those connecting a squared eigenvalue with the complex conjugate of others in the unit circle, can be used to describe the nonlocal characteristics of two-qubit gates. Lengths of both sets of chords are proportional to the amount of entanglement contained in certain pure states. The entangling power of a two-qubit gate can be expressed in terms of the squared lengths of the first set of chords. Similarly, we show that the gate typicality of a two-qubit gate can be expressed in terms of the squared lengths of the second set of chords and the linear entropy of a two-qubit gate can be expressed using the squared lengths of both sets of chords. Perfect entanglers are known to transform some product states into maximally entangled states. The convex hull of the squared eigenvalues of the nonlocal part of perfect entanglers contain the zero. We analyse the simplices containing the zero in the convex hull of the squared eigenvalues of the nonlocal part of perfect entanglers to construct a pair of orthonormal product states that can be transformed into maximally entangled states by the nonlocal part of perfect entanglers and divide the region of perfect entanglers in the Weyl chamber into three tetrahedral regions and eight bounding planes based on the uniqueness of the simplices containing the zero.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

M. Karthick Selvan, S. Balakrishnan. 2025-07-07. Nonlocal characteristics and argand diagram of two-qubit gates. https://doi.org/10.1088/1402-4896%2Fae2dd4

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Iteratively decoded magic state distillation

We present numerical simulation results for the 7-to-1 and 15-to-1 state distillation circuits, constructed using transversal CNOTs acting on multiple surface code patches. The distillation circuits are decoded iteratively using the method outlined in [arXiv:2407.20976]. We show that, with a re-configurable qubit architecture, we can perform fast magic state distillation in $\sim\mathcal{O}(1)$ code cycles. We confirm that both circuits suppress an injected input logical error rate $p$ to $\mathcal{O}(p^3)$ in the presence of additional circuit-level noise. This is done with two types of stabiliser proxies, distilling logical $|-\rangle$ and $|Y\rangle$ states, the latter is the intended state of the 7-to-1 circuit while a stabiliser-proxy for the 15-to-1 circuit. We then also provide numerical evidences for actual $|T\rangle$ state distillation using the 15-to-1 circuit with a faulty-$T$ measurement, leveraging recent near-Clifford simulation tools. Finally, we outline how ZX-calculus and Pauli webs can be used to benchmark stabiliser proxies for these distillation circuits.

quant-ph

Enhanced measurements on quantum computers via the simultaneous probing of non-commuting Pauli operators

Measuring the state of quantum computers is a highly non-trivial task, with implications for virtually all quantum algorithms. A promising avenue is multi-copy schemes, where identical copies of a quantum state are measured jointly so that all Pauli operators within the considered observable can be simultaneously assessed. Here, we present a first implementation of such a two-copy scheme in a measurement protocol. Based on Bayesian statistics, it accurately estimates not only the average of the desired observable but also the error en route. This enables an adaptive shot-allocation algorithm that preferentially samples the most uncertain Pauli terms. In regimes with many non-commuting Pauli operators, this ``double'' scheme can outperform the state-of-the-art measurement protocol in minimizing total shots for a given precision. We also numerically confirm the finding in previous theoretical works that the two-copy scheme incurs an overhead due to the square-root relationship between the variance of measured quantities and the number of measurement shots.

quant-ph

Thermodynamics of a phaseonium-driven optomechanical Otto engine

We study an optomechanical Otto engine whose working medium is a single-mode cavity driven by beams of coherently prepared three-level phaseonium atoms. The atoms are not thermal reservoirs in the Gibbs sense; rather, their populations and ground-state coherence set the detailed-balance ratio of the cavity collision map, so that the field relaxes to a Gibbs state at an operational apparent temperature. We combine the finite-time collision-model dynamics with radiation-pressure work extraction and compare three reservoir preparations: a thermal reference at the same apparent temperatures, an incoherent atomic beam with the same populations, and the coherent phaseonium beam. We show that the phaseonium isochore charges the cavity passively: the cavity ergotropy and energy-basis coherence remain zero up to numerical precision, while the state converges to the Gibbs fixed point selected by the apparent detailed balance. We further estimate lower bounds on the cost of preparing the atomic populations and coherence, showing that the relevant advantage of phaseonium is a resource-preparation tradeoff rather than a cost-free enhancement over a thermal bath at the same temperature. Finally, we assess the finite-time performance of a two-cavity cascade with additive mechanical work accounting. Over the investigated coherence-phase range, the cascade produces approximately $47\%$--$52\%$ more power than the single-cavity engine while requiring only $65\%$--$68\%$ of the hot and cold phaseonium atoms needed by two independent engines, resulting in a $9\%$--$15\%$ enhancement of power per injected atom over a complete cycle.

quant-ph