Polynomial procedure of avoiding multiqubit errors arising due to qubit-qubit interaction
L. Fedichkin

TL;DR
This paper proposes a polynomially scalable method using intermediate qubits to prevent multiqubit errors caused by qubit-qubit interactions in quantum computers.
Contribution
It introduces a novel polynomial procedure employing additional intermediate qubits to mitigate errors from qubit interactions.
Findings
Requires only polynomial increase in qubits and steps
Effectively reduces multiqubit errors due to qubit interactions
Applicable to quantum computer implementations with unavoidable qubit interactions
Abstract
Recently proposed implementations of quantum computer suffer from unavoidable interaction between quantum bits depending upon data being written in them. Novel procedure of avoiding multiqubit errors arising due to uncontrollable qubit-qubit interaction by using addititonal intermediate qubits is proposed. It is shown that the scheme requires only polynomial increase in number of qubits and algorithmic steps.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum Mechanics and Applications
