Arbitrary Single-qubit Research Articles

Polylogarithmic-depth controlled-NOT gates without ancilla qubits

Controlled operations are fundamental building blocks of quantum algorithms. Decomposing n-control-NOT gates (Cn(X)) into arbitrary single-qubit and CNOT gates, is a crucial but non-trivial task. This study introduces Cn(X) circuits outperforming previous methods in the asymptotic and non-asymptotic regimes. Three distinct decompositions are presented: an exact one using one borrowed ancilla with a circuit depth Θ(log(n)3)\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\Theta (\\log {(n)}^{3})$$\\end{document}, an approximating one without ancilla qubits with a circuit depth O(log(n)3log(1/ϵ))\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$${{{{{{{\\mathcal{O}}}}}}}}(\\log {(n)}^{3}\\log (1/\\epsilon ))$$\\end{document} and an exact one with an adjustable-depth circuit which decreases with the number m≤n of ancilla qubits available as O(log(n/⌊m/2⌋)3+log(⌊m/2⌋))\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$${{{{{{{\\mathcal{O}}}}}}}}(\\log {(n/\\lfloor m/2\\rfloor )}^{3}+\\log (\\lfloor m/2\\rfloor ))$$\\end{document}. The resulting exponential speedup is likely to have a substantial impact on fault-tolerant quantum computing by improving the complexities of countless quantum algorithms with applications ranging from quantum chemistry to physics, finance and quantum machine learning.

Quantum state transfer on 2D lattices: A low-energy effective Hamiltonian approach

We investigate the transfer of arbitrary single qubit states through a rectangular 2D lattice hosting the isotropic Heisenberg model under a magnetic field along the z direction, where the spin-spin interaction strengths along the vertical sublattices, referred to as rungs, are much stronger than the interactions along other sublattices. Using the rung-rung interaction as perturbation, the model can be mapped to an effective 1D model, and the transfer of low-energy rung states from one rung to another can be represented by a transfer of an arbitrary single-qubit state from one lattice site to another on the 1D effective lattice defined by the effective 1D Hamiltonian. Exploiting this, we propose protocols for transferring arbitrary single-qubit states from one lattice site to another by using specific encoding (decoding) of the single-qubit state into (from) the rung states. We demonstrate that this protocol leads to a quantum advantage in the single-qubit state transfer.

Asymmetric bidirectional quantum qubit teleportation scheme via six-qubit Bell-cluster state

Using a six-qubit Bell-cluster state, we proposed an asymmetric bidirectional quantum teleportation scheme. Two participants Anne and Benson are both the sender and receiver. Only applying Bell-state measurement, single- and two-qubit unitary operations as well as classical communication, Anne can transmit an arbitrary two-qubit unknown state to Benson, meanwhile Benson can also send an arbitrary single-qubit unknown state to Anne. Analysis shows that our scheme is feasible with the present experiment technologies.

Correlated Effects of Pauli Noise on Controlled Teleportation of an Arbitrary Single-Qubit State Via a Three-Qubit W State

Correlated Effects of Pauli Noise on Controlled Teleportation of an Arbitrary Single-Qubit State Via a Three-Qubit W State

Concealed Quantum Telecomputation for Anonymous 6G URLLC Networks

Distributed learning and multi-tier computing are the key ingredients to ensure ultra-reliable and low-latency communication (URLLC) in 6G networks. The distinct transition from connected things in 5G URLLC networks to connected intelligence in 6G URLLC networks requires ultra-secure communication due to the massive amount of private data. However, it is a challenging task to ensure stringent 6G URLLC requirements along with user privacy and data security in distributed networks. In this paper, we devise a distributed quantum computation protocol to perform a nonlocal controlled unitary operation on a bipartite input state in concealed and counterfactual manner and integrate it with anonymous quantum communication networks. This distributed protocol allows Bob to apply an arbitrary single-qubit unitary operator on Alice’s qubit in a controlled and probabilistic fashion, without revealing the operator to her and without transmitting any physical particle over the quantum channel—called the counterfactual concealed telecomputation (CCT). It is shown that the CCT protocol neither requires the preshared entanglement nor depends on the bipartite input state and that the single-qubit unitary teleportation is a special case of CCT. The quantum circuit for CCT can be implemented using the (chained) quantum Zeno gates. The protocol becomes deterministic with simplified circuit implementation if the initial composite state of Alice and Bob is a Bell-type state. Furthermore, we provide numerical examples of quantum anonymous broadcast networks using the CCT protocol and show their degrees of anonymity in the presence of malicious users.

