We present a version of quantum hash functions based on non-binary discrete functions. The proposed procedure is 'classical-quantum', that is, it takes classical bit string as an input and produces state. resulting function has the property one-way (pre-image resistance); in addition properties analogous to cryptographic second pre-image resistance collision resistance.

In the paper we define a notion of resistant quantum hash function which combines pre-image (one-way) resistance and collision resistance. setting one-way property are correlated: "more" is "less" it vice versa. We present an explicit "balanced" demonstrate how to build large family balanced functions.

Rusins Freivalds was one of the first researchers who introduced methods (later called fingerprinting) for constructing efficient classical randomized and quantum algorithms.Fingerprinting cryptographic hashing have quite different usages in computer science, but similar properties.Interpretation their properties is determined by area usage: fingerprinting are algorithms computational problems, while central cryptographical primitives.Fingerprinting being developed from mid previous century,...

In the paper we develop a method for constructing quantum algorithms computing Boolean functions by ordered read-once branching programs (quantum OBDDs). Our is based on fingerprinting technique and representation of their characteristic polynomials. We use circuit notation desired presentation. For several known our approach provides optimal QOBDDs. Namely consider such as Equality, Palindrome, Permutation Matrix Test. also propose generalization apply it to variant Hidden Subgroup Problem.

Research results of signal formation peculiarities in autodyne short-range radars with linear frequency modulation by non-symmetric saw-tooth law are presented. Calculation expressions for signals obtained the general case arbitrary delay time reflected emission. Temporal and spectral diagrams defined cases when its period duration is much more than emission, as well this inequality not satisfied. Experimental investigations performed using oscillator on Gunn diode 8mm-range, which...

In this paper we consider an application of the recently proposed quantum hashing technique for computing Boolean functions in communication model. The combination binary on non-binary hash function is done via polynomial presentation, which have called a characteristic function. Based presentation and present method one-way model, where one parties performs his computations sends message to other party, who must output result after part computations. Some results are also true more...

Research results of signal formation peculiarities in the autodyne short-range radar system with a frequency modulation are presented. Expressions for calculation obtained general case arbitrary delay time reflected emission at symmetric saw-tooth law modulation. The plots drawn cases when its period duration is much more than as well this inequality does not satisfy. Experimental an oscillator on 8mm-range Gunn diode.

Abstract A new version of quantum hashing technique is developed wherein a hash constructed as sequence single-photon high-dimensional states (qudits). proof-of-principle implementation the protocol using orbital-angular momentum encoding single photons implemented. It shown that number qudits decreases with increase their dimension for an optimal ratio between collision probability and decoding hash. Thus, increasing information carriers makes more efficient.

In this paper we review our current results concerning the computational power of quantum read-once branching programs. First all, based on circuit presentation programs and variant fingerprinting technique, show that any Boolean function with linear polynomial can be computed by a program using relatively small (usually logarithmic in size input) number qubits. Then described class functions is closed under projections.

Bitcoin and blockchain in general is a hot topic nowadays. In the paper we propose quantum empowering of this technology show how to speed-up mining procedure using modified Grover's algorithm.

Quantum hashing is a promising generalization of the cryptographic concept on quantum domain. In this paper, we construct hash via sequence single-photon states and perform proof-of-principle experiment using orbital angular momentum (OAM) encoding. We experimentally verify collision resistance function depending number qubits in use. Based these results, conclude that theoretical estimates are confirmed for different bases OAM proposed technique can be useful computational scenarios. The...

Abstract In this work, the analysis and generalization of data on elemental, phase surface composition, crystal structure microstructure MFI-type HZSM-5 with Si/Al = 12, 25, 40, 300 were presented. Relationships between silicate modulus (Si/Al) pore volume, specific surface, area framework voids established. Data obtained by electron microscopy energy dispersive X-ray microanalysis explained discrepancy real composition initial one. Samples maximum content Brønsted (HZSM-5 25) Lewis 12) acid...

This article describes artificial neural network use case for named entity recognition text obtained through audio interfaces. The efficiency of the training method based on modified data set was shown.