| IEICE Technical Committee Submission System Conference Paper's Information |
Online Proceedings [Sign in] Tech. Rep. Archives |
| Go Top Page | Go Previous | [Japanese] / [English] |
| Paper Abstract and Keywords | ||
| Presentation | 2019-10-25 16:35 Fine-grained quantum supremacy based on Orthogonal Vectors, 3-SUM and All-Pairs Shortest Paths Ryu Hayakawa, Tomoyuki Morimae (YITP, Kyoto Univ.), Suguru Tamaki (School of Social Information Science, Univ. of Hyogo)  COMP2019-28 |
|
| Abstract | (in Japanese) | (See Japanese page) |
| (in English) | Fine-grained quantum supremacy is a study of excluding possibilities of superpolynomial time classical simulations of quantum computing. We show that under conjectures on Orthogonal Vectors (OV), 3-SUM, All-Pairs Shortest Paths (APSP) and their variants, strong and weak classical simulations of quantum computing are impossible in certain exponential time of the number of qubits. Those conjectures are widely used in classical fine-grained complexity theory in which polynomial time hardnesses are conjectured. All previous results of fine-grained quantum supremacy are based on ETH, SETH, or their variants that are conjectures for SAT in which exponential time hardnesses are conjectured. We show that there exist quantum circuits which cannot be classically simulated in certain exponential time of the number of qubits first by considering the Quantum Random Access Memory (QRAM) based quantum computing model and next by considering the non-QRAM model quantum computation. In the case of the QRAM model, the size of quantum computing is linear in the number of qubits and in the case of the non-QRAM model, the size of the circuit is exponential in the number of qubits but the results are even non-trivial. We only give the proofs for the Theorems on OV on this paper due to the space limitations. |
|
| Keyword | (in Japanese) | (See Japanese page) |
| (in English) | fine-grained complexity / quantum computation / quantum supremacy / / / / / | |
| Reference Info. | IEICE Tech. Rep., vol. 119, no. 249, COMP2019-28, pp. 71-78, Oct. 2019. | |
| Paper # | COMP2019-28 | |
| Date of Issue | 2019-10-18 (COMP) | |
| ISSN | Online edition: ISSN 2432-6380 | |
| Copyright and reproduction |
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) | |
| Download PDF | COMP2019-28 |
|
| Conference Information | |
| Committee | COMP |
| Conference Date | 2019-10-25 - 2019-10-25 |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | Sapporo Campus, Hokkaido University |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Paper Information | |
| Registration To | COMP |
| Conference Code | 2019-10-COMP |
| Language | Japanese |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Fine-grained quantum supremacy based on Orthogonal Vectors, 3-SUM and All-Pairs Shortest Paths |
| Sub Title (in English) | |
| Keyword(1) | fine-grained complexity |
| Keyword(2) | quantum computation |
| Keyword(3) | quantum supremacy |
| Keyword(4) | |
| Keyword(5) | |
| Keyword(6) | |
| Keyword(7) | |
| Keyword(8) | |
| 1st Author's Name | Ryu Hayakawa |
| 1st Author's Affiliation | Yukawa Institute for Theoretical Physics, Kyoto University (YITP, Kyoto Univ.) |
| 2nd Author's Name | Tomoyuki Morimae |
| 2nd Author's Affiliation | Yukawa Institute for Theoretical Physics, Kyoto University (YITP, Kyoto Univ.) |
| 3rd Author's Name | Suguru Tamaki |
| 3rd Author's Affiliation | School of Social Information Science, University of Hyogo (School of Social Information Science, Univ. of Hyogo) |
| 4th Author's Name | |
| 4th Author's Affiliation | () |
| 5th Author's Name | |
| 5th Author's Affiliation | () |
| 6th Author's Name | |
| 6th Author's Affiliation | () |
| 7th Author's Name | |
| 7th Author's Affiliation | () |
| 8th Author's Name | |
| 8th Author's Affiliation | () |
| 9th Author's Name | |
| 9th Author's Affiliation | () |
| 10th Author's Name | |
| 10th Author's Affiliation | () |
| 11th Author's Name | |
| 11th Author's Affiliation | () |
| 12th Author's Name | |
| 12th Author's Affiliation | () |
| 13th Author's Name | |
| 13th Author's Affiliation | () |
| 14th Author's Name | |
| 14th Author's Affiliation | () |
| 15th Author's Name | |
| 15th Author's Affiliation | () |
| 16th Author's Name | |
| 16th Author's Affiliation | () |
| 17th Author's Name | |
| 17th Author's Affiliation | () |
| 18th Author's Name | |
| 18th Author's Affiliation | () |
| Speaker | Author-1 |
| Date Time | 2019-10-25 16:35:00 |
| Presentation Time | 25 minutes |
| Registration for | COMP |
| Paper # | COMP2019-28 |
| Volume (vol) | vol.119 |
| Number (no) | no.249 |
| Page | pp.71-78 |
| #Pages | 8 |
| Date of Issue | 2019-10-18 (COMP) |
[Return to Top Page]