Дисертації з теми "Application of quantum computing"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 дисертацій для дослідження на тему "Application of quantum computing".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте дисертації для різних дисциплін та оформлюйте правильно вашу бібліографію.
Lovett, Neil Brian. "Application of quantum walks on graph structures to quantum computing." Thesis, University of Leeds, 2011. http://etheses.whiterose.ac.uk/1689/.
Повний текст джерелаKult, David. "Quantum Holonomies : Concepts and Applications to Quantum Computing and Interferometry." Doctoral thesis, Uppsala University, Quantum Chemistry, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-8185.
Повний текст джерелаQuantum holonomies are investigated in different contexts.
A geometric phase is proposed for decomposition dependent evolution, where each component of a given decomposition of a mixed state evolves independently. It is shown that this geometric phase only depends on the path traversed in the space of decompositions.
A holonomy is associated to general paths of subspaces of a Hilbert space, both discrete and continuous. This opens up the possibility of constructing quantum holonomic gates in the open path setting. In the discrete case it is shown that it is possible to associate two distinct holonomies to a given path. Interferometric setups for measuring both holonomies are
provided. It is further shown that there are cases when the holonomy is only partially defined. This has no counterpart in the Abelian setting.
An operational interpretation of amplitudes of density operators is provided. This allows for a direct interferometric realization of Uhlmann's parallelity condition, and the possibility of measuring the Uhlmann holonomy for sequences of density operators.
Off-diagonal geometric phases are generalized to the non-Abelian case. These off-diagonal holonomies are undefined for cyclic evolution, but must contain members of non-zero rank if all standard holonomies are undefined. Experimental setups for measuring the off-diagonal holonomies are proposed.
The concept of nodal free geometric phases is introduced. These are constructed from gauge invariant quantities, but do not share the nodal point structure of geometric phases and off-diagonal geometric phases. An interferometric setup for measuring nodal free geometric phases is provided, and it is shown that these phases could be useful in geometric quantum computation.
A holonomy associated to a sequence of quantum maps is introduced. It is shown that this holonomy is related to the Uhlmann holonomy. Explicit examples are provided to illustrate the general idea.
Estarellas, Pascual. "Spin chain systems for quantum computing and quantum information applications." Thesis, University of York, 2018. http://etheses.whiterose.ac.uk/20556/.
Повний текст джерелаVranckx, Stéphane. "Dynamical study of diatomics : applications to astrochemistry, quantum control and quantum computing." Doctoral thesis, Universite Libre de Bruxelles, 2014. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/209261.
Повний текст джерела1) HeH+, a species of great astrochemical importance which is thought to be the first molecular species to have formed in the universe;
2) CO2+, a metastable dication of particular interest in quantum control experiments due to its long-lived lowest vibrational level;
3) 41K87Rb, a polar molecule that can be formed at very low temperature and trapped, making it a good candidate for quantum computing schemes.
First, we use ab initio methods to compute accurate potential energy curves for the lowest singlet and triplet states of HeH+ as well as the potential energy curves, transition dipole moments and nonadiabatic radial couplings of the ground 3Π state of CO2+ and of its 11 lowest 3Σ- states.
In a second step, we use this ab initio data to compute the photodissociation and radiative association cross sections for the a and b 3Σ+ states of HeH+, as well as the values of the corresponding rate constants for astrophysical environments. The photodissociation cross sections from the lowest vibrational level of CO2+ is also determined.
Going one step further, we optimize laser control fields that drive the photodissociation dynamics of HeH+ and CO2+ towards specific channels. We compare two field optimization methods: a Møller operator-based Local Control approach and Optimal Control Theory. In both cases, we add a constraint that minimizes the area of the optimized fields.
Finally, we focus on one of the potential applications of high-fidelity laser control: the use of small molecular systems as quantum computers. We more specifically study the potential implementation of both intra- and intermolecular logic gates on data encoded in hyperfine states of trapped ultracold polar 41K87Rb molecules, opening interesting perspectives in terms of extensibility.
/
Dans cette thèse, nous étudions théoriquement les propriétés de molécules diatomiques, leur dynamique de réaction ainsi que le contrôle de cette dynamique à l'aide de champs laser. Notre travail porte plus spécifiquement sur trois espèces :
1) HeH+, un composé-clé en astrochimie considéré comme la première espèce moléculaire qui s'est formée dans l'univers ;
2) CO2+, un dication métastable qui se prête bien à des expériences de contrôle quantique en raison du relativement long temps de vie de son état vibrationnel le plus bas ;
3) 41K87Rb, une molécule polaire qui présente la particularité de pouvoir être formée à très basse température et piégée, ce qui en fait un bon support physique potentiel pour la réalisation d'un ordinateur quantique moléculaire.
Nous utilisons tout d'abord des méthodes de calcul ab initio afin d'obtenir les courbes d'énergie potentielle des premiers états singulets et triplets de HeH+ avec un haut de degré de précision, ainsi que les courbes d'énergie potentielle, les moments dipolaires de transition et les couplages non-adiabatiques radiaux de l'état fondamental 3Π de CO2+ et de ses 11 premiers états 3Σ-.
Ensuite, nous utilisons ces données ab initio pour calculer les sections efficaces de photodissociation et d'association radiative des états a et b 3Σ+ de HeH+, ainsi que les constantes cinétiques associées à ces processus dans les conditions rencontrées dans des environnements astrophysiques. Les sections efficaces de photodissociation du niveau vibrationnel le plus bas de CO2+ sont également calculées.
Nous allons ensuite un cran plus loin en optimisant des champs laser qui guident la dynamique de photodissociation de HeH+ et CO2+ vers des canaux de dissociation spécifiques. Nous comparons deux méthodes d'optimisation de ces champs: une approche de contrôle local basée sur les opérateurs de Møller et la théorie du contrôle optimal. Dans le deux cas, nous incluons une contrainte qui minimise l'aire des champs.
Enfin, nous nous concentrons sur l'une des applications possibles du contrôle laser à haute fidélité :l'utilisation de petits systèmes moléculaires comme ordinateurs quantiques. Nous étudions plus spécifiquement l'implémentation possible d'opérations logiques intra- et intermoléculaires sur des données encodées dans des états hyperfins de molécules de 41K87Rb piégées, ce qui ouvre des perspectives intéressantes en terme d'extensibilité.
Doctorat en Sciences
info:eu-repo/semantics/nonPublished
Di, Tiegang. "Entanglement generation and applications in quantum information." Texas A&M University, 2006. http://hdl.handle.net/1969.1/3840.
Повний текст джерелаCIRILLO, GIOVANNI AMEDEO. "Engineering quantum computing technologies: from compact modelling to applications." Doctoral thesis, Politecnico di Torino, 2022. http://hdl.handle.net/11583/2971119.
Повний текст джерелаHolleczek, Annemarie. "Linear optics quantum computing with single photons from an atom-cavity system." Thesis, University of Oxford, 2016. http://ora.ox.ac.uk/objects/uuid:d655fa1c-3405-413d-8af8-eecf6212ab74.
Повний текст джерелаVenegas-Andraca, Salvador Elías. "Discrete quantum walks and quantum image processing." Thesis, University of Oxford, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.427612.
Повний текст джерелаBettonte, Gabriella. "Quantum approaches for Worst-Case Execution-Times analysis of programs." Electronic Thesis or Diss., université Paris-Saclay, 2023. http://www.theses.fr/2023UPASG026.
Повний текст джерелаQuantum computing is gaining popularity in the computer science community. The awareness of the potential of quantum computing started in 1981, when Richard Feynman first speculated about building a quantum computer. However, until recently, the field has known much skepticism about its long-term practical capabilities to solve problems. In particular, researchers are still facing the challenge of building scalable and reliable quantum computers. Lately, many companies have obtained encouraging results and built quantum machines with enough qubits to start conducting interesting experiments. We chose the worst-case execution-time (WCET) evaluation as the application of our research on quantum computing, as it is crucial for various real-time applications. WCET analysis guarantees that a program's execution time matches all the scheduling and timing constraints. In quantum algorithms history, attention was often given to problems with a particular mathematical structure. The WCETs evaluation, as an opposite, is not a particularly quantum-friendly problem, and it has already proven efficient classical solutions. Hence, it is worth exploring the impact of quantum computing on those kinds of problems, with the spirit of finding new and concrete fields to which quantum computing could bring its potential. If not, research on such specific fields will help to set the boundaries of which applications could benefit from quantum computing. This thesis presents different quantum approaches to perform WCETs evaluations of programs under simplified assumptions
Kissinger, Aleks. "Pictures of processes : automated graph rewriting for monoidal categories and applications to quantum computing." Thesis, University of Oxford, 2011. http://ora.ox.ac.uk/objects/uuid:61fb3161-a353-48fc-8da2-6ce220cce6a2.
Повний текст джерелаKotiyal, Saurabh. "Design Exploration and Application of Reversible Circuits in Emerging Technologies." Scholar Commons, 2016. http://scholarcommons.usf.edu/etd/6283.
Повний текст джерелаMichelberger, Patrick Steffen. "Room temperature caesium quantum memory for quantum information applications." Thesis, University of Oxford, 2015. https://ora.ox.ac.uk/objects/uuid:19c9421d-0276-4c6d-a641-7640d2981da3.
Повний текст джерелаCandoli, Davide. "Simulation of NMR/NQR observables and spin control for applications in Quantum Science." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2020.
Знайти повний текст джерелаKanchibotla, Bhargava Ram V. "Fabrication and Device Applications of Self Assembled Nanostructures." VCU Scholars Compass, 2009. http://scholarscompass.vcu.edu/etd/2.
Повний текст джерелаZafarullah, Ijaz. "Thulium ions in a yttrium aluminum garnet host for quantum computing applications material analysis and single qubit operations /." Thesis, Montana State University, 2008. http://etd.lib.montana.edu/etd/2008/zafarullah/ZafarullahI0508.pdf.
Повний текст джерелаTirukkovalur, Sravya. "A Global Address Space Approach to Automated Data Management for Parallel Quantum Monte Carlo Applications." The Ohio State University, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=osu1307464186.
Повний текст джерелаKukharchyk, Nadezhda [Verfasser], Andreas D. [Akademischer Betreuer] Wieck, and Pavel [Akademischer Betreuer] Bushev. "Focused ion beam implantation of Yttrium orthosilicates with Erbium ions for applications in quantum computing / Nadezhda Kukharchyk. Gutachter: Andreas D. Wieck ; Pavel Bushev." Bochum : Ruhr-Universität Bochum, 2016. http://d-nb.info/1089006853/34.
Повний текст джерелаHawash, Maher Mofeid. "Methods for Efficient Synthesis of Large Reversible Binary and Ternary Quantum Circuits and Applications of Linear Nearest Neighbor Model." PDXScholar, 2013. https://pdxscholar.library.pdx.edu/open_access_etds/1090.
Повний текст джерелаYemen, Olfa. "Application des codes cycliques tordus." Phd thesis, Université Nice Sophia Antipolis, 2013. http://tel.archives-ouvertes.fr/tel-00866858.
Повний текст джерелаFaust, Thomas Benjamin. "On the synthesis, measurement and applications of octanuclear heterometallic rings." Thesis, University of Manchester, 2012. https://www.research.manchester.ac.uk/portal/en/theses/on-the-synthesis-measurement-and-applications-of-octanuclear-heterometallic-rings(a9697906-50e4-4d0a-9eda-bfd09b9e12f8).html.
Повний текст джерелаAngelsmark, Ola. "Constructing Algorithms for Constraint Satisfaction and Related Problems : Methods and Applications." Doctoral thesis, Linköping : Univ, 2005. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-3836.
Повний текст джерелаZimokos, K. R. "Quantum computing." Thesis, Sumy State University, 2014. http://essuir.sumdu.edu.ua/handle/123456789/45442.
Повний текст джерелаДядечко, Алла Миколаївна, Алла Николаевна Дядечко, Alla Mykolaivna Diadechko, Артем Володимирович Дмітрієв, Артем Владимирович Дмитриев, and Artem Volodymyrovych Dmitriiev. "Quantum computing." Thesis, Видавництво СумДУ, 2010. http://essuir.sumdu.edu.ua/handle/123456789/16434.
Повний текст джерелаNutz, Thomas. "Semiconductor quantum light sources for quantum computing." Thesis, Imperial College London, 2018. http://hdl.handle.net/10044/1/63931.
Повний текст джерелаHeidebrecht, Andreas. "Quantum state engineering for spin quantum computing." [S.l. : s.n.], 2006. http://nbn-resolving.de/urn:nbn:de:bsz:93-opus-29410.
Повний текст джерелаStock, Ryan. "Silicon-based quantum optics and quantum computing." Thesis, Cardiff University, 2018. http://orca.cf.ac.uk/111871/.
Повний текст джерелаJohnsen, Sverre Gullikstad. "Towards optical quantum computing." Thesis, Norwegian University of Science and Technology, Department of Physics, 2003. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-2256.
Повний текст джерелаTsampardoukas, Christos. "Ion trap quantum computing." Monterey, California. Naval Postgraduate School, 2011. http://hdl.handle.net/10945/10704.
Повний текст джерелаDuncan, Ross. "Types for quantum computing." Thesis, University of Oxford, 2006. http://ora.ox.ac.uk/objects/uuid:c2901ae8-9386-4dbf-879d-e37bbc2692bd.
Повний текст джерелаWang, Qian. "Quantum tunneling, quantum computing, and high temperature superconductivity." Texas A&M University, 2003. http://hdl.handle.net/1969.1/1638.
Повний текст джерелаMeyer, Carola. "Endohedral fullerenes for quantum computing." [S.l. : s.n.], 2003. http://www.diss.fu-berlin.de/2003/296/index.html.
Повний текст джерелаBresler, Yony. "Stochastic simulations of quantum computing." Thesis, McGill University, 2012. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=106525.
Повний текст джерелаUne méthode pour simuler des circuits de calcul quantique par des processus stochastiques est décrite et analysée. Les circuits sont transformés en une action complexe par laquelle les observables sont calculés. Ces moyennes sont évaluées à l'aide de Monte Carlo et de méthodes complexes de Langevin. La transformation peut être appliquée sur n'importe quel circuit avec un état de produits d'entrée. Celle-ci résulte en équations qui sont polynomiales dans le stockage. Cette méthode est unique, car elle permet une simulation efficace et est à la fois généralisée. Trois circuits d'échantillonnage sont simulés. Les techniques de simulations courantes démontrent inadéquatement les estimations des observables. Une méthode améliorée est donc proposée par l'ajout d'un terme de couplage à l'action pour stabiliser le système. Les résultats démontrés via la méthode améliorée sont plus fiables. La faisabilité et les orientations futures sont discutées.
Metz, Jeremy. "Quantum Computing With Macroscopic Heralding." Thesis, Imperial College London, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.484422.
Повний текст джерелаCampbell, Earl T. "Distrubuting entanglement for quantum computing." Thesis, University of Oxford, 2008. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.504315.
Повний текст джерелаNickerson, Naomi. "Practical fault-tolerant quantum computing." Thesis, Imperial College London, 2015. http://hdl.handle.net/10044/1/31475.
Повний текст джерелаWardrop, Matthew Phillip. "Quantum Gates for Quantum Dots." Thesis, The University of Sydney, 2015. http://hdl.handle.net/2123/14938.
Повний текст джерелаXu, Huizhong. "Quantum computing with Josephson junction circuits." College Park, Md. : University of Maryland, 2004. http://hdl.handle.net/1903/1885.
Повний текст джерелаThesis research directed by: Physics. Title from t.p. of PDF. Includes bibliographical references. Published by UMI Dissertation Services, Ann Arbor, Mich. Also available in paper.
Evans, Julia. "The algebra of topological quantum computing." Thesis, McGill University, 2012. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=107687.
Повний текст джерелаLe calcul quantique topologique est une approche au problème d'implementationde circuits quantique d'une façon robuste et precisé. L'idée s'agit d'exploiter certaines propriétés de quasiparticules, dites "anyons", pour obtenir une implémentation du calcul quantique qui est intrinsequement tolerante aux pannes. La structure mathématique qui décrit ces anyons est celle des catégories modulaires. Ces objets peuvent être construites à partir de représentations de certaines algèbres, appelées groupes quantiques. Dans ce mémoire, nous donnerons une exposition des catégories modulaires, des groupes quantiques et du lien qu'ils partagent avec le calcul quantique. Le mémoire ne devrait requérir qu'une connaissance de base en algèbre et en théorie des categories. L'espoir étant de donner un model concret pour les informaticiens de la théorie de catégories obtenus à partir de groupes quantiques. L'emphase sera sur le point de vu algèbrique et catégorique plutôt que celui physique.
Casson, Ian. "Linking polymetallic rings for quantum computing." Thesis, University of Manchester, 2009. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.503018.
Повний текст джерелаIoannou, L. M. "Computing finite-dimensional bipartite quantum separability." Thesis, University of Cambridge, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.604939.
Повний текст джерелаZhang, Jinying. "Fullerene Compounds for Quantum Computing Architectures." Thesis, University of Oxford, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.531661.
Повний текст джерелаPérez, Salinas Adrián. "Algorithmic strategies for seizing quantum computing." Doctoral thesis, Universitat de Barcelona, 2021. http://hdl.handle.net/10803/673255.
Повний текст джерелаLa computación cuántica es una tecnología emergente con potencial para resolver problemas hoy impracticables. Para ello son necesarios ordenadores capaces de mantener sistemas cuánticos y controlarlos con precisión. Sin embargo, construir estos ordenadores es complejo y a corto plazo solo habrá ordenadores pequeños afectados por el ruido y sujetos a ruido (NISQ). Para aprovechar los ordenadores NISQ se exploran algoritmos que requieran pocos recursos cuánticos mientras proporcionan soluciones aproximadas a los problemas que enfrentan. En esta tesis se estudian dos propuestas para algoritmos NISQ: re-uploading y unary. Cada estrategia busca tomar ventaja de diferentes características de la computación cuántica para superar diferentes obstáculos. Ambas estrategias son generales y aplicables en diversos escenarios. En primer lugar, re-uploading está diseñado como un puente entre la computación cuántica y el aprendizaje automático (Machine Learning). Aunque no es el primer intento de aplicar la cuántica al aprendizaje automático, re-uploading tiene ciertas características que lo distinguen de otros métodos. En concreto, re-uploading consiste en introducir datos en un algoritmo cuántico en diferentes puntos a lo largo del proceso. Junto a los datos se utilizan también parámetros optimizables clásicamente que permiten al circuito aprender cualquier comportamiento. Los resultados mejoran cuantas más veces se introducen los datos. El re-uploading cuenta con teoremas matemáticos que sustentan sus capacidades, y ha sido comprobado con éxito en diferentes situaciones tanto simuladas como experimentales. La segunda estrategia algorítmica es unary. Consiste en describir los problemas utilizando solo parte del espacio de computación disponible dentro del ordenador. Así, las capacidades computacionales del ordenador no son óptimas, pero a cambio las operaciones necesarias para una cierta tarea se simplifican. Los resultados obtenidos son resistentes al ruido, y mantienen su significado, y se produce una compensación entre eficiencia y resistencia a errores. Los ordenadores NISQ se ven beneficiados de esta situación para problemas pequeños. En esta tesis, unary se utiliza para resolver un problema tíıpico de finanzas, incluso obteniendo ventajas cuánticas en un problema aplicable al mundo real. Con esta tesis se espera contribuir al crecimiento de los algoritmos disponibles para ordenadores cuánticos NISQ y allanar el camino para las tecnologías venideras.
Gimeno-Segovia, Mercedes. "Towards practical linear optical quantum computing." Thesis, Imperial College London, 2015. http://hdl.handle.net/10044/1/43936.
Повний текст джерелаBrown, Katherine Louise. "Using the qubus for quantum computing." Thesis, University of Leeds, 2011. http://etheses.whiterose.ac.uk/1687/.
Повний текст джерелаDewaele, Nicholas. "Quantum Computing With Quantum Dots Using The Heisenberg Exchange Interaction." OpenSIUC, 2014. https://opensiuc.lib.siu.edu/theses/1600.
Повний текст джерелаHolladay, Robert Tyler. "Steepest-Entropy-Ascent Quantum Thermodynamic Modeling of Quantum Information and Quantum Computing Systems." Diss., Virginia Tech, 2019. http://hdl.handle.net/10919/94630.
Повний текст джерелаDoctor of Philosophy
Quantum computers (QCs) have the potential to perform certain tasks much more efficiently than today0 s supercomputers. One primary challenge in realizing a practical QC is maintaining the stored information, the loss of which is known as decoherence. This work attributes decoherence to dissipation (a classical analogue being heat generated due to friction) occurring while an algorithm is run on the QC. Standard quantum modeling approaches assume that for any dissipation to occur, the QC must interact with its environment. However, in this work, steepest-entropy-ascent quantum thermodynamics (SEAQT) is used to model the evolution of the QC as it runs an algorithm. SEAQT, developed by Hatsopolous, Gyftopolous, Beretta, and others over the past 40 years, supplements the laws of quantum mechanics with those of thermodynamics and in contrast to the standard quantum approaches does not require the presence of an environment to account for the dissipation which occurs. This work first applies the SEAQT framework to modeling single qubits (quantum bits) to characterize the effect of dissipation on the information stored on the qubit. This is later extended to a nuclear-magnetic-resonance (NMR) QC of 7 qubits. Additionally, SEAQT is used to predict experimentally observed dissipation in a two-qubit NMR QC. Afterwards, several methods for constrained perturbations of a QC0 s state are presented. These methods are then used with SEAQT to analyze the effect of dissipation on the entanglement of two qubits. Finally, a model is derived within the SEAQT framework accounting for a qubit interacting with its environment, which is at a constant temperature. This model is then used to develop a method for limiting the decoherence and shown to significantly lowering the resulting error due to decoherence.
Pius, Einar. "Parallel quantum computing : from theory to practice." Thesis, University of Edinburgh, 2015. http://hdl.handle.net/1842/15857.
Повний текст джерелаNaydenov, Boris N. "Encapsulation of endohedral fullerenes for quantum computing." [S.l.] : [s.n.], 2006. http://www.diss.fu-berlin.de/2006/659/index.html.
Повний текст джерелаLi, Huidong, and 李輝東. "The reversibility and determinism in quantum computing." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2004. http://hub.hku.hk/bib/B31228306.
Повний текст джерелаRosenberg, Nathanial Owen. "Cryptology Management in a Quantum Computing Era." Thesis, Monterey, California. Naval Postgraduate School, 2012. http://hdl.handle.net/10945/7407.
Повний текст джерела