Author:
Zaiou Ahmed,Bennani Younès,Hibti Mohamed,Matei Basarab
Publisher
Springer International Publishing
Reference29 articles.
1. Ambainis, A.: Quantum walk algorithm for element distinctness. SIAM J. Comput. 37(1), 210–239 (2007)
2. Apers, S., Lee, T.: Quantum complexity of minimum cut. arXiv preprint arXiv:2011.09823 (2020)
3. Ashcraft, C., Liu, J.W.H.: A partition improvement algorithm for generalized nested dissection. Boeing Computer Services, Seattle, WA, Technical report, BCSTECH-94-020 (1994)
4. Bui, T.N., Jones, C.: Finding good approximate vertex and edge partitions is NP-hard. Inf. Process. Lett. 42(3), 153–159 (1992)
5. Cui, S.X., Freedman, M.H., Sattath, O., Stong, R., Minton, G.: Quantum max-flow/min-cut. J. Math. Phys. 57(6), 062206 (2016)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Max-flow min-cut theorem in quantum computing;Physica A: Statistical Mechanics and its Applications;2024-09