Information in Quantum Description and Gate Implementation

TL;DR

This paper examines Kak's quantum information model, revealing that qubits carry significantly more information than classical bits and highlighting the exponential complexity involved in implementing reliable quantum gates.

Contribution

It introduces a quantum information measure based on Kak's model and analyzes the exponential complexity of quantum gate implementation.

Findings

Qubits carry sqrt(n)/ln(n) times more information than classical bits.

Implementing reliable quantum gates has exponential computational complexity.

Quantum information processing involves exponential resource requirements.

Abstract

This note considers Kak's observer-reference model of quantum information, where it is shown that qubits carry information that is sqrt n / ln n times classical information, where n is the number of components in the measurement system, to analyze information processing in quantum gates. The obverse side of this exponential nature of quantum information is that the computational complexity of implementing unconditionally reliable quantum gates is also exponential.