Measure of decoherence in quantum error correction for solid-state quantum computing

We considered the interaction of semiconductor quantum register with noisy environment leading to various types of qubit errors. We analysed both phase and amplitude decays during the process of electron-phonon interaction. The performance of quantum error correction codes (QECC) which will be inevitably used in full scale quantum information processors was studied in realistic conditions in semiconductor nanostructures. As a hardware basis for quantum bit we chose the quantum spatial states of single electron in semiconductor coupled double quantum dot system. The modified 5- and 9-qubit quantum error correction (QEC) algorithms by Shor and DiVincenzo without error syndrome extraction were applied to quantum register. 5-qubit error correction procedures were implemented for Si charge double dot qubits in the presence of acoustic phonon environment. Chi-matrix, Choi-Jamiolkowski state and measure of decoherence techniques were used to quantify qubit fault-tolerance. Our results showed that the introduction of above quantum error correction techniques at small phonon noise levels provided quadratic improvement of output error rates. The efficiency of 5-qubits quantum error correction algorithm in semiconductor quantum information processors was demonstrated

Quantum walk processes in quantum devices

The quantum walk process represents a basic subroutine in many quantum algorithms and plays an important role in studying physical phenomena. Quantum particles, photons and electrons, are naturally suited for simulating quantum walks in systems of photonic waveguides and quantum dots. With an increasing improvement in qubits fidelity and qubits number in a single register, there is also potential to substantially improve quantum walks simulations. However, efficient ways to simulate quantum walks in qubit registers still has to be explored. Here different possibilities to efficiently implement quantum walks on IBM Q devices are studied. A mapping from a graph space to quantum register space is provided, and simulations on IBM Q quantum computer are performed. Implemented quantum walks are compared against classically simulated solutions. With this work we examine quantum walks paradigm for IBM Q computer which may exhibit quantum advantage for the algorithms incorporating random walk. Provided solution to quantum walk simulation opens a route to applied quantum algorithms based on quantum walks.Comment: 8 pages, 3 figures, 1 tabl