Fast graph operations in quantum computation
- Submitting institution
-
The University of Kent
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 9323
- Type
- D - Journal article
- DOI
-
10.1103/PhysRevA.93.032314
- Title of journal
- Physical Review A
- Article number
- 032314
- First page
- -
- Volume
- 93
- Issue
- 3
- ISSN
- 2469-9926
- Open access status
- Out of scope for open access requirements
- Month of publication
- March
- Year of publication
- 2016
- URL
-
https://kar.kent.ac.uk/58072/
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
2
- Research group(s)
-
-
- Citation count
- 6
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper is significant because it presents a novel quantum data structure for undirected graphs, representing data in an intrinsically quantum way which has no classical analogue. Previous results consist of a quantum algorithm acting on essentially (superpositions) of classical data. We prove that, for certain problems, our data structure outperforms not only all known classical data structures, but all possible ones as well. The paper was highlighted as an Editor's Choice in Physical Review A.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -
