Quantum computers can search rapidly by using almost any transformation [PDF]
A quantum computer has a clear advantage over a classical computer for exhaustive search. The quantum mechanical algorithm for exhaustive search was originally derived by using subtle properties of a particular quantum mechanical operation called the ...
C. H. Bennett +11 more
core +2 more sources
A Characterization of Generalized Boolean Functions Employed in CDMA Communications [PDF]
In design of secure cryptosystems and CDMA communications, the negabent functions play a significant role. The generalized Boolean functions have been extensively studied by Schmidt and established several important results in this setup.
Deep Singh +3 more
doaj +1 more source
A Fourier-analytic Approach to Counting Partial Hadamard Matrices
In this paper, we study a family of lattice walks which are related to the Hadamard conjecture. There is a bijection between paths of these walks which originate and terminate at the origin and equivalence classes of partial Hadamard matrices. Therefore,
de Launey, Warwick, Levin, David A.
core +1 more source
Hadamard transform imaging [PDF]
We have constructed a Hadamard transform Raman microscopic imaging system, and have developed it to a high definition (64K pixel) technique. We have demonstrated multispectral Raman imaging and developed the first three-dimensional (digital confocal) Raman imaging. We have explored the systematic errors in Hadamard multiplexing techniques and developed
openaire +2 more sources
Using the Hadamard and related transforms for simplifying the spectrum of the quantum baker's map
We rationalize the somewhat surprising efficacy of the Hadamard transform in simplifying the eigenstates of the quantum baker's map, a paradigmatic model of quantum chaos.
Allouche J P +17 more
core +1 more source
Block circulant matrices with circulant blocks, weil sums and mutually unbiased bases, II. The prime power case [PDF]
In our previous paper \cite{co1} we have shown that the theory of circulant matrices allows to recover the result that there exists $p+1$ Mutually Unbiased Bases in dimension $p$, $p$ being an arbitrary prime number.
Berndt B. C. +7 more
core +5 more sources
Quantum Computing and a Unified Approach to Fast Unitary Transforms
A quantum computer directly manipulates information stored in the state of quantum mechanical systems. The available operations have many attractive features but also underly severe restrictions, which complicate the design of quantum algorithms.
Agaian, Sos S., Klappenecker, Andreas
core +1 more source
Efficient Screening of Organic Singlet Fission Molecules Using Graph Neural Networks
A high‐throughput screening framework based on graph neural networks (GNNs) and multi‐level validation facilitates the identification of singlet fission (SF) candidates. By efficiently predicting excitation energies across 20 million molecules, and integrating TDDFT calculations, synthetic accessibility assessments, and GW+BSE calculations, this ...
Li Fu +5 more
wiley +1 more source
Metaheuristics in the Optimization of Cryptographic Boolean Functions
Generating Boolean Functions (BFs) with high nonlinearity is a complex task that is usually addresses through algebraic constructions. Metaheuristics have also been applied extensively to this task. However, metaheuristics have not been able to attain so
Isaac López-López +4 more
doaj +1 more source
Using the discrete hadamard transform to detect moving objects in surveillance video [PDF]
In this paper we present an approach to object detection in surveillance video based on detecting moving edges using the Hadamard transform. The proposed method is characterized by robustness to illumination changes and ghosting effects and provides ...
Kim, Chanyul, O'Connor, Noel E.
core +1 more source

