Neste trabalho apresentamos um novo algoritmo quântico eficiente para o Problema do Subgrupo Oculto (PSO) sobre uma classe especial de grupos metacíclicos, Z_p times Z_q^s, com q | (p-1) e p/q= poli(log p), onde p, q são números primos ímpares distintos e s um inteiro positivo qualquer. Em um contexto mais geral, sem impor uma relação entre p e q obtemos um algoritmo quântico com complexidade de tempo 2^{O(sqrt{log p})}. Em qualquer caso, esses resultados são melhores que qualquer algoritmo clássico para o mesmo fim, cuja complexidade é Omega(sqrt{p}). Apresentamos também, algoritmos quânticos para o PSO sobre grupos não abelianos de ordem 2^{n+1} que possuem subgrupos cíclicos de índice 2 e para certos produtos semidiretos de grupos Z_N^m times Z_p, com m, N inteiros positivos e N fatorado de forma especial. / We present a new polynomial-time quantum algorithm that solves the hidden subgroup problem (HSP) for a special class of metacyclic groups, namely Z_{p} times _{q^s}, with q mid (p-1) and p/q= up{poly}(log p), where p, q are any odd prime numbers and s is any positive integer. This solution generalizes previous algorithms presented in the literature. In a more general setting, without imposing a relation between p and q, we obtain a quantum algorithm with time and query complexity 2^{O(sqrt{log p})}. In any case, those results improve the classical algorithm, which needs {Omega}(sqrt{p}) queries. We also present quantum algorithms for the HSP over non-abelian groups of order 2^{n+1} which have a cyclic subgroup of index 2 and for some semidirect product _N^m times _p, where N has a special prime factorization.

Residual dipolar couplings can be used to increase the number of qubits for quantum information processing. We have used molecules containing 3, 5 and 8 spins oriented in a liquid crystal matrix, and exploited the residual dipolar coupling to demonstrate quantum information processing in them. Transition assignment is performed using HET-Z-COSY experiment and qubit addressability is achieved by transition selective pulses. It is expected that using this protocol higher qubits can be achieved. For the implementations reported in this work, evolution under the internal Hamiltonian was not explored. It is however interesting to investigate how effectively the evolution under internal Hamiltonian can be manipulated to implement quantum algorithms in these systems. Recently an approach has been reported in this direction, where a new method of preparing pseudopure states in oriented systems by exciting selected multiple quantum using evolution under effective dipolar Hamiltonian, has been demonstrated [24].

Most quantum algorithms that are efficient as opposed to their equivalent classical algorithms are solving variants of the Hidden Subgroup Problem (HSP), therefore HSP is a central problem in the field of quantum computing. In this thesis, we offer some interesting results about the subgroup and coset structure of certain groups, including the dihedral group. We describe classical algorithms to solve the HSP over various abelian groups and the dihedral group. We also discuss some existing quantum algorithms to solve the HSP and give our own novel algorithms and ideas to approach the HSP for the dihedral groups.

<p>Optimization and Machine learning (ML) have emerged as two positively disruptive methodologies and have thus resulted in unprecedented applications in several domains of technology. In recent years, ML has forayed into physical sciences and provided promising outcomes thanks to its ability in representing and generalizing complex functions to reveal underlying relations among variables describing a system. By casting ML as an optimization task, we first focus on its application in solving quantum many-body problems. Leveraging the power of quantum computation, we develop hybrid quantum machine learning protocols and implement benchmark tests to calculate the band structures of two-dimensional materials. We also show how this method can be used to estimate the critical point for a quantum phase transition. One  hurdle in such techniques is related to parameter optimization, wherein to obtain the desired result, the parameters have to be optimized, which can be computationally intensive. For a particular class of problem and a choice of algorithm, we deduce a simple parameter setting rule. This rule is projected as a heuristic and is validated numerically for several problem instances. Finally, by venturing into thermal photonics, a framework that takes advantage of the spectral and spatial information of hyperspectral thermal images to establish a completely passive machine perception, titled HADAR is presented. A conventional deep neural network is developed that utilizes the governing equation of HADAR and its performance in semantic segmentation is demonstrated. Altogether, this report establishes the need for creative algorithms that exploit modern hardware to solve complex problems that were previously deemed unsolvable.</p>