Efficient variational synthesis of quantum circuits with coherent multi-start optimization

We consider the problem of the variational quantum circuit synthesis into a gate set consisting of the CNOT gate and arbitrary single-qubit (1q) gates with the primary target being the minimization of the CNOT count. First we note that along with the discrete architecture search suffering from the combinatorial explosion of complexity, optimization over 1q gates can also be a crucial roadblock due to the omnipresence of local minimums (well known in the context of variational quantum algorithms but apparently underappreciated in the context of the variational compiling). Taking the issue seriously, we make an extensive search over the initial conditions an essential part of our approach. Another key idea we propose is to use parametrized two-qubit (2q) controlled phase gates, which can interpolate between the identity gate and the CNOT gate, and allow a continuous relaxation of the discrete architecture search, which can be executed jointly with the optimization over 1q gates. This coherent optimization of the architecture together with 1q gates appears to work surprisingly well in practice, sometimes even outperforming optimization over 1q gates alone (for fixed optimal architectures). As illustrative examples and applications we derive 8 CNOT and T depth 3 decomposition of the 3q Toffoli gate on the nearest-neighbor topology, rediscover known best decompositions of the 4q Toffoli gate on all 4q topologies including a 1 CNOT gate improvement on the star-shaped topology, and propose decomposition of the 5q Toffoli gate on the nearest-neighbor topology with 48 CNOT gates. We also benchmark the performance of our approach on a number of 5q quantum circuits from the ibm_qx_mapping database showing that it is highly competitive with the existing software. The algorithm developed in this work is available as a Python package CPFlow.

Decoherence-suppressed nonadiabatic holonomic quantum computation

Nonadiabatic holonomic quantum computation (NHQC) provides an essential way to construct robust and high-fidelity quantum gates due to its geometric features. However, NHQC is more sensitive to decay and dephasing errors than a conventional dynamical gate since it requires an ancillary intermediate state. Here, we utilize the Hamiltonian reverse engineering technique to study the influence of intermediate-state decoherence on NHQC gate fidelity, and propose schemes to construct an arbitrary single-qubit holonomic gate and nontrivial two-qubit holonomic gate with high fidelity and robustness to the decoherence. Although the proposed method is generic and can be applied to many experimental platforms, such as superconducting qubits, trapped ions, and quantum dots, here we take a nitrogen-vacancy center as an example to show that the gate fidelity can be significantly enhanced from 89% to 99.6% in contrast to recent experimental NHQC schemes [Phys. Rev. Lett. 119, 140503 (2017); Nat. Photonics 11, 309 (2017); Opt. Lett. 43, 2380 (2018)], and the robustness against decoherence can also be significantly improved. All in all, our scheme provides a promising way for fault-tolerant geometric quantum computation.

Error Propagation in NISQ Devices for Solving Classical Optimization Problems

We propose a random circuit model to analyze the impact of noise on the performance of variational quantum circuits for classical optimization problems. Our model accounts for the propagation of arbitrary single qubit errors through the circuit. We find that even with a small noise rate, the quality of the obtained classical optima is low on average and a single-qubit error rate of $1 / nD$, where $n$ is the number of qubits and $D$ is the circuit depth, is needed for the possibility of a quantum advantage. We estimate that this translates to an error rate lower than $10^{-6}$ using QAOA for classical optimization problems with 2D circuits.

Topological order and entanglement dynamics in the measurement-only XZZX quantum code

We examine the dynamics of a $(1+1)$-dimensional measurement-only circuit defined by the stabilizers of the [[5,1,3]] quantum error correcting code interrupted by single-qubit Pauli measurements. The code corrects arbitrary single-qubit errors and it stabilizes an area law entangled state with a ${D}_{2}={\mathbb{Z}}_{2}\ifmmode\times\else\texttimes\fi{}{\mathbb{Z}}_{2}$ symmetry protected topological (SPT) order, as well as a symmetry breaking (SB) order from a twofold bulk degeneracy. The Pauli measurements break the topological order and induce a phase transition into a trivial area law phase. Allowing more than one type of Pauli measurement increases the measurement-induced frustration and the SPT and SB order can be broken either simultaneously or separately at nonzero measurement rate. This yields a rich phase diagram and unanticipated critical behavior at the phase transitions. Although the correlation length exponent $\ensuremath{\nu}=\frac{4}{3}$ and the dynamical critical exponent $z=1$ are consistent with bond percolation, the prefactor of the logarithmic entanglement growth may take noninteger multiples of the percolation value. Remarkably, we identify a robust transient scaling regime for the purification dynamics of $L$ qubits. It reveals a modified dynamical critical exponent ${z}^{*}\ensuremath{\ne}z$, which is observable up to times $t\ensuremath{\sim}{L}^{{z}^{*}}$ and is reminiscent of the relaxation of critical systems into a prethermal state.

