# Quantum computation and complexity theory

Source: [Quantum computation and complexity theory](<https://www.sota2.com/research/paper/68fa1f527a2b558e29328c4c>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-23T17:56:54.680Z

Authors: K. Svozil

Published: 1994-12-06T10:30:55.000Z

## Abstract

The Hilbert space formalism of quantum mechanics is reviewed with emphasis on applications to quantum computing. Standard interferomeric techniques are used to construct a physical device capable of universal quantum computation. Some consequences for recursion theory and complexity theory are discussed.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/hep-th/9412047>)

[PDF](<https://arxiv.org/pdf/hep-th/9412047.pdf>)