Results 101 to 110 of about 562,872 (260)
Quantum Inspired Universal Analog Computation Based on Circuits
We propose an analog scheme of classical circuit for universal quantum computation. The information is encoded using correlated electrical signals, and the number of the basic computing components employed in our circuit design is consistent with the number of the quantum gate in the quantum circuit.
Hanxu Zhang, Yifan Sun, Xiangdong Zhang
wiley +1 more source
The Hadamard inequality and Fischer inequality play an important role in the matrix study. Many articles have addressed these inequalities providing new proofs, noteworthy extensions, generalizations, refinements, counterparts and applications.
ZHANGHuamin(张华民) +1 more
doaj +1 more source
A Resource Efficient Ising Model‐Based Quantum Sudoku Solver
ABSTRACT Background Quantum algorithms exploit superposition and parallelism to address complex combinatorial problems, many of which fall into the non‐polynomial (NP) class. Sudoku, a widely known logic‐based puzzle, is proven to be NP‐complete and thus presents a suitable testbed for exploring quantum optimization approaches.
Wen‐Li Wang +5 more
wiley +1 more source
Cocyclic Hadamard Matrices and Hadamard Groups Are Equivalent
It is proved that the existence of cocyclic Hadamard matrices is equivalent to the existence of certain Hadamard groups. A procedure for the construction of Hadamard groups is described.
openaire +1 more source
Generating Compressed Counterfactual Hard Negative Samples for Graph Contrastive Learning
ABSTRACT Graph contrastive learning (GCL) relies on acquiring high‐quality positive and negative samples to learn the structural semantics of the input graph. Previous approaches typically sampled negative samples from the same training batch or an irrelevant external graph.
Haoran Yang +7 more
wiley +1 more source
Partitioning Hadamard vectors into Hadamard matrices
We will show that in a space of dimension $m$, any family of $2^{m-1}$ distinct Hadamard vectors (where you can choose x or -x but not both) can be partitioned into Hadamard matrices if and only if $m=2^n$ for some n. We will solve this problem with a simple algorithm for assigning the vectors to the Hadamard matrices.
Casazza, Peter G., Tremain, Janet C.
openaire +2 more sources
Spatial price competition and buyer power in the U.S. beef packing industry
Abstract We develop a spatially‐explicit model of the U.S. beef packing industry to study key questions related to competition in an oligopsony setting. Cattle supplies are modeled at the county level, and packing plants' location, capacity, and ownership are taken as given. Packers procure negotiated cattle by competing in prices in each local (county)
GianCarlo Moschini, T. Jake Smith
wiley +1 more source
Tetris Tight Frames Construction via Hadamard Matrices
We present a new method to construct unit norm tight frames by applying altered Hadamard matrices. Also we determine an elementary construction which can be used to produce a unit norm frame with prescribed spectrum of frame operator.
A. Abdollahi, M. Monfaredpour
doaj +1 more source
Abstract Hidden Markov diagnostic classification models capture how students' cognitive attributes evolve over time. This paper introduces a Bayesian Markov chain Monte Carlo algorithm for diagnostic classification models that jointly estimates time‐varying Q matrices, latent attributes, item parameters, attribute class proportions and transition ...
Chen‐Wei Liu
wiley +1 more source
In this work, the Caputo-type Hadamard fractional derivative is utilized to introduce a coupled system of time fractional Klein–Gordon-Schrödinger equations.
M.H. Heydari, M. Razzaghi
doaj +1 more source

