Related papers: Pauli Cloners for Pauli Channels
We develop a systematic method of performing corrected gate operations on an array of exchange-coupled singlet-triplet qubits in the presence of both fluctuating nuclear Overhauser field gradients and charge noise. The single-qubit control…
The commutation relations of the generalized Pauli operators of a qubit-qutrit system are discussed in the newly established graph-theoretic and finite-geometrical settings. The dual of the Pauli graph of this system is found to be…
We propose a quantum cloning machine, which clones a qubit into two clones assuming known modulus of expectation value of Pauli Z-matrix. The process is referred to as the mirror phase-covariant cloning, for which the input state is a…
Stabilizer simulation of Clifford quantum circuits - error-correction circuits, Clifford subroutines, etc. - on classical computers has played a central role in our understanding of circuit performance. The stabilizer description, however,…
We derive a tight upper bound for the fidelity of a universal N to M qubit cloner, valid for any M \geq N, where the output of the cloner is required to be supported on the symmetric subspace. Our proof is based on the concatenation of two…
As quantum circuits become more integrated and complex, additional error sources that were previously insignificant start to emerge. Consequently, the fidelity of quantum gates benchmarked under pristine conditions falls short of predicting…
An average gate fidelity is a standard performance metric to quantify deviation between an ideal unitary gate transformation and its realistic experimental implementation. The average is taken with respect to states uniformly distributed…
The future of quantum repeater networking will require interoperability between various error correcting codes. A few specific code conversions and even a generalized method are known, however, no detailed analysis of these techniques in…
A quantum channel models the interaction between the system we are interested in and its environment. Such a model can capture the main features of the interaction but because of the complexity of the environment we can not assume that it…
We investigate the optimal distribution of quantum information over multipartite systems in asymmetric settings. We introduce cloning transformations that take $N$ identical replicas of a pure state in any dimension as input, and yield a…
A quantum circuit is generalized to a nonunitary one whose constituents are nonunitary gates operated by quantum measurement. It is shown that a specific type of one-qubit nonunitary gates, the controlled-NOT gate, as well as all one-qubit…
Random (mixed) unitary channels describe an important subset of quantum channels, which are commonly used in quantum information, noise modeling, and quantum error mitigation. Despite their usefulness, there is substantial complexity in…
Many applications of practical interest rely on time evolution of Hamiltonians that are given by a sum of Pauli operators. Quantum circuits for exact time evolution of single Pauli operators are well known, and can be extended trivially to…
We develop a family of quantum accreditation protocols for quantum circuits with non-Clifford two-qubit gates. The latter includes families of gates such as the fSim and XY families of gates, native to existing hardwares. We provide…
In this paper, we derive optimized measurement-free protocols for quantum error correction and the implementation of a universal gate set optimized for an error model that is noise biased . The noise bias is adapted for neutral atom…
Any architecture for practical quantum computing must be scalable. An attractive approach is to create multiple cores, computing regions of fixed size that are well-spaced but interlinked with communication channels. This exploded…
We introduce a general framework for weak transversal gates -- probabilistic implementation of logical unitaries realized by local physical unitaries -- and propose a novel partially fault-tolerant quantum computing architecture that…
We show that encrypted cloning of unknown quantum states is possible. Any number of encrypted clones of a qubit can be created through a unitary transformation, and each of the encrypted clones can be decrypted through a unitary…
A key task in quantum computation is the application of a sequence of gates implementing a specific unitary operation. However, the decomposition of an arbitrary unitary operation into simpler quantum gates is a nontrivial problem. Here we…
Quantum error correction is instrumental in protecting quantum systems from noise in quantum computing and communication settings. Pauli channels can be efficiently simulated and threshold values for Pauli error rates under a variety of…