We explore the paradigm shift in quantum computing and quantum information science, emphasizing the synergy between hardware advancements and algorithm development. Only now have the recent advances in quantum computing hardware, despite a century of quantum mechanics, unveiled untapped potential, requiring innovative algorithms for full utilization. Project 1 addresses quantum applications in radiative reactions, overcoming challenges in many-fermion physics due to imaginary time evolution, stochastic methods like Monte Carlo simulations, and the associated sign problem. The methodology introduces the Electromagnetic Transition System and a general two-level system for computing radiative capture reactions. Project 2 utilizes Variational Quantum Eigensolver (VQE) to address the difficulties in adiabatic quantum computations, highlighting Singular Value Decomposition (SVD) in quantum computing. Results demonstrate an accurate ground state wavefunction match with only a 0.016% energy error. These projects advance quantum algorithm design, error mitigation, and SVD integration, showcasing quantum computing’s transformative potential in computational science.

Made available in DSpace on 2015-03-04T18:51:16Z (GMT). No. of bitstreams: 1 Tese Demerson.pdf: 742439 bytes, checksum: 534128a7d9b5cfc57f84985cd77ac16d (MD5) Previous issue date: 2009-08-28 / We present a new polynomial-time quantum algorithm that solves the hidden subgroup problem (HSP) for a special class of metacyclic groups, namely Z_{p} \rtimes \Z_{q^s}, with q \mid (p-1) and p/q= \up{poly}(\log p), where p, q are any odd prime numbers and s is any positive integer. This solution generalizes previous algorithms presented in the literature. In a more general setting, without imposing a relation between p and q, we obtain a quantum algorithm with time and query complexity 2^{O(\sqrt{\log p})}. In any case, those results improve the classical algorithm, which needs {\Omega}(\sqrt{p}) queries. We also present quantum algorithms for the HSP over non-abelian groups of order 2^{n+1} which have a cyclic subgroup of index 2 and for some semidirect product \Z_N^m \rtimes \Z_p, where N has a special prime factorization. / Neste trabalho apresentamos um novo algoritmo quântico eficiente para o Problema do Subgrupo Oculto (PSO) sobre uma classe especial de grupos metacíclicos, Z_p \rtimes Z_q^s, com q | (p-1) e p/q= poli(log p), onde p, q são números primos ímpares distintos e s um inteiro positivo qualquer. Em um contexto mais geral, sem impor uma relação entre p e q obtemos um algoritmo quântico com complexidade de tempo 2^{O(\sqrt{log p})}. Em qualquer caso, esses resultados são melhores que qualquer algoritmo clássico para o mesmo fim, cuja complexidade é \Omega(\sqrt{p}). Apresentamos também, algoritmos quânticos para o PSO sobre grupos não abelianos de ordem 2^{n+1} que possuem subgrupos cíclicos de índice 2 e para certos produtos semidiretos de grupos Z_N^m \rtimes Z_p, com m, N inteiros positivos e N fatorado de forma especial.

