[1] L. Venema. Silicon electronics and beyond. Nature, 479, 309(2011).

[2] M. M. Waldrop. The chips are down for Moore’s law. Nature, 530, 144-147(2016).

[3] M. R. Garey, D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness(1979).

[4] S.-T. Wei et al. Trends and challenges in the circuit and macro of RRAM-based computing-in-memory systems. Chip, 1, 100004(2022).

[5] M. Sipser. Introduction to the Theory of Computation(2012).

[6] A. M. Turing. On computable numbers, with an application to the Entscheidungs problem. Proc. Lond. Math. Soc., 2, 230-265(1936).

[7] A. Currin et al. Computing exponentially faster: implementing a non-deterministic universal Turing machine using DNA. J. R. Soc. Interface, 14, 20160990(2017).

[8] G. Reinelt. The Traveling Salesman: Computational Solutions for TSP Applications, 31-41(2003).

[9] A. Smith et al. Fault diagnosis and logic debugging using Boolean satisfiability. IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst., 24, 1606-1621(2005).

[10] A. Darmann et al. The subset sum game. Eur. J. Oper. Res., 233, 539-549(2014).

[11] H. Kellerer, U. Pferschy, D. Pisinger. Knapsack Problems, 449-482(2004).

[12] D. Biesner, R. Sifa, C. Bauckhage. Solving subset sum problems using binary optimization with applications in auditing and financial data analysis(2022).

[13] M. Eghdami, M. Naghibzadeh. SSA: subset sum approach to protein β-sheet structure prediction. Comput. Biol. Chem., 94, 107552(2021).

[14] E. Farhi et al. A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem. Science, 292, 472-475(2001).

[15] W.-L. Chang et al. Quantum speedup in solving the maximal-clique problem. Phys. Rev. A, 97, 032344(2018).

[16] M. Di Ventra, Y. V. Pershin. The parallel approach. Nat. Phys., 9, 200-202(2013).

[17] F. L. Traversa et al. Memcomputing NP-complete problems in polynomial time using polynomial resources and collective states. Sci. Adv., 1, e1500031(2015).

[18] X. Yan et al. Reconfigurable stochastic neurons based on tin hetero-memristors for simulated annealing and the Boltzmann machine. Nat. Commun., 12, 5710(2021).

[19] L. M. Adleman. Molecular computation of solutions to combinatorial problems. Science, 266, 1021-1024(1994).

[20] R. S. Braich et al. Solution of a 20-variable 3-SAT problem on a DNA computer. Science, 296, 499-502(2002).

[21] D. V. Nicolau et al. Parallel computation with molecular-motor-propelled agents in nanofabricated networks. Proc. Natl. Acad. Sci. U. S. A., 113, 2591-2596(2016).

[22] K. Wu et al. An optical fiber network oracle for NP-complete problems. Light Sci. Appl., 3, e147(2014).

[23] M. R. Vázquez et al. Optical NP problem solver on laser-written waveguide platform. Opt. Express, 26, 702-710(2018).

[24] P. L. McMahon et al. A fully programmable 100-spin coherent Ising machine with all-to-all connections. Science, 354, 614-617(2016).

[25] M. Oltean, O. Muntean. Solving the subset-sum problem with a light-based device. Nat. Comput., 8, 321-331(2009).

[26] S. Dolev, M. Oltean, T. Haist, O. Muntean, M. Oltean. Solving NP-complete problems with delayed signals: an overview of current research directions. Opt. SuperComputing, 115-127(2008).

[27] X.-Y. Xu, X.-M. Jin. Integrated photonic computing beyond the von Neumann architecture. ACS Photonics, 10, 1027-1036(2023).

[28] X.-Y. Xu et al. A scalable photonic computer solving the subset sum problem. Sci. Adv., 6, eaay5853(2020).

[29] I. V. Dyakonov et al. Reconfigurable photonics on a glass chip. Phys. Rev. Appl., 10, 044048(2018).

[30] W. Bogaerts et al. Programmable photonic circuits. Nature, 586, 207-216(2020).

[31] T. Okamoto, K. Tanaka, S. Uchiyama. Quantum public-key cryptosystems, 147-165(2000).