Fast evolution of single qubit gate in non-adiabatic geometric quantum computing

We implemented arbitrarythe arbitrary single qubit gates of geometric quantum computing for a three-level system in a single-shot manner. The evolution time of the gate has been minimized by considering the shortest trajectory of the state on the Bloch sphere. The duration of gates grows from zero with the rotation angle γ, and the tested T gate time can be reduced to ∼40% of those in the traditional orange-sliced-shaped path non-adiabatic holonomic quantum computing (NHQC) scheme by the parametrization of Rabi frequency. We also demonstrated that certain pulses are robust against static detuning errors and Rabi errors. The time-dependent detuning and Rabi frequency are found to be proportional to each other by a constant which is determined by the geometric phase. In this way, some previous NHQC schemes can be treated as special cases in our generalized model.

Asymmetric cyclic controlled quantum teleportation by using a quantum channel composed of six G states

In the existing research on cyclic teleportation protocols, it is generally discussed that the teleportation of single particle, two particle unknown quantum states with symmetrical structure or asymmetric special unknown quantum states (such as GHZ state) with three or four participants. In contrast, the scheme proposed in this paper has universality and stronger practicability. In this paper, we propose a novel scheme of asymmetric cyclic controlled teleportation. In our scheme, Alice can teleport an arbitrary single-qubit entangled state to Charlie, Charlie can teleport an arbitrary three-qubit entangled state to Bob and at the same time Bob can teleport an arbitrary two-qubit entangled state to Alice under the control of a controller David. It only needs Bell measurement and local unitary operation, and can realize three-party cyclic transmission with probability 1 by using a quantum channel composed of any six of the 16 G states.

Geometric graph-theoretic aspects of quantum stabilizer codes

We propose a systematic procedure for the construction of graphs associated with binary quantum stabilizer codes. The procedure is characterized by means of the following three step process. First, the stabilizer code is realized as a codeword-stabilized (CWS) quantum code. Second, the canonical form of the CWS code is determined and third, the input vertices are attached to the graphs. In order to verify the effectiveness of the procedure, we implement the Gottesman stabilizer code characterized by multi-qubit encoding operators for the resource-efficient error correction of arbitrary single-qubit errors. Finally, the error-correcting capabilities of the Gottesman eight-qubit quantum stabilizer code is verified in graph-theoretic terms as originally advocated by Schlingemann and Werner.

An Optimized Bidirectional Quantum Teleportation Scheme with the Use of Bell States

Bidirectional quantum teleportation scheme is a two-way quantum communication process, in which two parties simultaneously receive each other information. Recently, in paper [1] (Zhou et al., IEEE Access, 7, 44269 (2019)), a six-qubit cluster state has been used to teleport three-qubit entangled state (Alice) and arbitrary single-qubit unknown quantum state (Bob) bidirectionally. An experimental point of view, the preparation and the maintenance of cluster type entangled state is very difficult and costly. So, in this paper we have designed an optimal scheme for bidirectional quantum teleportation scheme and shown that proposed scheme requires optimized amount of quantum resources.

Universal-dephasing-noise injection via Schrödinger-wave autoregressive moving-average models

We present and validate a novel method for noise injection of arbitrary spectra in quantum circuits that can be applied to any system capable of executing arbitrary single qubit rotations, including cloud-based quantum processors. As the consequences of temporally-correlated noise on the performance of quantum algorithms are not well understood, the capability to engineer and inject such noise in quantum systems is paramount. To date, noise injection capabilities have been limited and highly platform specific, requiring low-level access to control hardware. We experimentally validate our universal method by comparing to a direct hardware-based noise-injection scheme, using a combination of quantum noise spectroscopy and classical signal analysis to show that the two approaches agree. These results showcase a highly versatile method for noise injection that can be utilized by theoretical and experimental researchers to verify, evaluate, and improve quantum characterization protocols and quantum algorithms for sensing and computing.

Quantum private comparison of arbitrary single qubit states based on swap test