The progess in NMRQIP can be outlined in to four parts.1) Implementation of theoretical protocols on small number of qubits. 2) Demonstration of QIP on various NMR systems. 3) Designing and implementing the algorithms for mixed initial states. 4) Developing the techniques for coherent and decoherent control on higher number(up to 15) of qubits. This thesis contains some efforts in the direction of first three points. Quantum-state discrimination has important applications in the context of quantum communication and quantum cryptography. One of the characteristic features of quantum mechanics is that it is impossible to devise a measurement that can distinguish nonorthogonal states perfectly. However, one can distinguish them with a finite probability by an appropriate measurement strategy. In Chapter 2, we describe the implementation of a theoretical protocol of programmable quantum-state discriminator, on a two-qubit NMR System. The projective measurement is simulated by adding two experiments. This device does the unambiguous discrimination of a pair of states of the data qubit that are symmetrically located about a fixed state. The device is used to discriminate both linearly polarized states and eillipitically polarized states. The maximum probability of successful discrimination is achieved by suitably preparing the ancilla quubit. The last step of any QIP protocol is the readout. In NMR-QIP the readout is done by using density matrix tomography. It was first proposed by Ernst and co-workers that a two-dimensional method can be used to correlate input and output states. This method uses an extra (aniclla) qubit, whose transitions indicate the quantum states of the remaining qubits. The 2D spectrum of ancilla qubit represent the input and output states along F1 and F2 dimensions respectively. However the 2D method requires several t1 increments to achieve the required spectral width and resolution in the indirect dimension, hence leads to large experimental time. In chapter 3, the conventional 2D NMRQIP method is speeded-up by using Hadamard spectroscopy. The Hadamard method is used to implement various two-, three-qubit gates and qutrit gates. We also use Hadamard spectroscopy for information storage under spatial encoding and to implement a parallel search algorithm. Various slices of water sample can be spatially encoded by using a multi-frequency pulse under the field gradient. Thus the information of each slice is projected to the frequency space. Each slice represents a classical bit, where excitation and no excitation corresponds to the binary values 0 and 1 respectively. However one has to do the experiment for each binary information, by synthesizing a suitable multi-frequency pulse. In this work we show that by recording the data obtained by various Hadamard encoded multi-frequency pulses, one can suitably decode it to obtain any birnary information, without doing further experiments. Geometric phases depend only on the geometry of the path executed in the projective Hilbert space, and are therefore resilient to certain types of errors. This leads to the possibility of an intrinsically fault-tolerant quantum computation. In liquid state NMRQIP. Controlled phase shift gates are achieved by using qubit selective pulses and J evolutions, and also by using geometir phases. In order to achieve higher number of qubits in NMR, one explores dipolar couplings which are larger in magnitude, yielding strongly coupled spectra. In such systems since the Hamiltonian consists of terms, it is difficult to apply qubit selective pulses. However such systems have been used for NMRQIP by considering 2n eigen states as basis states of an n-qubit system. In chapter 4, it is shown that non-adiabatic geometric phases can be used to implement controlled phase shift gates in strongly dipolar coupled systems. A detailed theoretical explanation of non-adiabatic geometric phases in NMR is given, by using single transition operators. Using such controlled phase shift gates, the implementation of Deutsch-Jozsa and parity algorithms are demonstrated. Search algorithms play an important role in the filed of information processing. Grovers quantum search algorithm achieves polynomial speed-up over the classical search algorithm. Bruschweiler proposed a Liouville space search algorithm which achieve polymonial speed-up. This algorithm requires a weakly coupled system with a mixed initial state. In chapter 5 we modified the Bruschweiler’s algorithm, so that it can be implemented on a weakly as well as strongly coupled system. The experiments are performed on a strongly dipolar coupled four-qubit system. The experiments from four spin-1/2 nuclei of a molecule oriented in a liquid crystal matrix. Chapter 6 describes the implementation of controlled phase shift gates on a quadrupolar spin-7/2 nucleus, using non-adiabatic geometric phases. The eight energy levels of spin-7/2 nucleus, form a three qubit system. A general procedure is given, for implementing a controlled phase shift gate on a system consisting of any number of energy levels. Finally Collin’s version of three-qubit DJ algorithm using multi-frequency pulses, is implemented in the spin-7/2 system.

