[1] R. P. Feynman. Simulating physics with computers. International Journal of Theoretical Physics, 1982.
[2] D. Deutsch. Quantum theory, the church-turing principle and the universal quantum computer. Proc. R. Soc. Lond., 1985.
[3] D. Deutsch and R. Jozsa. Rapid solution of problems by quantum computation. Proceedings: Mathematical and Physical Sciences, 439(1907):553-558, 1992.
[4] E. Bernstein and U. Vazirani. Quantum complexity theory. In Proceedings of the TwentyFifth Annual ACM Symposium on Theory of Computing, STOC ’93, page 11-20, New York, NY, USA, 1993. Association for Computing Machinery.
[5] D. Simon. On the power of quantum computation. In Proceedings 35th Annual Symposium on Foundations of Computer Science, pages 116-123, 1994.
[6] P. W. Shor. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing, 26(5):1484-1509, Oct 1997.
[7] L. K. Grover. A fast quantum mechanical algorithm for database search. In Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, STOC ’96, page 212-219, New York, NY, USA, 1996. Association for Computing Machinery.
[8] S. Lloyd. Universal quantum simulators. Science, 273(5278):1073-1078, 1996.
[9] J. W. Pan, K. Mattle, D. Bouwmeester, et al. Experimental quantum teleportation. Nature, 390(6660):575-579, Dec 1997.
[10] D. G. Cory, M. D. Price, W. Maas, E. Knill, R. Laflamme, W. H. Zurek, T. F. Havel, and S. S. Somaroo. Experimental quantum error correction. Phys. Rev. Lett., 81:2152-2155, Sep 1998.
[11] L. M. K. Vandersypen, M. Steffen, G. Breyta, C. S. Yannoni, M. H. Sherwood, and I. L. Chuang. Experimental realization of shor’s quantum factoring algorithm using nuclear magnetic resonance. Nature, 414(6866):883-887, Dec 2001.
[12] L. Tian, R. Blatt, and P. Zoller. Scalable ion trap quantum computing without moving ions. The European Physical Journal D, 32(2):201-208, Nov 2004.
[13] C. Rigetti, J. M. Gambetta, S. Poletto, B. L. T. Plourde, J. M. Chow, A. D. C´orcoles, J. A. Smolin, S. T. Merkel, J. R. Rozen, G. A. Keefe, et al. Superconducting qubit in a waveguide cavity with a coherence time approaching 0.1 ms. Physical Review B, 86(10), Sep 2012.
[14] J. Preskill. Quantum computing in the NISQ era and beyond. Quantum, 2:79, Aug 2018.
[15] D. Zhang. Exact solution for three-dimensional ising model. Symmetry, 13(10), 2021.
[16] S. P. Jordan, K. S. Lee, and J. Preskill. Quantum algorithms for quantum field theories. Science, 336(6085):1130-1133, 2012.
[17] K. G. Wilson. Ab Initio Quantum Chemistry: A Source of Ideas for Lattice Gauge Theorists. Nucl. Phys. B Proc. Suppl., 17:82-92, 1990.
[18] E. Learmann. Recent results from lattice qcd simulations. Nuclear Physics A, 610:1-12, 1996. Quark Matter ’96.
[19] S. Aoki, T. Hatsuda, and N. Ishii. Theoretical Foundation of the Nuclear Force in QCD and Its Applications to Central and Tensor Forces in Quenched Lattice QCD Simulations. Progress of Theoretical Physics, 123(1):89-128, 01 2010.
[20] S. Schaefer, R. Sommer, and F. Virotta. Critical slowing down and error analysis in lattice qcd simulations. Nuclear Physics B, 845(1):93-119, 2011.
[21] K. G. Wilson. The renormalization group: Critical phenomena and the kondo problem. Rev. Mod. Phys., 47:773-840, Oct 1975.
[22] K. Marshall, R. Pooser, G. Siopsis, and C. Weedbrook. Quantum simulation of quantum field theory using continuous variables. Phys. Rev. A, 92:063825, Dec 2015.
[23] J. Preskill. Simulating quantum field theory with a quantum computer, 2018.
[24] A. H. Moosavian and S. Jordan. Faster quantum algorithm to simulate fermionic quantum field theory. Physical Review A, 98(1):012332, 2018.
[25] N. Klco, M. J. Savage, and J. R. Stryker. Su(2) non-abelian gauge field theory in one dimension on digital quantum computers. Physical Review D, 101(7), Apr 2020.
[26] N. Shenvi, J. Kempe, and K. B. Whaley. Quantum random-walk search algorithm. Physical Review A, 67(5), May 2003.
[27] A. Ambainis. Quantum random walks - new method for designing quantum algorithms. In SOFSEM, 2008.
[28] A. M. Childs, R. Cleve, E. Deotto, E. Farhi, S. Gutmann, and D. A. Spielman. Exponential algorithmic speedup by a quantum walk. Proceedings of the thirty-fifth ACM symposium on Theory of computing - STOC ’03, 2003.
[29] A. M. Childs. Universal computation by quantum walk. Phys. Rev. Lett., 102:180501, May 2009.
[30] N. B. Lovett, S. Cooper, M. Everitt, M. Trevers, and V. Kendon. Universal quantum computation using the discrete-time quantum walk. Physical Review A, 81(4), Apr 2010.
[31] E. W. Montroll and G. H. Weiss. Random walks on lattices. ii. Journal of Mathematical Physics, 6(2):167-181, 1965.
[32] E. Farhi and S. Gutmann. Quantum computation and decision trees. Physical Review A, 58(2):915-928, Aug 1998.
[33] T. Jacobson and L. Schulman. Quantum stochastics: the passage from a relativistic to a non-relativistic path integral. Journal of Physics A, 17:375-383, 1984.
[34] W. E. Boyce and R. C. Prima. Elementary Differential Equations and Boundary Value Problems. John Wiley and Sons, 9th edition, 2021.
[35] T. A. Jacobson. Spinor chain path integral for the dirac electron. 1983.
[36] A. Kull and R. Treumann. On the path integral of the relativistic electron. International Journal of Theoretical Physics, 38:1423-1428, 1999.
[37] N. Konno, T. Namiki, and T. Soshi. Symmetry of distribution for the one-dimensional hadamard walk. Interdisciplinary Information Sciences, 10(1):11-22, 2004.
[38] N. Konno. Quantum random walks in one dimension. Quantum Information Processing, 1(5):345-354, 2002.
[39] P. L. Knight, E. Rold´an, and J. E. Sipe. Quantum walk on the line as an interference phenomenon. Physical Review A, 68(2), Aug 2003.
[40] P. Blanchard and M.-O. Hongler. Quantum random walks and piecewise deterministic evolutions. Phys. Rev. Lett., 92:120601, Mar 2004.
[41] C. M. Chandrashekar, S. Banerjee, and R. Srikanth. Relationship between quantum walks and relativistic quantum mechanics. Phys. Rev. A, 81:062340, Jun 2010.
[42] G. Di Molfetta, M. Brachet, and F. Debbasch. Quantum walks in artificial electric and gravitational fields. Physica A: Statistical Mechanics and its Applications, 397:157-168, Mar 2014.
[43] G. Di Molfetta, L. Honter, B. B. Luo, T. Wada, and Y. Shikano. Massless dirac equation from fibonacci discrete-time quantum walk. Quantum Studies: Mathematics and Foundations, 2(3):243-252, Apr 2024.
[44] P. Arnault, G. Di Molfetta, M. Brachet, and F. Debbasch. Quantum walks and nonabelian discrete gauge theory. Physical Review A, 94(1), Jul 2016.
[45] P. Arrighi, G. Di Molfetta, I. M´arquez-Mart´ın, and A. P´erez. Dirac equation as a quantum walk over the honeycomb and triangular lattices. Physical Review A, 97(6), Jun 2018.
[46] P. Arrighi, G. D. Molfetta, I. M´arquez-Mart´ın, and A. P´erez. From curved spacetime to spacetime-dependent local unitaries over the honeycomb and triangular quantum walks, 2018.
[47] G. di Molfetta and F. Debbasch. Discrete-time quantum walks: Continuous limit and symmetries. Journal of Mathematical Physics, 53(12):123302, Dec 2012.
[48] M. A. Nielsen and I. L. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, 10th edition, 2010.
[49] J. Koch, T. M. Yu, J. Gambetta, A. A. Houck, D. I. Schuster, J. Majer, A. Blais, M. H. Devoret, S. M. Girvin, and R. J. Schoelkopf. Charge-insensitive qubit design derived from the cooper pair box. Phys. Rev. A, 76:042319, Oct 2007.
[50] W. Oliver and P. Welander. Materials in superconducting quantum bits. Mrs Bulletin, 38:816-825, 2013.
[51] A. Blais, J. Gambetta, A. Wallraff, D. I. Schuster, S. M. Girvin, M. H. Devoret, and R. J. Schoelkopf. Quantum-information processing with circuit quantum electrodynamics. Phys. Rev. A, 75:032329, Mar 2007.
[52] F. Yan. Coherence Characterization with a Superconducting Flux Qubit through NMR Approaches. PhD thesis, Massachusetts Institute of Technology, 6 2013.
[53] B. L. Douglas and J. B. Wang. Efficient quantum circuit implementation of quantum walks, 2009.
[54] H. Xiao-Chuan, F. Lan-Tian, L. Yu-Xuan, Z. Lan-Xuan, S. Jung-Feng, and Z. YongSheng. Experimental observations of 1d quantum walks in a limited region. Quantum Information Processing, 18, 2019.
[55] A. Politi, M. J. Cryan, J. G. Rarity, S. Yu, and J. L. O’Brien. Silica-on-silicon waveguide quantum circuits. Science, 320(5876):646{649, May 2008.
[56] R. Matjeschk, C. Schneider, M. Enderlein, T. Huber, H. Schmitz, J. Glueckert, and T. Schaetz. Experimental simulation and limitations of quantum walks with trapped ions. New Journal of Physics, 14:035012, 2012.
[57] M. Ware. Flux-tunable superconducting transmons for quantum information processing. PhD thesis, Syracuse University, 5 2015.
[58] H.-L. Huang, D. Wu, D. Fan, and X. Zhu. Superconducting quantum computing: A review, 2020.
[59] A. P. M. Place, L. V. H. Rodgers, P. Mundada, B. M. Smitham, M. Fitzpatrick, Z. Leng, A. Premkumar, J. Bryon, A. Vrajitoarea, S. Sussman, and et al. New material platform for superconducting transmon qubits with coherence times exceeding 0.3 milliseconds. Nature Communications, 12(1), Mar 2021.
[60] C. Wang, M.-C. Chen, C.-Y. Lu, and J.-W. Pan. Optimal readout of superconducting qubits exploiting high-level states. Fundamental Research, 1(1):16-21, 2021.
[61] E. Wilson, F. Mueller, L. Bassman, and C. Iancu. Empirical evaluation of circuit approximations on noisy quantum devices, 2021.
[62] G. D. Molfetta and F. Debbasch. Discrete-time quantum walks in random artificial gauge fields, 2016.
نشریه پژوهش های نوین فیزیک
