Some researchers suggest achieving massive speedups in computing by exploiting quantum-mechanical effects such as superposition (quantum parallelism) and entanglement.1 A quantum algorithm typically consists of applying quantum gates to quantum states, but because the input to the algorithm might be normal classical bits (or nonquantum), it affects only the selection of quantum gates. After all...

the rank-k numerical range has a close connection to the construction of quantum error correction code for a noisy quantum channel. for noisy quantum channel, a quantum error correcting code of dimension k exists if and only if the associated joint rank-k numerical range is non-empty. in this paper the notion of joint rank-k numerical range is generalized and some statements of [2011, generaliz...

A general consideration to the Hamiltonian for quantum searching is undertaken in this work. We have established the matching condition to a certaint searching and derived an ideal Hamiltonian. We also show that this Hamiltonian can be resuced to all known quantum searching Hamiltonians. A quantum mechanical algorithm is a complete and straightforward set of directions, based on the quntum phys...

quantum organizations are referred where stakeholders know how to access the infinite potential of the quantum field. viewing healthcare organizations from perspective of quantum theory suggest new approaches into management techniques for effective and efficient delivery of healthcare services. this research is aimed to determine the quantum skills, quantum leadership characteristics and funct...

It is often said that the strength of quantum computation lies in the phenomena of quantum superposition and quantum entanglement. These features of quantum computation allow to perform the computation on all possible inputs that fit to the quantum register. One of the greatest achievements in the theory of quantum algorithms is quantum search algorithm introduced by Grover. The detailed descri...

Because of inevitable coupling with the environment, nearly all practical quantum systems are open system, where the evolution is not necessarily unitary. In this paper, we propose a duality quantum algorithm for simulating Hamiltonian evolution of an open quantum system. In contrast to unitary evolution in a usual quantum computer, the evolution operator in a duality quantum computer is a line...