Řešení sudoku pomocí kvantového počítání
but.committee | doc. Ing. Luděk Nechvátal, Ph.D. (předseda) prof. RNDr. Josef Šlapal, CSc. (místopředseda) doc. Ing. Petr Tomášek, Ph.D. (člen) doc. Ing. Jiří Šremr, Ph.D. (člen) prof. RNDr. Miloslav Druckmüller, CSc. (člen) Prof. Bruno Rubino, Ph.D. (člen) Prof. Corrado Lattanzio, Ph.D. (člen) Gennaro Ciampa, Ph.D. (člen) | cs |
but.defence | The student presented their master’s thesis, and the supervisor read their evaluation report in person. The opponent joined the examination online, read their report aloud, and posed several questions. The student responded to the questions effectively, and the opponent expressed satisfaction with the answers provided. | cs |
but.jazyk | angličtina (English) | |
but.program | Applied and Interdisciplinary Mathematics | cs |
but.result | práce byla úspěšně obhájena | cs |
dc.contributor.advisor | Hrdina, Jaroslav | en |
dc.contributor.author | Saji, Deepthy | en |
dc.contributor.referee | Hildenbrand, Dietmar | en |
dc.date.accessioned | 2025-06-18T04:02:45Z | |
dc.date.available | 2025-06-18T04:02:45Z | |
dc.date.created | 2025 | cs |
dc.description.abstract | In this thesis, Sudoku is solved by the well-known quantum algorithms. The algorithms used are Grover’s algorithm and quantum counting that uses quantum phase estimation. The grid size of the Sudoku is varied to study the impact on the quantum hardware such as Qiskit while performing quantum computation to solve the Sudoku using these algorithms. Furthermore, this thesis explores an alternative implementation pathway for these Sudoku-solving quantum algorithms using Clifford algebra, offering insights into the improvement of resources for quantum computation. | en |
dc.description.abstract | In this thesis, Sudoku is solved by the well-known quantum algorithms. The algorithms used are Grover’s algorithm and quantum counting that uses quantum phase estimation. The grid size of the Sudoku is varied to study the impact on the quantum hardware such as Qiskit while performing quantum computation to solve the Sudoku using these algorithms. Furthermore, this thesis explores an alternative implementation pathway for these Sudoku-solving quantum algorithms using Clifford algebra, offering insights into the improvement of resources for quantum computation. | cs |
dc.description.mark | B | cs |
dc.identifier.citation | SAJI, D. Řešení sudoku pomocí kvantového počítání [online]. Brno: Vysoké učení technické v Brně. Fakulta strojního inženýrství. 2025. | cs |
dc.identifier.other | 167413 | cs |
dc.identifier.uri | https://hdl.handle.net/11012/253577 | |
dc.language.iso | en | cs |
dc.publisher | Vysoké učení technické v Brně. Fakulta strojního inženýrství | cs |
dc.rights | Standardní licenční smlouva - přístup k plnému textu bez omezení | cs |
dc.subject | Quantum computation | en |
dc.subject | Grover’s algorithm | en |
dc.subject | Quantum phase estimation | en |
dc.subject | Quantum Register Algebra. | en |
dc.subject | Quantum computation | cs |
dc.subject | Grover’s algorithm | cs |
dc.subject | Quantum phase estimation | cs |
dc.subject | Quantum Register Algebra. | cs |
dc.title | Řešení sudoku pomocí kvantového počítání | en |
dc.title.alternative | Solving sudoku by quantum computation | cs |
dc.type | Text | cs |
dc.type.driver | masterThesis | en |
dc.type.evskp | diplomová práce | cs |
dcterms.dateAccepted | 2025-06-17 | cs |
dcterms.modified | 2025-06-17-11:58:02 | cs |
eprints.affiliatedInstitution.faculty | Fakulta strojního inženýrství | cs |
sync.item.dbid | 167413 | en |
sync.item.dbtype | ZP | en |
sync.item.insts | 2025.06.18 06:02:45 | en |
sync.item.modts | 2025.06.18 05:39:27 | en |
thesis.discipline | bez specializace | cs |
thesis.grantor | Vysoké učení technické v Brně. Fakulta strojního inženýrství. Ústav matematiky | cs |
thesis.level | Inženýrský | cs |
thesis.name | Ing. | cs |