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 and 4 were implementable by previous method. In this paper, we show that by adopting classical searching techniques of the H-matrices, we can formulate new quantum computing methods for finding higher order ones. We present some results of finding H-matrices of order up to more than one hundred and a prototypical experiment of the classical-quantum resource balancing method that yields a 92-order H-matrix previously found by Jet Propulsion Laboratory researchers in 1961 using a mainframe computer. Since

SUBMITTER: Suksmono AB 

PROVIDER: S-EPMC8741795 | biostudies-literature | 2022 Jan

REPOSITORIES: biostudies-literature