# Quantum Computer Can Not Speed Up Iterated Applications of a Black Box

@inproceedings{Ozhigov1998QuantumCC, title={Quantum Computer Can Not Speed Up Iterated Applications of a Black Box}, author={Yuri Ozhigov}, booktitle={QCQC}, year={1998} }

Let a classical algorithm be determined by sequential applications of a black box performing one step of this algorithm. If we consider this black box as an oracle which gives a value f(a) for a query a, we can compute T sequential applications of f on a classical computer relative to this oracle in time T.
It is proved that if T = O(2n/7), where n is the length of input, then the result of T sequential applications of f can not be computed on quantum computer with oracle for f for all… CONTINUE READING

#### Topics from this paper.

#### Citations

##### Publications citing this paper.

SHOWING 1-10 OF 24 CITATIONS

## Quantum lower bounds by polynomials

VIEW 2 EXCERPTS

CITES RESULTS

## Quantum lower bounds by polynomials

VIEW 1 EXCERPT

CITES RESULTS

## Quantum lower bound for inverting a permutation with advice

VIEW 2 EXCERPTS

CITES RESULTS

## Quantum Computation

VIEW 1 EXCERPT

CITES BACKGROUND

## Quantum computers and quantum coherence

VIEW 1 EXCERPT

CITES BACKGROUND

## Investigations in quantum computing: causality and graph isomorphism

VIEW 1 EXCERPT

CITES BACKGROUND

### FILTER CITATIONS BY YEAR

### CITATION STATISTICS

**1**Highly Influenced Citations

#### References

##### Publications referenced by this paper.

SHOWING 1-8 OF 8 REFERENCES