Cargando…
Quantum computing formulation of some classical Hadamard matrix searching methods and its implementation on a quantum computer
Finding a Hadamard matrix (H-matrix) among all possible binary matrices of corresponding order is a hard problem that can be solved by a quantum computer. Due to the limitation on the number of qubits and connections in current quantum processors, only low order H-matrix search of orders 2 and 4 wer...
Autores principales: | Suksmono, Andriyan Bayu, Minato, Yuichiro |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Nature Publishing Group UK
2022
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8741795/ https://www.ncbi.nlm.nih.gov/pubmed/34996901 http://dx.doi.org/10.1038/s41598-021-03586-0 |
Ejemplares similares
-
Finding Hadamard Matrices by a Quantum Annealing Machine
por: Suksmono, Andriyan Bayu, et al.
Publicado: (2019) -
Finding a Hadamard Matrix by Simulated Quantum Annealing
por: Suksmono, Andriyan Bayu
Publicado: (2018) -
Simulating the Hadamard gate in the Fibonacci disk code for universal topological quantum computation
por: Wu, Yong-Shi
Publicado: (2023) -
Classical and quantum computation
por: Kitaev, A Yu, et al.
Publicado: (2002) -
Mathematical optics: classical, quantum, and computational methods
por: Lakshminarayanan, Vasudevan
Publicado: (2012)