Journal article
Comparison of quantum oracles
- Abstract:
- A comparison of the query complexity analysis of quantum algorithms was presented. Two different ways of representing a permutation in terms of a black box quantum oracle were provided. A simple promise problem that minimal quantum oracles could solve faster that the classical oracles was discussed. Results showed that the possibility of efficiently solving nonautomorphic graph isomorphism (NAGI) could be excluded by simulating a simpler oracle using standard oracle for a one-to-one function.
- Publication status:
- Published
Actions
Access Document
- Publisher copy:
- 10.1103/PhysRevA.65.050304
Authors
- Journal:
- PHYSICAL REVIEW A More from this journal
- Volume:
- 65
- Issue:
- 5
- Pages:
- 503041-503044
- Publication date:
- 2002-05-01
- DOI:
- EISSN:
-
1094-1622
- ISSN:
-
1050-2947
- Language:
-
English
- Pubs id:
-
pubs:156543
- UUID:
-
uuid:0cba8198-0df3-4f3e-897b-f8ad446b09a7
- Local pid:
-
pubs:156543
- Source identifiers:
-
156543
- Deposit date:
-
2012-12-19
- ARK identifier:
Terms of use
- Copyright date:
- 2002
If you are the owner of this record, you can report an update to it here: Report update to this record