Publications
Selected publications of Farid Ablayev
See more at
- Ablayev F. and Vasiliev A.
On the Computation of Boolean Functions by Quantum Branching Programs via Fingerprinting.
Electronic Colloquium on Computational Complexity, 2008, Report TR08-059
- Ablayev F.
Classical simulation complexity of bounded-error and unbounded-error quantum branching programs.
Workshop on Probabilistic and Quantum Automata, 2007, Turku, Finland.
( Satellite Workshop of International Conference Development in Language Theory (DLT) 2007).
Proceddings.
- Ablayev F. On computational power of classical and quantum branching programs
Symp.on Quantum Informatics 2005, Proc. of the Int. Society for Optical Engineering, 2006, Vol:6264.
- Ablayev F. The Complexity of Classical and Quantum Branching Programs: A Communication
Complexity Approach.
SAGA2005, Springer-Verlag, LNCS3777, pp.190-201, 2005.
- F.Ablayev, A.Gainutdinova, M.Karpinski, Ch.Moore, Ch.Pollett. On the computational
power of probabilistic and quantum branching program.
Information and Computation, 203(2)
145-162(2005)
- F.Ablayev, A.Gainutdinova. Complexity of quantum uniform and nonuniform automata.
In
Proc.: Int. Conf. on Developments in Language Theory (DLT2005), Springer, LNCS3572,
p.78-87,2005.
- Ablayev F. Comparative power of quantum and classical computation models.
Symposium
Quantum Informatics 2004, Proc. of the Int. Society for Optical Engineering, 2005, v.5833,
p.100-108.
- Ablayev F. On complexity of classical and quantum models of computations
Mathematica
Problems of Cybernetics, 13, 2004, p.137-146 (In Russian).
- F.Ablayev On comparative computational power of classical and quantum branching programs
Max-Planck Insitute for Mathematics Bonn, Preprint Series 2003 (02), 22p.
- Ablayev F., Karpinski M. A lower bound for integer multiplication on randomuzed ordered
read-once branching programs.
Information and Computation, 186(1), 78-89, (2003).
- Ablayev F., Gainutdinova A. Classical Simulation Complexity of Quantum Machines.
InProc.:
14th FCT 2003, Sweden, Springer-Verlag, LNCS 2751, p.296-302, 2003.
- F.Ablayev, C.Moore, C.Pollett Quantum and Stochastic Branching Programs of Bounded
Width
In Proc.: ICALP’02, Springer-Verlag, LNCS, pp. 343-354.
See also Electronic Colloquium on
Computational Complexity, TR02-013, 2002
- Ablayev F., Gainutdinova A., Karpinski M. On Computational Power of Quantum Branching
Programs.
Preprint-Math. Sciences Research Inst.(MSRI), Berkely, USA, N 2002-028, 20 p.,
2002.
- F.Ablayev, A.Gainutdinova, M.Karpinski On Computational Power of Quantum Branching
Programs
In Proc.: 25th Int. FCT’2001, Springer-Verlag, pp.59-70, 2001.
- F.Ablayev, S.Ablayeva A Discrete Approximation and Communication Complexity Approach
to the Superposition Problem
In Proc.: 25th Int.FCT’2001, Springer-Verlag, pp.47-58, 2001.
- F.Ablayev On Complexity of Regular(1,+k)-BranchingPrograms
In Proc.: Satellite Workshops of ICALP’2000, pp.229-240,2000
- F. Ablayev, A.Gainutdinova On the Lower Bounds for One-Way Quantum Automata
In
Proc.: 25th Int.Sym.,Mathematical Foundations of Computer Science(MFCS’00), Springer,
pp.132-140,2000.