[32] A. Kate, I. Goldberg. Generalizing cryptosystems based on the subset sum problem. Int. J. Inf. Secur., 10, 189-199(2011).

[33] R. Osellame, G. Cerullo, R. Ramponi. Femtosecond Laser Micromachining: Photonic and Microfluidic Devices in Transparent Materials(2012).

[34] X.-Y. Xu et al. Quantum transport in fractal networks. Nat. Photonics, 15, 703-710(2021).

[35] F. Ceccarelli et al. Thermal phase shifters for femtosecond laser written photonic integrated circuits. J. Lightwave Technol., 37, 4275-4281(2019).

[36] C. Pentangelo et al. High-fidelity and polarization-insensitive universal photonic processors fabricated by femtosecond laser writing. Nanophotonics, 13, 2259-2270(2024).

[37] J.-P. Bérubé, R. Vallée. Femtosecond laser direct inscription of surface skimming waveguides in bulk glass. Opt. Lett., 41, 3074-3077(2016).

[38] Refractive index of Corning Eagle XG glass(2019).

[39] FLOPS(2024).

[40] P. Gepner, D. L. Fraser, V. Gamayunov. Evaluation of the 3rd generation Intel Core processor focusing on HPC applications, 1-6(2012).

[41] Intel Pentium processor(2020).

[42] Intel Core processor(2024).

[43] H.-S. Zhong et al. Quantum computational advantage using photons. Science, 370, 1460-1463(2020).

[44] J. Gao et al. Quantum advantage with membosonsampling. Chip, 1, 100007(2022).

[45] L. S. Madsen et al. Quantum computational advantage with a programmable photonic processor. Nature, 606, 75-81(2022).

[46] X. Hou et al. Waveguide-coupled superconducting nanowire single-photon detectors based on femtosecond laser direct writing. Opt. Express, 29, 7746-7756(2021).

[47] C. Liu, H.-F. Ye, Y.-L. Shi. Advances in near-infrared avalanche diode single-photon detectors. Chip, 1, 100005(2022).

[48] H. J. Caulfield, S. Dolev. Why future supercomputing requires optics. Nat. Photonics, 4, 261(2010).

[49] S. Schwerdfeger, R. Walter. A fast and effective subset sum based improvement procedure for workload balancing on identical parallel machines. Comput. Oper. Res., 73, 84-91(2016).

[50] G. Alonistiotis et al. Approximating subset sum ratio via subset sum computations. Acta Inf., 61, 101-113(2024).

[51] R. M. Karp. Reducibility among combinatorial problems. Complexity of Computer Computations, 85-103(1972).

[52] M. Oltean, O. Muntean. Exact cover with light. New. Gener. Comput., 26, 329-346(2008).

[53] S. Dolev, M. Oltean, O. Muntean, M. Oltean. An optical solution for the SAT problem. Optical Supercomputing, 53-62(2010).

[54] F. Centrone et al. Experimental demonstration of quantum advantage for NP verification with limited information. Nat. Commun., 12, 850(2021).

[55] A. Zhang et al. Quantum verification of NP problems with single photons and linear optics. Light: Sci. Appl., 10, 169(2021).

[56] S. Xu et al. Optical coherent dot-product chip for sophisticated deep learning regression. Light: Sci. Appl., 10, 221(2021).

[57] M. Spagnolo et al. Experimental photonic quantum memristor. Nat. Photonics, 16, 318-323(2022).

[58] Commercial silicon detectors(2024).

[59] R.-J. Ren et al. 128 identical quantum sources integrated on a single silica chip. Phys. Rev. Appl., 16, 054026(2021).

[60] N. Psaila et al. Passively aligned glass micro-optic bridge for expanded-beam vertical coupling and pluggable silicon photonics. J. Light. Technol., 42, 5223-5230(2024).

[61] L. Brusberg et al. Glass platform for co-packaged optics. IEEE J. Sel. Top. Quantum Electron., 29, 6000210(2023).

[62] D. Pisinger. Linear time algorithms for knapsack problems with bounded weights. J. Alg., 33, 1-14(1999).