Fetching the paper…
Reading the bibliography…
We present a unified quantum-classical framework for addressing NP-complete constrained combinatorial optimisation problems, generalising the recently proposed Quantum Conic Programming (QCP) approach.
1908
Earlier work this paper cites.
R. E. Tarjan and A. E. Trojanowski, “Finding a Maximum Independent Set,” SIAM J. Comput. , vol. 6, no. 3, pp. 537–546, 1977. [Online]. Available: https://doi.org/10.1137/0206038
1977
Earlier work this paper cites.
T. Kato, Perturbation Theory for Linear Operators . Berlin, Heidelberg: Springer, 1995. [Online]. Available: https://doi.org/10.1007/978-3-642-66282-9
1995
Earlier work this paper cites.
L. K. Grover, “Quantum Mechanics Helps in Searching for a Needle in a Haystack,” Phys. Rev. Lett. , vol. 79, no. 2, pp. 325–328, 1997. [Online]. Available: https://doi.org/10.1103/physrevlett.79.325
1997
Earlier work this paper cites.
T. Kadowaki and H. Nishimori, “Quantum annealing in the transverse Ising model,” Phys. Rev. , vol. 58, no. 5, pp. 5355–5363, 1998. [Online]. Available: https://doi.org/10.1103/physreve.58.5355
1998
Earlier work this paper cites.
H. E. Brandt, “Qubit devices and the issue of quantum decoherence,” Prog. Quantum Electronics , vol. 22, no. 5-6, pp. 257–370, 1999. [Online]. Available: https://doi.org/10.1016/s0079-6727(99)00003-8
1999
Earlier work this paper cites.
E. Farhi, J. Goldstone, S. Gutmann, and M. Sipser, “Quantum Computation by Adiabatic Evolution,” 2000, [arXiv preprint arXiv:quant-ph/0001106 ]
2000
Earlier work this paper cites.
N. V. Thoai, “Duality Bound Method for the General Quadratic Programming Problem with Quadratic Constraints,” J. Optim. Theory Appl. , vol. 107, no. 2, pp. 331–354, 2000. [Online]. Available: https://doi.org/10.1023/a:1026437621223
2000
Earlier work this paper cites.
R. M. Karp, “Reducibility among Combinatorial Problems,” in Complexity of Computer Computations . Boston, MA: Springer US, 1972, pp. 85–103. [Online]. Available: https://doi.org/10.1007/978-1-4684-2001-2_9
2001
Earlier work this paper cites.
A. K. Ekert, C. M. Alves, D. K. L. Oi, M. Horodecki, P. Horodecki et al. , “Direct Estimations of Linear and Nonlinear Functionals of a Quantum State,” Phys. Rev. Lett. , vol. 88, no. 21, p. 217901, 2002. [Online]. Available: https://doi.org/10.1103/physrevlett.88.217901
2002
Earlier work this paper cites.
H. Kellerer, U. Pferschy, and D. Pisinger, Knapsack Problems . Springer, 2004. [Online]. Available: https://doi.org/10.1007/978-3-540-24777-7
2004
Earlier work this paper cites.
D. Pisinger, “Where are the hard knapsack problems?” Comput. & Oper. Res. , vol. 32, no. 9, pp. 2271–2284, 2005. [Online]. Available: https://doi.org/10.1016/j.cor.2004.03.002
2004
Earlier work this paper cites.
Y. Huang and S. Zhang, “Complex Matrix Decomposition and Quadratic Programming,” Math. Oper. Res. , vol. 32, no. 3, pp. 758–768, 2007. [Online]. Available: https://doi.org/10.1287/moor.1070.0268
2007
Earlier work this paper cites.
D. L. Applegate, R. E. Bixby, V. Chvátal, W. Cook, D. G. Espinoza et al. , “Certification of an optimal TSP tour through 85,900 cities,” Oper. Res. Lett. , vol. 37, no. 1, pp. 11–15, 2009. [Online]. Available: https://doi.org/10.1016/j.orl.2008.09.006
2008
Earlier work this paper cites.
A. M. Childs and N. Wiebe, “Hamiltonian simulation using linear combinations of unitary operations,” Quantum Inf. Comput. , vol. 12, no. 11&12, pp. 901–924, 2012. [Online]. Available: https://doi.org/10.26421/qic12.11-12-1
2012
Earlier work this paper cites.
2014
Earlier work this paper cites.
J. R. McClean, M. E. Kimchi-Schwartz, J. Carter, and W. A. de Jong, “Hybrid quantum-classical hierarchy for mitigation of decoherence and determination of excited states,” Phys. Rev. , vol. 95, no. 4, p. 042308, 2017. [Online]. Available: https://doi.org/10.1103/physreva.95.042308
2017
Cited alongside, same era.
J. Zhang, G. Ding, Y. Zou, S. Qin, and J. Fu, “Review of job shop scheduling research and its new perspectives under Industry 4.0,” J. Intell. Manuf. , vol. 30, no. 4, pp. 1809–1830, 2017. [Online]. Available: https://doi.org/10.1007/s10845-017-1350-2
2017
Cited alongside, same era.
J. Preskill, “Quantum Computing in the NISQ era and beyond,” Quantum , vol. 2, p. 79, 2018. [Online]. Available: https://doi.org/10.22331/q-2018-08-06-79
2018
Cited alongside, same era.
J. R. McClean, S. Boixo, V. N. Smelyanskiy, R. Babbush, and H. Neven, “Barren plateaus in quantum neural network training landscapes,” Nat. Commun. , vol. 9, no. 1, p. 4812, 2018. [Online]. Available: https://doi.org/10.1038/s41467-018-07090-4
M. Cerezo, A. Sone, T. Volkoff, L. Cincio, and P. J. Coles, “Cost function dependent barren plateaus in shallow parametrized quantum circuits,” Nat. Commun. , vol. 12, no. 1, p. 1791, 2021. [Online]. Available: https://doi.org/10.1038/s41467-021-21728-w
2021
Later among the works it cites.
K. Bharti and T. Haug, “Iterative quantum-assisted eigensolver,” Phys. Rev. , vol. 104, no. 5, 2021. [Online]. Available: https://doi.org/10.1103/physreva.104.l050401
2021
Later among the works it cites.
K. Bharti, T. Haug, V. Vedral, and L. Kwek, “Noisy intermediate-scale quantum algorithm for semidefinite programming,” Phys. Rev. , vol. 105, no. 5, p. 052445, 2022. [Online]. Available: https://doi.org/10.1103/physreva.105.052445
2022
Later among the works it cites.
D. Nguyen, “Strong Duality for General Quadratic Programs with Quadratic Equality Constraints,” J. Optim. Theory Appl. , vol. 195, no. 1, pp. 297–313, 2022. [Online]. Available: https://doi.org/10.1007/s10957-022-02082-3
2022
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2018
Cited alongside, same era.
A. Ambainis, K. Balodis, J. Iraids, M. Kokainis, K. Prūsis et al. , “Quantum Speedups for Exponential-Time Dynamic Programming Algorithms,” in Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms . Society for Industrial and Applied Mathematics, 2019, pp. 1783–1793. [Online]. Available: https://doi.org/10.1137/1.9781611975482.107
2019
Cited alongside, same era.
S. Hadfield, Z. Wang, B. O’Gorman, E. G. Rieffel, D. Venturelli et al. , “From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz,” Algorithms , vol. 12, no. 2, p. 34, 2019. [Online]. Available: https://doi.org/10.3390/a12020034
2019
Cited alongside, same era.
A. Montanaro, “Quantum speedup of branch-and-bound algorithms,” Phys. Rev. Res. , vol. 2, no. 1, p. 013056, 2020. [Online]. Available: https://doi.org/10.1103/physrevresearch.2.013056
2020
Cited alongside, same era.
J. van Apeldoorn, A. Gilyén, S. Gribling, and R. de Wolf, “Quantum SDP-Solvers: Better upper and lower bounds,” Quantum , vol. 4, p. 230, 2020. [Online]. Available: https://doi.org/10.22331/q-2020-02-14-230
2020
Cited alongside, same era.
W. J. Huggins, J. Lee, U. Baek, B. O’Gorman, and K. B. Whaley, “A non-orthogonal variational quantum eigensolver,” New J. Phys. , vol. 22, no. 7, p. 073009, 2020. [Online]. Available: https://doi.org/10.1088/1367-2630/ab867b
2020
Cited alongside, same era.
J. M. Kübler, A. Arrasmith, L. Cincio, and P. J. Coles, “An Adaptive Optimizer for Measurement-Frugal Variational Algorithms,” Quantum , vol. 4, p. 263, 2020. [Online]. Available: https://doi.org/10.22331/q-2020-05-11-263
2020
Cited alongside, same era.
A. Bartschi and S. Eidenbenz, “Grover Mixers for QAOA: Shifting Complexity from Mixer Design to State Preparation,” in 2020 IEEE International Conference on Quantum Computing and Engineering (QCE) , 2020, pp. 72–82. [Online]. Available: https://doi.org/10.1109/qce49297.2020.00020
2020
Cited alongside, same era.
M. Cerezo, A. Arrasmith, R. Babbush, S. C. Benjamin, S. Endo et al. , “Variational quantum algorithms,” Nat. Rev. Phys. , vol. 3, no. 9, pp. 625–644, 2021. [Online]. Available: https://doi.org/10.1038/s42254-021-00348-9
2021
Cited alongside, same era.
Later among the works it cites.
Google Quantum AI, “Suppressing quantum errors by scaling a surface code logical qubit,” Nature , vol. 614, no. 7949, pp. 676–681, 2023. [Online]. Available: https://doi.org/10.1038/s41586-022-05434-1
2023
Later among the works it cites.
X. Bonet-Monroig, H. Wang, D. Vermetten, B. Senjean, C. Moussa et al. , “Performance comparison of optimization methods on variational quantum algorithms,” Phys. Rev. , vol. 107, no. 3, p. 032407, 2023. [Online]. Available: https://doi.org/10.1103/physreva.107.032407
2023
Later among the works it cites.
A. Abbas, A. Ambainis, B. Augustino, A. Bärtschi, H. Buhrman et al. , “Challenges and opportunities in quantum optimization,” Nat. Rev. Phys. , vol. 6, no. 12, pp. 718–735, 2024. [Online]. Available: https://doi.org/10.1038/s42254-024-00770-9
2024
Closest in time.
L. Binkowski, G. Koßmann, T. Ziegler, and R. Schwonnek, “Elementary proof of QAOA convergence,” New J. Phys. , vol. 26, no. 7, p. 073001, 2024. [Online]. Available: https://doi.org/10.1088/1367-2630/ad59bb
2024
Closest in time.
D. Ramacciotti, A. I. Lefterovici, and A. F. Rotundo, “Simple quantum algorithm to efficiently prepare sparse states,” Phys. Rev. , vol. 110, no. 3, p. 032609, 2024. [Online]. Available: https://doi.org/10.1103/physreva.110.032609
2024
Closest in time.
PsiQuantum team, “A manufacturable platform for photonic quantum computing,” Nature , vol. 641, no. 8064, pp. 876–883, 2025. [Online]. Available: https://doi.org/10.1038/s41586-025-08820-7
2025
Closest in time.
M. Larocca, S. Thanasilp, S. Wang, K. Sharma, J. Biamonte et al. , “Barren plateaus in variational quantum computing,” Nat. Rev. Phys. , vol. 7, no. 4, pp. 174–189, 2025. [Online]. Available: https://doi.org/10.1038/s42254-025-00813-9
2025
Closest in time.
L. Binkowski, G. Koßmann, T. J. Osborne, R. Schwonnek, and T. Ziegler, “From Barren Plateaus Through Fertile Valleys: Conic Extensions of Parameterised Quantum Circuits,” in 2025 IEEE International Conference on Quantum Computing and Engineering (QCE) , 2025, pp. 111–118. [Online]. Available: https://doi.org/10.1109/qce65121.2025.00022
2025
Closest in time.
L. Binkowski, G. Koßmann, C. Tutschku, and R. Schwonnek, “Symmetry-based quantum algorithms for open-shop scheduling with hard constraints,” Acad. Quantum , vol. 2, no. 3, 2025. [Online]. Available: https://doi.org/10.20935/acadquant7900
2025
Closest in time.
2026
Closest in time.