Quantum hyperparallel algorithm for matrix multiplication
Hyperentangled states, entangled states with more than one degree of freedom, are considered as promising resource in quantum computation. Here we present a hyperparallel quantum algorithm for matrix multiplication with time complexity O(N2), which is better than the best known classical algorithm....
| Main Authors: | , , |
|---|---|
| Format: | Online |
| Language: | English |
| Published: |
Nature Publishing Group
2016
|
| Online Access: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4850379/ |