No full-text available
To read the full-text of this research,
you can request a copy directly from the authors.
Stroboscopic scheme with application to the Hamiltonian with n-body interactions
ResearchGate has not been able to resolve any citations for this publication.
In this report is proposed an approach for constructing a quantum circuit, containing O(𝑛2) Toffoli gates, CNOT gates and single qubit gates that implements а 𝐶𝑛(X) gate for n > 3, without using work qubits. For solving the problem is constructed a 𝐶𝑛 𝑁𝑁𝑁 gate from linear number of Toffoli gates and single qubit gates, without using ancilla bits.
in this research are offered two versions of an algorithm for superdense encoding of а 4-dimensional qubit vector. The algorithm for switching of 4-bit packages in a full quantum network with multiple network nodes includes superdense encoding and is implemented as quantum logic circuit. The proposed two algorithmic solutions and the applied quantum circuit open new perspectives for more effective methods for establishment of a full quantum switching network.
The productivity of the computation systems is determined to a high degree by the speed of multiplication, which is а basic element in multiple applications for digital signal processing, quantum computations, etc. The various approaches for design of asymptotically rapid algorithms for multiplication have developed in parallel with the evolution of the effective multiplicator architectures. This article examines different approaches for optimal rapid multiplication..
This report describes an approach for encoding and decoding of discrete information about basic states at the input of operators in the phase of their outputs. The decoding is considered as a special case of interference with four different forms of decoding that reflect the classes of identity and negation operators. If an operator decode another, he is able to read the information encoded in the phase space, and reduce the encoded bits to state or its negation. Decoding relationships have been developed both as regards the parameters of the operator and in terms of Boolean functions encoding. This further leads to an increase in the level of abstraction. The approach of the proposed system differs from previous discussions of phase encoding, making encoding a substantial part of all operators so that the correct encoded information can be determined from the parameters of the operators.
This report describes an approach for representation of quantum entanglement through state matrix. The proposed approach could be used to allow encoding of more information. The Singular Value Decomposition is useful as a measure for entanglement because the unitary operations preserve it.
In this report is examined an algorithm for ensuring a spare quantum traffic, which requires the exchange of only one pair of qubits in order to be reached to a solution of the problem related to ensuring a spare traffic. Here we show two different approaches of the unitary dynamics that can enable the directional control, enhancement, and suppression of quantum transport. This opens new prospects for more efficient methods to transport a quantum information.
This paper present a divide based simultable quantum circuit for spatial optimized coding, which is using only elementary quantum gates. The proposed approach provides the techniques for spatial optimized quantum algorithms. This approach might be useful only as a tool for spatial optimization of quantum algorithms, it is not particularly valuable for saving bandwidth.
In this report is examined the construction of controlled operators, that include more than one control or target bit. In the research is examined a general class of n qubit operators, that use one or more control bits to conditionally apply an operator to a single target qubit. The conditional nature of these operators is controlled by a boolean function f, that acts on a set of control bits C.
in this report is considered the construction of n qubit circuits through the addition of n qubits as a quantum register, at which each bit is a set index in a range from 0 to n - 1. The index of the bit complies with its significance within the space of the classical state. An indexed formalized operator is presented, that extends the single qubit operator to a n qubit operator, that acts to an individual qubit.
In this report is considered the generalization of the principles, which manage the formalization of controlled qubit operators. The research builds on the standard external data sources, for development of a generalized system for conditional operators. Certain controlled operators are viewed as linear combinations of universal operators. This system provides a generalized scheme for the type of the controlled operators, which could be encountered in a circuit, composed entirely of elementary operators.
In this report is examined the generalization of the principles, that control the formalization of a single qubit operator. The set of the identical operators is used in order to be captured the types of operators, occurring at the application of negating operators in the n qubit space.
This report describes an approach for encoding and decoding of discrete information about basic states at the input of operators in the phase of their outputs. The decoding is considered as a special case of interference with four different forms of decoding that reflect the classes of identity and negation operators. If an operator decode another, he is able to read the information encoded in the phase space, and reduce the encoded bits to state or its negation. Decoding relationships have been developed both as regards the parameters of the operator and in terms of Boolean functions encoding. This further leads to an increase in the level of abstraction. The approach of the proposed system differs from previous discussions of phase encoding, making encoding a substantial part of all operators so that the correct encoded information can be determined from the parameters of the operators.
This article is focused on the creation of own algorithm for simulation of spectral diffraction of probabilistic distributions (SDPD) in the developed for the needs of this research interactive environment for simulation of quantum algorithms. The quantum spectral diffraction of probabilistic distributions is algorithm for transformation of probabilistic distributions, designed for implementation in quantum computers and it is exponentially faster compared to the classic computer for the case when it is applicable.
The Boolean functions are a classic way for capturing one of the most basic computations. In this dissertation they are used as a means for specifying an information which is coded in the phase space of a quantum state. This, in turn, may serve for understanding of key examples of disturbance at quantum calculations based on the chain model. Here are examined the main properties and algebraic structures of single qubit Boolean functions and their composition, the combination of primitive Boolean functions with the operator for excluding or, ⊕ , as well as the expression of these functions and their negation as an expression, using ⊕ and B = {0, 1}, the set of the single-byte strings.
The formalization of qubit operators has two main objectives. The first one is to present all qubit operators as linear combinations of 〖Ехt〗_1 and 〖Nехt〗_1, i.e. identity and negation. Both classes are analogous to the classic operators and therefore the formalization of single qubit operators with these classes, acting as main operators, provides means for operation with primitive operators, set in the classical concepts for calculations. The second objective is to be separated the parts of the phase of the state to be separated from those of the amplitude in such a way, so as to be set out the key models at the disturbance, generated by the operators.
A central component of the quantum calculations is the logical summary of the classic concept for the operators for identity and negation. The characteristic of the quantum states and operators, based on this summary, is in the basis of the logic of the formalized qubit operators. In this report is examined the general idea for the states of identity and negation. Also specific examples from these classes are discussed.
Preface; 1. Overview; 2. Structure and scattering; 3. Thermodynamics and
statistical mechanics; 4. Mean-field theory; 5. Field theories, critical
phenomena, and the renormalization group; 6. Generalized elasticity; 7.
Dynamics: correlation and response; 8. Hydrodynamics; 9. Topological
defects; 10. Walls, kinks and solitons; Glossary; Index.
From the Publisher:From 1983 to 1986, the legendary physicist and teacher Richard Feynman gave a course at Caltech called "Potentialities and Limitations of Computing Machines." Although the lectures are over ten years old, most of the material is timeless and presents a "Feynmanesque" overview of many standard and some not-so-standard topics in computer science. These include compatibility, Turing machines (or as Feynman said, "Mr. Turing's machines"), information theory, Shannon's Theorem, reversible computation, the thermodynamics of computation, the quantum limits to computation, and the physics of VLSI devices. Taken together, these lectures represent a unique exploration of the fundamental limitations of digital computers. Feynman's philosophy of learning and discovery comes through strongly in these lectures. He constantly points out the benefits of playing around with concepts and working out solutions to problems on your own - before looking at the back of the book for the answers. As Feynman says in the lectures: "If you keep proving stuff that others have done, getting confidence, increasing the complexities of your solutions - for the fun of it - then one day you'll turn around and discover that nobody actually did that one! And that's the way to become a computer scientist."
Dynamic simulation of quantum stochastic walk
- Nikolay Raychev
Nikolay Raychev. Dynamic simulation of quantum
stochastic walk. International jubilee congress (TU), 2012.
Connecting sets of formalized operators1474‐1476. DOI:10Quantum Tunneling of Magnetisation
- Nikolay Raychev
Nikolay Raychev. Connecting sets of formalized operators. In
International Journal of Scientific and Engineering Research
05/2015; 6(5):1474‐1476. DOI:10.14299/ijser.2015.05.002, 2015.
[25] N. V. Prokof'ev, P. C. E. Stamp, pp. 347 371 in ''Quantum
Tunneling of Magnetisation: QTM'94 '', ed. L. Gunther, B. Barbara
(Kluwer, 1995).
The fluctuation dissipation theorem is explained in, ePrinciples of Condensed Matter Physics
- P M Chaikin
- T C Lubensky
The fluctuation dissipation theorem is explained in,
e.g., P. M. Chaikin, T. C. Lubensky, ''Principles of Condensed
Matter Physics'', C.U.P. (1995).
Abstract and Applied Analysis 11 Nikolay Raychev Mathematical approaches for modified quantum calculation
- Nikolay Raychev
- Reply
Nikolay Raychev. Reply to "The classical-quantum boundary for
correlations: Discord and related measures". Abstract and Applied
Analysis 11/2014; 94(4): 1455-1465, 2015.
[45] Nikolay Raychev. Mathematical approaches for modified
quantum calculation. International Journal of Scientific and
Engineering Research 09/2015; 6(8):1302. doi:10.14299/
ijser.2015.08.006, 2015.
[46] N. Aliaga Alcalde, R. S. Edwards, S. O. Hill, W.
Wernsdorfer, K. Folting and G. Christou, J. Am. Chem. Soc., 2004,
126, 12503 12516.
- Jelzko
Jelzko et al., Phys. Rev. Lett., 2004, 93, 130501; T. Gaebel
et al., Nature Phys., 2006, 2, 408; M. V. G. Dutt et al.,
Science, 2007, 316, 1312.
- A Morello
- P C E Stamp
A. Morello and P. C. E. Stamp, Phys. Rev. Lett., 2006, 97,
207206.
- N V Prokof 'ev
- P C E Stamp
N. V. Prokof'ev and P. C. E. Stamp, J. Low Temp. Phys, 1996,
104, 143.
- F Jelzko
F. Jelzko et al., Phys. Rev. Lett., 2004, 92, 76401; F.
- K Wernsdorfer
- G Folting
- J Christou
- W Bagai
- K A Wernsdorfer
- G Abboud
- E Christou Ramsey
- S Del Barco
- S J Hill
- C C Shah
- D Beedle
- F K Hendrickson
- E J L Larsen
Wernsdorfer, K. Folting and G. Christou, J. Am. Chem. Soc., 2004,
126, 12503 12516.
[47] R. Bagai, W. Wernsdorfer, K. A. Abboud and G. Christou, J. Am.
Chem. Soc., 2007, 129, 12918 12919.
[48] C. M. Ramsey, E. del Barco, S. Hill, S. J. Shah, C. C. Beedle and
D. Hendrickson, Nature Physics, 2008, 4, 277 281.
[49] F. K. Larsen, E. J. L. McInnes, H. El Mkami, J. Overgaard,
S. Piligkos, G. Rajaraman, E. Rentschler, A. A. Smith, G.
- Y Nakamura
Y. Nakamura et al., Nature, 1999, 398, 786; C. H. van
der Wal et al., Science, 2000, 290, 773; D. Vion et
al., Science, 2002, 296, 886; M. Steffen et al., Science,
2006, 313, 1423.
- A Morello
A. Morello et al., Phys. Rev. Lett., 2004, 93, 197202; A. Morello
and J. de Jongh, Phys. Rev., 2007, B76, 184425.
- A Einstein
- B Podolsky
- A Rosen
A. Einstein, B. Podolsky and A. Rosen, Phys. Rev.,
1935, 47, 777.
- A P Hines
- P C E Stamp
A. P. Hines and P. C. E. Stamp, Phys. Rev A, 2007,
75, 062321.
- M Schechter
- P C E Stamp
M. Schechter and P. C. E. Stamp, Phys. Rev. Lett, 2005, 95,
267208; M. Schechter and P. C. E. Stamp, Phys. Rev. B, 2008, 78,
054438.
- R P Feynman
- F L Vernon
R. P. Feynman and F. L. Vernon, Ann. Phys., 1963, 24, 118.
- A O Caldeira
- A J Leggett
A. O. Caldeira and A. J. Leggett, Ann. Phys., 1983, 149, 374.
- P W Anderson
P. W. Anderson, Phys. Rev., 1958, 109, 1492.
- P C E Stamp
- I S Tupitsyn
P. C. E. Stamp and I. S. Tupitsyn, Phys. Rev. B, 2004, 69,
014401.
- N V Prokof 'ev
- P C E Stamp
N. V. Prokof'ev and P. C. E. Stamp, J. Phys CM, 1993, 5, L663.
- M Dubeánd
- P C E Stamp
M. Dubeánd P. C. E. Stamp, Chem. Phys., 2001, 268, 257. 29
371 in ''Quantum Tunneling of Magnetisation: QTM'94
- N V Prokof 'ev
- P C E Stamp
N. V. Prokof'ev, P. C. E. Stamp, pp. 347 371 in ''Quantum
Tunneling of Magnetisation: QTM'94 '', ed. L. Gunther, B. Barbara
(Kluwer, 1995).
Classical simulation of quantum algorithms
- Nikolay Raychev
Nikolay Raychev. Classical simulation of quantum
algorithms. International jubilee congress (TU), 2012.