Quantum computing formulation of some classical Hadamard matrix searching methods and its implementation on a quantum computer
Abstract 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...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Nature Portfolio
2022-01-01
|
| Series: | Scientific Reports |
| Online Access: | https://doi.org/10.1038/s41598-021-03586-0 |