<p>Utvecklandet av kvantdatorn är ett ytterst lovande projekt som kombinerar teoretisk och experimental kvantfysik, matematik, teori om kvantinformation och datalogi. Under första steget i utvecklandet av kvantdatorn låg huvudintresset på att skapa några algoritmer med framtida tillämpningar, klargöra grundläggande frågor och utveckla en experimentell teknologi för en leksakskvantdator som verkar på några kvantbitar. Då dominerade förväntningarna om snabba framsteg bland kvantforskare. Men det verkar som om dessa stora förväntningar inte har besannats helt. Många grundläggande och tekniska problem som dekoherens hos kvantbitarna och instabilitet i kvantstrukturen skapar redan vid ett litet antal register tvivel om en snabb utveckling av kvantdatorer som verkligen fungerar. Trots detta kan man inte förneka att stora framsteg gjorts inom kvantteknologin. Det råder givetvis ett stort gap mellan skapandet av en leksakskvantdator med 10-15 kvantregister och att t.ex. tillgodose de tekniska förutsättningarna för det projekt på 100 kvantregister som aviserades för några år sen i USA. Det är också uppenbart att svårigheterna ökar ickelinjärt med ökningen av antalet register. Därför är simulering av kvantdatorer i klassiska datorer en viktig del av kvantdatorprojektet. Självklart kan man inte förvänta sig att en kvantalgoritm skall lösa ett NP-problem i polynomisk tid i en klassisk dator. Detta är heller inte syftet med klassisk simulering. Den klassiska simuleringen av kvantdatorer kommer att täcka en del av gapet mellan den teoretiskt matematiska formuleringen av kvantmekaniken och ett förverkligande av en kvantdator. Ett av de viktigaste problemen i vetenskapen om kvantdatorn är att utveckla ett nytt symboliskt språk för kvantdatorerna och att anpassa redan existerande symboliska språk för klassiska datorer till kvantalgoritmer. Denna avhandling ägnas åt en anpassning av det symboliska språket Mathematica till kända kvantalgoritmer och motsvarande simulering i klassiska datorer. Konkret kommer vi att representera Simons algoritm, Deutsch-Joszas algoritm, Grovers algoritm, Shors algoritm och kvantfelrättande koder i det symboliska språket Mathematica. Vi använder samma stomme i alla dessa algoritmer. Denna stomme representerar de karaktäristiska egenskaperna i det symboliska språkets framställning av kvantdatorn och det är enkelt att inkludera denna stomme i framtida algoritmer.</p> / <p>Quantum computing is an extremely promising project combining theoretical and experimental quantum physics, mathematics, quantum information theory and computer science. At the first stage of development of quantum computing the main attention was paid to creating a few algorithms which might have applications in the future, clarifying fundamental questions and developing experimental technologies for toy quantum computers operating with a few quantum bits. At that time expectations of quick progress in the quantum computing project dominated in the quantum community. However, it seems that such high expectations were not totally justified. Numerous fundamental and technological problems such as the decoherence of quantum bits and the instability of quantum structures even with a small number of registers led to doubts about a quick development of really working quantum computers. Although it can not be denied that great progress had been made in quantum technologies, it is clear that there is still a huge gap between the creation of toy quantum computers with 10-15 quantum registers and, e.g., satisfying the technical conditions of the project of 100 quantum registers announced a few years ago in the USA. It is also evident that difficulties increase nonlinearly with an increasing number of registers. Therefore the simulation of quantum computations on classical computers became an important part of the quantum computing project. Of course, it can not be expected that quantum algorithms would help to solve NP problems for polynomial time on classical computers. However, this is not at all the aim of classical simulation. Classical simulation of quantum computations will cover part of the gap between the theoretical mathematical formulation of quantum mechanics and the realization of quantum computers. One of the most important problems in "quantum computer science" is the development of new symbolic languages for quantum computing and the adaptation of existing symbolic languages for classical computing to quantum algorithms. The present thesis is devoted to the adaptation of the Mathematica symbolic language to known quantum algorithms and corresponding simulation on the classical computer. Concretely we shall represent in the Mathematica symbolic language Simon's algorithm, the Deutsch-Josza algorithm, Grover's algorithm, Shor's algorithm and quantum error-correcting codes. We shall see that the same framework can be used for all these algorithms. This framework will contain the characteristic property of the symbolic language representation of quantum computing and it will be a straightforward matter to include this framework in future algorithms.</p>