By using swap test, a quantum private comparison (QPC) protocol of arbitrary single qubit states with a semi-honest third party is proposed. The semi-honest third party (TP) is required to help two participants perform the comparison. She can record intermediate results and do some calculations in the whole process of the protocol execution, but she cannot conspire with any of participants. In the process of comparison, the TP cannot get two participants’ private information except the comparison results. According to the security analysis, the proposed protocol can resist both outsider attacks and participants’ attacks. Compared with the existing QPC protocols, the proposed one does not require any entanglementswapping technology, but it can compare two participants’ qubits by performing swap test, which is easier to implement with current technology. Meanwhile, the proposed protocol can compare secret integers. It encodes secret integers into the amplitude of quantum state rather than transfer them as binary representations, and the encoded quantum state is compared by performing the swap test. Additionally, the proposed QPC protocol is extended to the QPC of arbitrary single qubit states by using multi-qubit swap test.

Probabilistic hierarchically controlled teleportation of anarbitrary <italic>m</italic>-qudit state with a pure entangledquantum channel

<p indent=0mm>Quantum teleportation is a unique quantum information processing method in quantum communication. Researchers have shown considerable interest in hierarchically controlled teleportation by using quantum entangled states as the quantum channel. Protocols for the hierarchically controlled teleportation of an arbitrary single-qubit via a four-qubit χ state and a four-qubit cluster state have been proposed. We present a protocol for the hierarchically controlled teleportation of an arbitrary <italic>m</italic>-qudit (<italic>d</italic>-dimensional quantum system) state by using a partially entangled quantum state as the quantum channel. The sender performs <italic>m</italic> generalized Bell-state measurements on her <sc>2<italic>m</italic></sc> particles. To reconstruct the original state, the upper-grade receiver only needs to apply a unitary operation in accordance with one of the receivers’ measurement results, and the lower-grade receivers need to perform a unitary operation according to all the other receivers’ measurement results. The receivers can reconstruct the original state probabilistically by introducing an auxiliary qubit and performing a collective unitary transformation. The protocol has the advantage of having high channel capacity by using a high-dimensional entangled state as the quantum channel.

Optical control protocols for high-fidelity spin rotations of single SiV− and SnV− centers in diamond

Silicon-vacancy and tin-vacancy defects in diamond are of interest as alternative qubits to the NV center due to their superior optical properties. While the availability of optical transitions in these defects is one of their assets, high-fidelity optical coherent control has not been demonstrated. Here, we design novel optical control schemes tailored to these defects. We evaluate the performance of arbitrary single-qubit rotations of the electron spin qubit both in the absence and presence of an external magnetic field, by taking into account both coherent and incoherent errors. We find that rotations in excess of $98.0\%$ ($T=4$~K) and $99.71\%$ ($T=6$~K) can be achieved for Si-V and Sn-V respectively in the presence of realistic relaxation and leakage errors.

Deterministic Multi-hop Teleportation of Arbitrary Single Qubit State via Partially Entangled GHZ-type State

Deterministic Multi-hop Teleportation of Arbitrary Single Qubit State via Partially Entangled GHZ-type State

Hierarchical Quantum Teleportation of Arbitrary Single-Qubit State by Using Four-Qubit Cluster State

Hierarchical Quantum Teleportation of Arbitrary Single-Qubit State by Using Four-Qubit Cluster State

Adiabatic quantum state transfer in a semiconductor quantum-dot spin chain

Semiconductor quantum-dot spin qubits are a promising platform for quantum computation, because they are scalable and possess long coherence times. In order to realize this full potential, however, high-fidelity information transfer mechanisms are required for quantum error correction and efficient algorithms. Here, we present evidence of adiabatic quantum-state transfer in a chain of semiconductor quantum-dot electron spins. By adiabatically modifying exchange couplings, we transfer single- and two-spin states between distant electrons in less than 127 ns. We also show that this method can be cascaded for spin-state transfer in long spin chains. Based on simulations, we estimate that the probability to correctly transfer single-spin eigenstates and two-spin singlet states can exceed 0.95 for the experimental parameters studied here. In the future, state and process tomography will be required to verify the transfer of arbitrary single qubit states with a fidelity exceeding the classical bound. Adiabatic quantum-state transfer is robust to noise and pulse-timing errors. This method will be useful for initialization, state distribution, and readout in large spin-qubit arrays for gate-based quantum computing. It also opens up the possibility of universal adiabatic quantum computing in semiconductor quantum-dot spin qubits.