| Budget Amount *help |
¥43,290,000 (Direct Cost: ¥33,300,000、Indirect Cost: ¥9,990,000)
Fiscal Year 2019: ¥5,980,000 (Direct Cost: ¥4,600,000、Indirect Cost: ¥1,380,000)
Fiscal Year 2018: ¥7,670,000 (Direct Cost: ¥5,900,000、Indirect Cost: ¥1,770,000)
Fiscal Year 2017: ¥8,710,000 (Direct Cost: ¥6,700,000、Indirect Cost: ¥2,010,000)
Fiscal Year 2016: ¥10,530,000 (Direct Cost: ¥8,100,000、Indirect Cost: ¥2,430,000)
Fiscal Year 2015: ¥10,400,000 (Direct Cost: ¥8,000,000、Indirect Cost: ¥2,400,000)
|
|---|
| Outline of Final Research Achievements |
This research performed theoretical and experimental verification on quantum advantege on polyhedral aspect of quantum nonlocality and analyze quantum optimization with applications to quantum circuit design. Based on the relationship between the generalized Bell inequality and the cut polyhedron, the scalable inequality for the quantum graph state was tested on real approximate quantum computer to verify the quantum violation. We analyzed a classical-quantum approximation optimization method that approximates the maximal cut problem, which gave a direct polynomial order of the polyhedron of a lower-truncated transverse matroid. Using an expander graph and graph minor theory, the quantum superiority in the quantum graph state was theoretically shown.
Using an optimization method, we were able to show a truly quantum-optimized quantum circuit that goes beyond the scope of classical logic to minimize the number of T-gates, which is indispensable for error-resistant quantum circuits.
|