In this thesis we study quantum-like representation and simulation of quantum algorithms by using classical computers.The quantum--like representation algorithm (QLRA) was  introduced by A. Khrennikov (1997) to solve the ``inverse Born's rule problem'', i.e. to construct a representation of probabilistic data-- measured in any context of science-- and represent this data by a complex or more general probability amplitude which matches a generalization of Born's rule.The outcome from QLRA matches the formula of total probability with an additional trigonometric, hyperbolic or hyper-trigonometric interference term and this is in fact a generalization of the familiar formula of interference of probabilities. We study representation of statistical data (of any origin) by a probability amplitude in a complex algebra and a Clifford algebra (algebra of hyperbolic numbers). The statistical data is collected from measurements of two dichotomous and trichotomous observables respectively. We see that only special statistical data (satisfying a number of nonlinear constraints) have a quantum--like representation. We also study simulations of quantum computers on classical computers.Although it can not be denied that great progress have been made in quantum technologies, it is clear that there is still a huge gap between the creation of experimental quantum computers and realization of a quantum computer that can be used in applications. Therefore the simulation of quantum computations on classical computers became an important part in the attempt to cover this gap between the theoretical mathematical formulation of quantum mechanics and the realization of quantum computers. Of course, it can not be expected that quantum algorithms would help to solve NP problems for polynomial time on classical computers. However, this is not at all the aim of classical simulation.  The second part of this thesis is devoted to adaptation of the Mathematica symbolic language to known quantum algorithms and corresponding simulations on classical computers. Concretely we represent Simon's algorithm, Deutsch-Josza algorithm, Shor's algorithm, Grover's algorithm and quantum error-correcting codes in the Mathematica symbolic language. We see that the same framework can be used for all these algorithms. This framework will contain the characteristic property of the symbolic language representation of quantum computing and it will be a straightforward matter to include future algorithms in this framework.

Submitted by Johnny Rodrigues (johnnyrodrigues@ufcg.edu.br) on 2018-08-06T19:17:03Z No. of bitstreams: 1 HERON ARAGÃO MONTEIRO - DISSERTAÇÃO PPGCC 2012..pdf: 15948168 bytes, checksum: e445512265f530700a45c3924f68aa02 (MD5) / Made available in DSpace on 2018-08-06T19:17:03Z (GMT). No. of bitstreams: 1 HERON ARAGÃO MONTEIRO - DISSERTAÇÃO PPGCC 2012..pdf: 15948168 bytes, checksum: e445512265f530700a45c3924f68aa02 (MD5) Previous issue date: 2012-05-31 / Com o avanço da nanotecnologia, a computação quântica tem recebido grande destaque no meio científico. Utilizando os fundamentos da mecânica quântica, têm sido propostos diversos algoritmos quânticos. E, até então, os mesmos têm apresentado ganhos significativos com relação às suas versões clássicas. Na intenção de poder ser verificada a eficiência dos algoritmos quânticos, diversos simuladores vêm sendo desenvolvidos, visto que a confecção de um computador quântico ainda não foi possível. Há duas grandes vertentes de simuladores: os simuladores por software e os simuladores por hardware, chamados de emuladores. Na primeira classe se encontram os programas desenvolvidos em um computador clássico, procurando implementar os fundamentos da mecânica quântica, fazendo uso das linguagens de programação clássicas. Na segunda, são utilizados recursos que não estejam vinculados à plataforma do computador clássico. Dentre os emuladores, particularmente, estudos têm sido realizados fazendo uso de hardware dedicado (mais especificamente, FPGAV). O presente trabalho propõem a verificação da real utilidade da plataforma FPGA, com a intenção de se desenvolver um emulador universal, que permita a emulação de qualquer classe de circuitos, e que os mesmos possam ser implementados com um maior número de q-bits em relação aos circuitos tratados nos trabalhos anteriores. / With the progress of nanotechnology, quantum computing has received great emphasis in scientific circles. Using the basis of quantum mechanics, different quantum algorithms have been proposed. And so far, they have presented significant gains with respect to its classic versions. In order to verify the efficiency of quantum algorithms, several simulators have been developed, since the construction of a quantum computer is not yet possible. There are two major classes of simulators, simulators via software and via hardware. The latter being also called emulators. In the first class, programs are developed in a classical computer, attempting to implement the fundamentais of quantum mechanics, making use of classic programming languages. In the second, resources are used that are not related to the classic computer platform. Among the emulators, in particular, studies have been made using dedicated hardware (more specifically, FPGA's2). The present work proposes the use of the FPGA boards in emulation of quantum circuits aiming a gain scale in relation to the alternatives presented so far. The present work proposes checking the usefulness of the FPGA with the intention of developing an universal emulator that is able to emulate any type of circuit, and that they can be implemented with a larger number of q-bit in respect to the circuits treated in the previous works.