Cargando…
Finding Hadamard Matrices by a Quantum Annealing Machine
Finding a Hadamard matrix (H-matrix) among the set of all binary matrices of corresponding order is a hard problem, which potentially can be solved by quantum computing. We propose a method to formulate the Hamiltonian of finding H-matrix problem and address its implementation limitation on existing...
Autores principales: | Suksmono, Andriyan Bayu, Minato, Yuichiro |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Nature Publishing Group UK
2019
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6779766/ https://www.ncbi.nlm.nih.gov/pubmed/31591411 http://dx.doi.org/10.1038/s41598-019-50473-w |
Ejemplares similares
-
Finding a Hadamard Matrix by Simulated Quantum Annealing
por: Suksmono, Andriyan Bayu
Publicado: (2018) -
Quantum computing formulation of some classical Hadamard matrix searching methods and its implementation on a quantum computer
por: Suksmono, Andriyan Bayu, et al.
Publicado: (2022) -
Hadamard Matrices and Their Applications
por: Horadam, K J
Publicado: (2011) -
Hadamard matrices and their applications
por: Agaian, S S
Publicado: (1985) -
A Workshop on Algebraic Design Theory and Hadamard Matrices
por: Colbourn, Charles
Publicado: (2015)