Электронный архив

Просмотр по автору "Ablayev F."

Просмотр по автору "Ablayev F."

Отсортировать по:Сортировать:Результаты поиска на странице:

  • A communication approach to the superposition problem 
    Ablayev F.; Ablayeva S. (2010)
    In function theory the superposition problem is known as the problem of representing a continuous function f(x1,... ,xk) in k variables as the composition of "simpler" functions. This problem stems from the Hilbert's ...
  • Classical and quantum parallelism in the quantum fingerprinting method 
    Ablayev F.; Vasiliev A. (2011)
    In this paper we focus on how the classical and quantum parallelism are combined in the quantum fingerprinting technique we proposed earlier. We also show that our method can be used not only to efficiently compute Boolean ...
  • Classical simulation complexity of quantum machines 
    Ablayev F.; Gainutdinova A. (2003)
    We present a classical probabilistic simulation technique of quantum Turing machines. As a corollary of this technique we obtain several results on relationship among classical and quantum complexity classes such as: PrQP ...
  • Comparative power of quantum and classical computation models 
    Ablayev F. (2005)
    In the talk we present results on comparitve power of classical and quantum computational models. We focus on two well known in Computer Science models: finite automata which is known as uniform computational model and ...
  • Complexity of quantum uniform and nonuniform automata 
    Ablayev F.; Gainutdinova A. (2005)
    We present two different types of complexity lower bounds for quantum uniform automata (finite automata) and nonuniform automata (OBDDs). We call them "metric" and "entropic" lower bounds in according to proof technique ...
  • Computing boolean functions via quantum hashing 
    Ablayev F.; Vasiliev A. (2014)
    © Springer International Publishing Switzerland 2014. In this paper we show a computational aspect of the quantum hashing technique. In particular we apply it for computing Boolean functions in the model of read-once quantum ...
  • Cryptographic quantum hashing 
    Ablayev F.; Vasiliev A. (2014)
    We present a version of quantum hash functions based on non-binary discrete functions. The proposed quantum procedure is 'classical-quantum', that is, it takes a classical bit string as an input and produces a quantum ...
  • Extension of the hierarchy for k-OBDDs of small width 
    Ablayev F.; Khadiev K. (2013)
    In this paper we explore the well-known k-OBDD model of branching programs. We develop a method of representation of the k-OBDD computation process as an "automata-communication protocol" computation process. Our method ...
  • Integrated-Optics Quantum Processor Based on Entangled Photons in Coupled Cavities 
    Ablayev F.; Andrianov S.; Moiseev S.; Vasiliev A. (2020)
    © 2020 IEEE. We propose a scheme of the universal quantum processing unit based on integrated optic waveguide excitation transfer of qubits between optical micro-resonators and Kerr nonlinear interaction between neighboring ...
  • Lower bounds for one-way probabilistic communication complexity and their application to space complexity 
    Ablayev F. (1996)
    We prove three different types of complexity lower bounds for the one-way unbounded-error and bounded-error error probabilistic communication protocols for boolean functions. The lower bounds are proved in terms of the ...
  • Model of a quantum processing device and a quantum programming framework 
    Ablayev F.; Fetisov D.; Terentyev A.; Urmanchev A.; Vasiliev A. (2017)
    © SGEM2017. All rights reserved. We propose a model of a programmable quantum processing device realizable with existing nanophotonic technologies and which can be viewed as a basis for new high performance hardware ...
  • Multi-qubit controlled NOT gates for artificial intelligence natural languages processing 
    Ablayev F.; Andrianov S.; Andrianova N.; Kalachev A.; Vasiliev A. (2019)
    © 2019 SPIE. Natural language processing is efficient using quantum neural networks including multiqubit controlled NOT gates with multiple control qubits and a single target qubit. We propose here a photonic miltiqubit ...
  • On BPP versus NP ∪ coNP for ordered read-once branching programs 
    Ablayev F.; Karpinski M.; Mubarakzjanov R. (2001)
    We investigate the relationship between probabilistic and nondeterministic complexity classes PP, BPP, NP and coNP with respect to ordered read-once branching programs (OBDDs). We exhibit two explicit Boolean functions ...
  • On classical simulation of quantum machines 
    Ablayev F.; Gainutdinova A. (2005)
    We present a classical probabilistic simulation technique of quantum Turing machines. As a corollary of this technique we obtain several results on relationship among classical and quantum complexity classes such as: PrQP ...
  • On computational power of classical and quantum Branching programs 
    Ablayev F. (2006)
    We present a classical stochastic simulation technique of quantum Branching programs. This technique allows to prove the following relations among complexity classes: PrQP-BP ⊆ PP-BP and BQP-BP ⊆ PP-BP. Here BPP-BP and ...
  • On quantum methods for machine learning problems part I: Quantum tools 
    Ablayev F.; Ablayev M.; Huang J.Z.; Khadiev K.; Salikhova N.; Wu D. (2020)
    © 2020 The author(s). This is a review of quantum methods for machine learning problems that consists of two parts. The first part, "quantum tools", presents the fundamentals of qubits, quantum registers, and quantum states, ...
  • On quantum methods for machine learning problems part II: Quantum classification algorithms 
    Ablayev F.; Ablayev M.; Huang J.Z.; Khadiev K.; Salikhova N.; Wu D. (2020)
    © 2020 The author(s). This is a review of quantum methods for machine learning problems that consists of two parts. The first part, "quantum tools", presented some of the fundamentals and introduced several quantum tools ...
  • On the balanced quantum hashing 
    Ablayev F.; Ablayev M.; Vasiliev A. (2016)
    In the paper we define a notion of a resistant quantum hash function which combines a notion of pre-image (one-way) resistance and the notion of collision resistance. In the quantum setting one-way resistance property and ...
  • On the computational power of probabilistic and quantum branching program 
    Ablayev F.; Gainutdinova A.; Karpinski M.; Moore C.; Pollett C. (2005)
    In this paper, we show that one-qubit polynomial time computations are as powerful as NC1 circuits. More generally, we define syntactic models for quantum and stochastic branching programs of bounded width and prove upper ...
  • On the concept of cryptographic quantum hashing 
    Ablayev F.; Ablayev M. (2015)
    © 2015 Astro Ltd. In the letter we define the notion of a quantum resistant ((ε, δ)-resistant) hash function which consists of a combination of pre-image (one-way) resistance (ε-resistance) and collision resistance ...

Поиск в электронном архиве

Просмотр

Моя учетная запись