Cargando…
Finding a Hadamard Matrix by Simulated Quantum Annealing
Hard problems have recently become an important issue in computing. Various methods, including a heuristic approach that is inspired by physical phenomena, are being explored. In this paper, we propose the use of simulated quantum annealing (SQA) to find a Hadamard matrix, which is itself a hard pro...
Autor principal: | Suksmono, Andriyan Bayu |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
MDPI
2018
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7512635/ https://www.ncbi.nlm.nih.gov/pubmed/33265232 http://dx.doi.org/10.3390/e20020141 |
Ejemplares similares
-
Finding Hadamard Matrices by a Quantum Annealing Machine
por: Suksmono, Andriyan Bayu, et al.
Publicado: (2019) -
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) -
Simulating the Hadamard gate in the Fibonacci disk code for universal topological quantum computation
por: Wu, Yong-Shi
Publicado: (2023) -
Experimental quantum simulation of a topologically protected Hadamard gate via braiding Fibonacci anyons
por: Fan, Yu-ang, et al.
Publicado: (2023) -
Hadamard Transforms
por: Agaian, Sos, et al.
Publicado: (2011)