Quantum computing with mixed states

TL;DR

This paper explores a quantum computing model using initially mixed states, proposing a new implementation method that could solve certain problems more efficiently than classical algorithms, despite being less powerful than pure-state quantum computers.

Contribution

It introduces a novel implementation approach for quantum computation with mixed states using optimal basis-independent transformations.

Findings

Potential to solve specific problems more efficiently than classical algorithms

New implementation method for mixed-state quantum computing

Highlights limitations compared to pure-state quantum computers

Abstract

We discuss a model for quantum computing with initially mixed states. Although such a computer is known to be less powerful than a quantum computer operating with pure (entangled) states, it may efficiently solve some problems for which no efficient classical algorithms are known. We suggest a new implementation of quantum computation with initially mixed states in which an algorithm realization is achieved by means of optimal basis independent transformations of qubits.