ﻻ يوجد ملخص باللغة العربية
We investigate the single qubit transformations under several typical coherence-free operations, such as, incoherent operation (IO), strictly incoherent operation (SIO), physically incoherent operation (PIO), and coherence preserving operation (CPO). Quantitative connection has been built between IO and SIO in single qubit systems. Moreover, these coherence-free operations have a clear hierarchical relationship in single qubit systems: CPO $subset$ PIO $subset$ SIO=IO. A new and explicit proof for the necessary and sufficient condition of single qubit transformation via IO or SIO has been provided, which indicates that SIO with only two Kraus operators are enough to realize this transformation. The transformation regions of single qubits via CPO and PIO are also given. Our method provides a geometric illustration to analyze single qubit coherence transformations by introducing the Bloch sphere depiction of the transformation regions, and tells us how to construct the corresponding coherence-free operations.
Realizing a long coherence time quantum memory is a major challenge of current quantum technology. Here, we report a single Yb ion-qubit memory with over one hour coherence time, an order of improvement compared to the state-of-the-art record. The lo
We investigate the coherence properties of individual nuclear spin quantum bits in diamond [Dutt et al., Science, 316, 1312 (2007)] when a proximal electronic spin associated with a nitrogen-vacancy (NV) center is being interrogated by optical radiat
Recent experimental work on superconducting transmon qubits in 3D cavities show that their coherence times are increased by an order of magnitude compared to their 2D cavity counterparts. However to take advantage of these coherence times while scali
One of the main problems in any quantum resource theory is the characterization of the
A quantum algorithm is presented for the simulation of arbitrary Markovian dynamics of a qubit, described by a semigroup of single qubit quantum channels ${T_t}$ specified by a generator $mathcal{L}$. This algorithm requires only $mathcal{O}big((||ma