15 citations to 10.1088/1464-4266/5/6/015 (Crossref Cited-By Service)
  1. S. Iriyama, M. Ohya, “Computational complexity and applications of quantum algorithm”, Applied Mathematics and Computation, 218, no. 16, 2012, 8019  crossref
  2. Brian R. La Cour, Corey I. Ostrove, “Subspace projection method for unstructured searches with noisy quantum oracles using a signal-based quantum emulation device”, Quantum Inf Process, 16, no. 1, 2017, 7  crossref
  3. Satoshi Iriyama, Masanori Ohya, “Language Classes Defined by Generalized Quantum Turing Machine”, Open Syst. Inf. Dyn., 15, no. 04, 2008, 383  crossref
  4. Satoshi Iriyama, Masanori Ohya, 8369, Quantum Interaction, 2014, 172  crossref
  5. Alberto Leporati, Sara Felloni, “Three “quantum” algorithms to solve 3-SAT”, Theoretical Computer Science, 372, no. 2-3, 2007, 218  crossref
  6. Masanori Ohya, “Quantum Information and Probability: My Collaboration with Professor Ingarden”, Open Syst. Inf. Dyn., 18, no. 02, 2011, 109  crossref
  7. Satoshi Iriyama, Masanori Ohya, “On Generalized Quantum Turing Machine and Its Applications”, Open Syst. Inf. Dyn., 16, no. 02n03, 2009, 195  crossref
  8. Masanori Ohya, “Quantum algorithm for SAT problem andquantum mutual entropy”, Reports on Mathematical Physics, 55, no. 1, 2005, 109  crossref
  9. Satoshi Iriyama, Masanori Ohya, “Quantum turing machine and brain model represented by Fock space”, Int. J. Quantum Inform., 14, no. 04, 2016, 1640008  crossref
  10. M. Ohya, “New quantum algorithm solving the NP complete problem”, P-Adic Num Ultrametr Anal Appl, 4, no. 2, 2012, 161  crossref
1
2
Next