Periodic graphs.
Perturbation approach for nuclear magnetic resonance solid-state quantum computation.
QR factorizations using a restricted set of rotations.
Quantum computational structures
Quantum computing in decoherence-free subspace constructed by triangulation.
Quantum copying: a review.
Quantum entanglement and projective ring geometry.
Quantum finite automata with control language
Bertoni et al. introduced in Lect. Notes Comput. Sci.2710 (2003) 1–20 a new model of 1-way quantum finite automaton (1qfa) called 1qfa with control language (1qfc). This model, whose recognizing power is exactly the class of regular languages, generalizes main models of 1qfa's proposed in the literature. Here, we investigate some properties of 1qfc's. In particular, we provide algorithms for constructing 1qfc's accepting the inverse homomorphic images and quotients of languages accepted...
Quantum states satisfying classical probability constraints
For linear combinations of quantum product averages in an arbitrary bipartite state, we derive new quantum Bell-form and CHSH-form inequalities with the right-hand sides expressed in terms of a bipartite state. This allows us to specify bipartite state properties sufficient for the validity of a classical CHSH-form inequality and the perfect correlation form of the original Bell inequality for any bounded quantum observables. We also introduce a new general condition on a bipartite state and quantum...
The tripartite separability of density matrices of graphs.
Time and space complexity of reversible pebbling
This paper investigates one possible model of reversible computations, an important paradigm in the context of quantum computing. Introduced by Bennett, a reversible pebble game is an abstraction of reversible computation that allows to examine the space and time complexity of various classes of problems. We present a technique for proving lower and upper bounds on time and space complexity for several types of graphs. Using this technique we show that the time needed to achieve optimal space for...
Time and space complexity of reversible pebbling
This paper investigates one possible model of reversible computations, an important paradigm in the context of quantum computing. Introduced by Bennett, a reversible pebble game is an abstraction of reversible computation that allows to examine the space and time complexity of various classes of problems. We present a technique for proving lower and upper bounds on time and space complexity for several types of graphs. Using this technique we show that the time needed to achieve optimal space for...
Two versions of the projection postulate: from EPR argument to one-way quantum computing and teleportation.