Exact dynamics of single-qubit-gate fidelities under the measurement-based quantum computation scheme

Measurement-based quantum computation is an efficient model to perform universal computation. Nevertheless, theoretical questions have been raised, mainly with respect to realistic noise conditions. In order to shed some light on this issue, we evaluate the exact dynamics of some single-qubit-gate fidelities using the measurement-based quantum computation scheme when the qubits which are used as a resource interact with a common dephasing environment. We report a necessary condition for the fidelity dynamics of a general pure N-qubit state, interacting with this type of error channel, to present an oscillatory behavior, and we show that for the initial canonical cluster state, the fidelity oscillates as a function of time. This state fidelity oscillatory behavior brings significant variations to the values of the computational results of a generic gate acting on that state depending on the instants we choose to apply our set of projective measurements. As we shall see, considering some specific gates that are frequently found in the literature, the fast application of the set of projective measurements does not necessarily imply high gate fidelity, and likewise the slow application thereof does not necessarily imply low gate fidelity. Our condition for the occurrence of the fidelity oscillatory behavior shows that the oscillation presented by the cluster state is due exclusively to its initial geometry. Other states that can be used as resources for measurement-based quantum computation can present the same initial geometrical condition. Therefore, it is very important for the present scheme to know when the fidelity of a particular resource state will oscillate in time and, if this is the case, what are the best times to perform the measurements.

Entropy effect in quantum computing and information: an open-source environment simulation

The technologies are rapidly developing, but some of them present in the computers, as for instance their processing capacity, are reaching their physical limits. It is up to quantum computation offer solutions to these limitations and issues that may arise. In the field of information security, encryption is of paramount importance, being then the development of quantum methods instead of the classics, given the computational power offered by quantum computing. In the quantum world, the physical states are interrelated, thus occurring phenomenon called entanglement. This study presents both a theoretical essay on the merits of quantum mechanics, computing, information, cryptography and quantum entropy, and some simulations, implementing in C language the effects of entropy of entanglement of photons in a data transmission, using Von Neumann entropy and Tsallis entropy.

Ensaios sobre computação e informação quânticas: fundamentação e simulações sobre o efeito da entropia

Pós-graduação em Ciência da Computação - IBILCE

Hipercomplexos: um estudo da analicidade e da hiperperiodicidade de funções octoniônicas

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Protecting the root SWAP operation from general and residual errors by continuous dynamical decoupling

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Computational speed-up with a single qudit

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Protecting the √SWAP operation from general and residual errors by continuous dynamical decoupling

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Protecting the √SWAP operation from general and residual errors by continuous dynamical decoupling

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Transporte eletrônico em estruturas híbridas: uma aproximação usando funções de green de não-equílibrio

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Teoria quântica da computação

This undergraduate thesis aims formally define aspects of Quantum Turing Machine using as a basis quantum finite automata. We introduce the basic concepts of quantum mechanics and quantum computing through principles such as superposition, entanglement of quantum states, quantum bits and algorithms. We demonstrate the Bell's teleportation theorem, enunciated in the form of Deutsch-Jozsa definition for quantum algorithms. The way as the overall text were written omits formal aspects of quantum mechanics, encouraging computer scientists to understand the framework of quantum computation. We conclude our thesis by listing the Quantum Turing Machine's main limitations regarding the well-known Classical Turing Machines

Gravitational and quantum bounds on the photon mass

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Fluctuating dimension in a discrete model for quantum gravity based on the spectral principle

The spectral principle of Connes and Chamseddine is used as a starting point to define a discrete model for Euclidean quantum gravity. Instead of summing over ordinary geometries, we consider the sum over generalized geometries where topology, metric, and dimension can fluctuate. The model describes the geometry of spaces with a countable number n of points, and is related to the Gaussian unitary ensemble of Hermitian matrices. We show that this simple model has two phases. The expectation value , the average number of points in the Universe, is finite in one phase and diverges in the other. We compute the critical point as well as the critical exponent of . Moreover, the space-time dimension delta is a dynamical observable in our model, and plays the role of an order parameter. The computation of is discussed and an upper bound is found, < 2.

Quantum Aspects of Solitons and Deformations on Ad'S IND. 4'x C'P POT.3' ('S POT. 7')

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)