{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:46:09Z","timestamp":1725497169735},"publisher-location":"Berlin, Heidelberg","reference-count":42,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540754138"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75414-5_6","type":"book-chapter","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T11:22:54Z","timestamp":1196940174000},"page":"87-111","source":"Crossref","is-referenced-by-count":3,"title":["Algebraic Methods in Quantum Informatics"],"prefix":"10.1007","author":[{"given":"Jozef","family":"Gruska","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","unstructured":"Aaronson, S.: Are quantum states exponentially long vectors? quant-ph\/0507242 (2005)"},{"key":"6_CR2","unstructured":"Aharonov, D., Landau, Z., Makowsky, J.: The quantum FFT can be classically simulated. quant-ph\/0611156 (2006)"},{"key":"6_CR3","unstructured":"Ambainis, A., Watrous, J.: Two-way finite automata with quantum and classical states. quant-ph\/9911009 (1999)"},{"key":"6_CR4","unstructured":"Bacon, D.: How a Glebsh-Gordan transform helps to solve the Heisenberg Hidden Subgroup problem. quant-ph\/0612107 (2006)"},{"key":"6_CR5","unstructured":"Bacon, D., Childs, A., van Dam, W.: Optimal measurements for the dihedral hidden subgroup problem. quant-ph\/0501044 (2005)"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Barnum, H., Knill, E., Ortiz, G., Somma, R., Viola, L.: A subsystem-independent generalization of entanglement. quant-ph\/0305023 (2003)","DOI":"10.1103\/PhysRevLett.92.107902"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45007-6_1","volume-title":"Developments in Language Theory","author":"S. Bertoni","year":"2003","unstructured":"Bertoni, S., Mereghetti, K., Palano, B.: Quantum computing: 1-way quantum automata. In: \u00c9sik, Z., F\u00fcl\u00f6p, Z. (eds.) DLT 2003. LNCS, vol.\u00a02710, pp. 1\u201320. Springer, Heidelberg (2003)"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Bozapalidis, S.: Quantum recognizabla tree functions. In: Proceedings of the Conference on Unconventional models of computation - UMC\u20192K, pp. 25\u201347 (2000)","DOI":"10.1007\/978-1-4471-0313-4_3"},{"issue":"3","key":"6_CR9","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s00224-002-1067-1","volume":"36","author":"S. Bozapalidis","year":"2003","unstructured":"Bozapalidis, S.: Extending stochastic and quantum functions. Theory of computing systems\u00a036(3), 183\u2013197 (2003)","journal-title":"Theory of computing systems"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Brassard, G., Buhrman, H., Linden, N., M\u00e9thot, A.A., Tapp, A., Unger, F.: A limit on non-locality in any world in which communication complexity is not trivial. quant-ph\/0508042 (2005)","DOI":"10.1103\/PhysRevLett.96.250401"},{"key":"6_CR11","doi-asserted-by":"crossref","first-page":"220403","DOI":"10.1103\/PhysRevLett.94.220403","volume":"94","author":"N. Cerf","year":"2005","unstructured":"Cerf, N., Gisin, N., Masar, S., Popescu, S.: Quantum entanglement can be simulated without communication. Physical Review Letter, 94:220403 (2005)","journal-title":"Physical Review Letter"},{"issue":"2","key":"6_CR12","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/BF00417500","volume":"4","author":"B.S. Cirel\u2019son","year":"1980","unstructured":"Cirel\u2019son, B.S.: Quantum generalization\u2019s of Bell\u2019s inequality. Letters in Mathematical Physics\u00a04(2), 93\u2013100 (1980)","journal-title":"Letters in Mathematical Physics"},{"key":"6_CR13","unstructured":"Clifton, R., Bub, J., Halvorson, H.: Characterizing quantum theory in terms of information-theoretic constraints. quant-ph\/0211089 (2002)"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Ettinger, M., Hoyer, P., Knill, E.: The quantum query complexity of the hidden subgroup problem is polynomial. quant-ph\/0401083 (2004)","DOI":"10.1016\/j.ipl.2004.01.024"},{"key":"6_CR15","unstructured":"Gisin, N.: Bell inequalities: many questions, a few answers. quant-ph\/0702021 (2007)"},{"key":"6_CR16","unstructured":"J.\u00a0Gruska. Quantum computing. McGraw-Hill, 1999-2005, see also additions and updatings of the book on http:\/\/www.mcgraw-hill.co.uk\/gruska"},{"issue":"3","key":"6_CR17","first-page":"198","volume":"5","author":"J. Gruska","year":"2000","unstructured":"Gruska, J.: Descriptional complexity issues in quantum computing. Automata, Languages and Combinatorics\u00a05(3), 198\u2013218 (2000)","journal-title":"Automata, Languages and Combinatorics"},{"key":"6_CR18","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF03037304","volume":"21","author":"J. Gruska","year":"2003","unstructured":"Gruska, J.: Quantum entanglement as a new quantum information processing resource. New Generation Computing\u00a021, 279\u2013295 (2003)","journal-title":"New Generation Computing"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Gruska, J.: General Theory of information transfer and combinatorics, Universal sets of quantum information processing primitives and optimal use of such primitives, pp. 356\u2013377. Springer-Heidelberg (2005)","DOI":"10.1007\/11889342_24"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Gruska, J.: From informatics to quantum informatics. In: Proceedings of the Fourth IFIP International Conference on Theoretical Computer Science- TCS 2006 at the World Computer Congress, pp. 17\u201346 (2006)","DOI":"10.1007\/978-0-387-34735-6_7"},{"key":"6_CR21","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-540-33461-3_4","volume":"25","author":"J. Gruska","year":"2006","unstructured":"Gruska, J.: Recent advances in Formal Languages and Applications. Studies in Computatiional Intelligence\u00a025, 81\u2013117 (2006)","journal-title":"Studies in Computatiional Intelligence"},{"key":"6_CR22","unstructured":"Gudder, S.: Basic properties of quantum automata. email: sgudder@cs.du.edu (2000)"},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Hallgren, S., Moore, C., Roetteler, M., Russel, A., Sen, P.: Limitations of quantum coset states for graph isomorphism. In: Proceedings of 38th STOC, pp. 604\u2013617 (2006)","DOI":"10.1145\/1132516.1132603"},{"key":"6_CR24","unstructured":"Horodecki, R., Horodecki, P., Horodecki, M., Horodecki, K.: Quantum entanglement. quant-ph\/0702225 (2007)"},{"key":"6_CR25","doi-asserted-by":"crossref","unstructured":"Kuperberg, G.: A subexponential-time quantum algorithm for the dihedral hidden subgroup problem. New Generation Computing, see also quant-ph\/0302112\u00a035, 170\u2013188 (2005)","DOI":"10.1137\/S0097539703436345"},{"key":"6_CR26","unstructured":"Markov, I., Shi, Y.: Simulating quantum computation by contracting tensor. quant-ph\/0511069 (2002)"},{"key":"6_CR27","doi-asserted-by":"crossref","unstructured":"Mereghetti, C., Palano, B.: Quantum finite automata with control language. Tech. rep. (2006)","DOI":"10.1051\/ita:2006007"},{"key":"6_CR28","unstructured":"Methot, A.A., Scarani, V.: An anomality of non-locality. quant-ph\/0601210 (2000)"},{"key":"6_CR29","doi-asserted-by":"crossref","unstructured":"Moore, C., Russell, A., Sniady, P.: On the impossibility of a quantum sieve algorithm for graph isomorphism: unconditional result. quant-ph\/0612089 (2006)","DOI":"10.1145\/1250790.1250868"},{"key":"6_CR30","unstructured":"Moore, C., Russell, A., Vazirani, U.: A classical one-way function to confound quantum adversaries. quant-ph\/0701115 (2007)"},{"key":"6_CR31","volume-title":"Quantum information processing","author":"M.A. Nielsen","year":"2000","unstructured":"Nielsen, M.A., Chuang, I.I.: Quantum information processing. Cambridge University Press, Cambridge (2000)"},{"key":"6_CR32","unstructured":"Rao, M.V.P., Vinay, V.: Quantum finite automata and weighted automata (2007)"},{"key":"6_CR33","unstructured":"Perdrix, S.: Towards minimal resources of measurement-based quantum computation. quant-ph\/070.0202 (2007)"},{"key":"6_CR34","doi-asserted-by":"crossref","unstructured":"Popescu, S., Rohrlich, D.: Causality and non-locality as axioms for quantum mechanics. quant-ph\/9709026 (1997)","DOI":"10.1007\/978-94-017-0990-3_45"},{"key":"6_CR35","doi-asserted-by":"crossref","unstructured":"Scarani, V.: Feats, features and failures of the PR-box. quant-ph\/0603017 (2006)","DOI":"10.1063\/1.2219371"},{"key":"6_CR36","unstructured":"Shi, Y.: Both Toffoli and controlled-NOT need little help to do universal computation. quant-ph\/0205115 (2002)"},{"key":"6_CR37","doi-asserted-by":"crossref","unstructured":"Short, T., Gisin, N., Popescu, S.: The physics of no-bit commitment generalized quantum non-locality versus oblivious transfer. quant-ph\/0504134 (2005)","DOI":"10.1007\/s11128-006-0015-4"},{"key":"6_CR38","unstructured":"Smolin, J.A.: Can quantum cryptography imply quantum mechanics. quant-ph\/0310067 (2003)"},{"key":"6_CR39","unstructured":"Tucci, R.R.: A rudimentary quantum compiler. quant-ph\/9902062 (1999)"},{"key":"6_CR40","unstructured":"van Dam, W.: Implausible consequences of superstrong nonlocality. quant-ph\/0501159 (2005)"},{"key":"6_CR41","unstructured":"Hallgren, S., van Dim, W., Ip, L.: Quantum algorithms for some hidden shift problems. quant-ph\/0211140 (2002)"},{"key":"6_CR42","doi-asserted-by":"crossref","unstructured":"Watrous, J.: Quantum algorithms for solvable groups. quant-ph\/0011023 (2000)","DOI":"10.1145\/380752.380759"}],"container-title":["Lecture Notes in Computer Science","Algebraic Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75414-5_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,15]],"date-time":"2023-05-15T04:36:45Z","timestamp":1684125405000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75414-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540754138"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75414-5_6","relation":{},"subject":[]}}