Relevant bibliographies by topics / Application of quantum computing

Academic literature on the topic 'Application of quantum computing'

Author: Grafiati
Published: 27 April 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Application of quantum computing.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Application of quantum computing"

1

Yang, Hong, Jingjing Wang, and Xu Sun. "Research on Quantum Computing Standard System Architecture and Roadmap." Journal of Physics: Conference Series 2433, no. 1 (February 1, 2023): 012035. http://dx.doi.org/10.1088/1742-6596/2433/1/012035.

Full text
Abstract:
Abstract Quantum computing is an important branch of quantum information technology. Quantum computing is far more powerful than traditional computing in solving some problems, and it has great potential for commercial and military applications. Firstly, this paper introduces the status quo of quantum computing research and the status of domestic and foreign standards, and then discusses the demands of quantum computing standards, and expounds on the necessity of a quantum computing standard system. Then give the quantum computing architecture standard system diagram. Finally, there is a roadmap for Quantum computing standardization is given, including the short, medium and long term. The architecture and the roadmap will be helpful to guide the standardization work as well as the application development.
APA, Harvard, Vancouver, ISO, and other styles
2

Henriet, Loïc, Lucas Beguin, Adrien Signoles, Thierry Lahaye, Antoine Browaeys, Georges-Olivier Reymond, and Christophe Jurczak. "Quantum computing with neutral atoms." Quantum 4 (September 21, 2020): 327. http://dx.doi.org/10.22331/q-2020-09-21-327.

Full text
Abstract:
The manipulation of neutral atoms by light is at the heart of countless scientific discoveries in the field of quantum physics in the last three decades. The level of control that has been achieved at the single particle level within arrays of optical traps, while preserving the fundamental properties of quantum matter (coherence, entanglement, superposition), makes these technologies prime candidates to implement disruptive computation paradigms. In this paper, we review the main characteristics of these devices from atoms / qubits to application interfaces, and propose a classification of a wide variety of tasks that can already be addressed in a computationally efficient manner in the Noisy Intermediate Scale Quantum\cite{Preskill_NISQ} era we are in. We illustrate how applications ranging from optimization challenges to simulation of quantum systems can be explored either at the digital level (programming gate-based circuits) or at the analog level (programming Hamiltonian sequences). We give evidence of the intrinsic scalability of neutral atom quantum processors in the 100-1,000 qubits range and introduce prospects for universal fault tolerant quantum computing and applications beyond quantum computing.
APA, Harvard, Vancouver, ISO, and other styles
3

Peleshenko, Vitaly A. "INTEL-QS QUANTUM COMPUTING." SOFT MEASUREMENTS AND COMPUTING 7/1, no. 56 (2022): 58–64. http://dx.doi.org/10.36871/2618-9976.2022.07.006.

Full text
Abstract:
The article is devoted to quantum processors and quantum programming languages. In particular, the features of technical processes and physical principles of operation and creation of the CPU are considered. The possibilities of practical application of the Intel-QS quantum computing language are considered.
APA, Harvard, Vancouver, ISO, and other styles
4

Morimae, Tomoyuki. "Quantum randomized encoding, verification of quantum computing, no-cloning, and blind quantum computing." Quantum Information and Computation 21, no. 13&14 (September 2021): 1111–34. http://dx.doi.org/10.26421/qic21.13-14-3.

Full text
Abstract:
Randomized encoding is a powerful cryptographic primitive with various applications such as secure multiparty computation, verifiable computation, parallel cryptography, and complexity lower bounds. Intuitively, randomized encoding $\hat{f}$ of a function $f$ is another function such that $f(x)$ can be recovered from $\hat{f}(x)$, and nothing except for $f(x)$ is leaked from $\hat{f}(x)$. Its quantum version, quantum randomized encoding, has been introduced recently [Brakerski and Yuen, arXiv:2006.01085]. Intuitively, quantum randomized encoding $\hat{F}$ of a quantum operation $F$ is another quantum operation such that, for any quantum state $\rho$, $F(\rho)$ can be recovered from $\hat{F}(\rho)$, and nothing except for $F(\rho)$ is leaked from $\hat{F}(\rho)$. In this paper, we show three results. First, we show that if quantum randomized encoding of BB84 state generations is possible with an encoding operation $E$, then a two-round verification of quantum computing is possible with a classical verifier who can additionally do the operation $E$. One of the most important goals in the field of the verification of quantum computing is to construct a verification protocol with a verifier as classical as possible. This result therefore demonstrates a potential application of quantum randomized encoding to the verification of quantum computing: if we can find a good quantum randomized encoding (in terms of the encoding complexity), then we can construct a good verification protocol of quantum computing. Our second result is, however, to show that too good quantum randomized encoding is impossible: if quantum randomized encoding for the generation of even simple states (such as BB84 states) is possible with a classical encoding operation, then the no-cloning is violated. Finally, we consider a natural modification of blind quantum computing protocols in such a way that the server gets the output like quantum randomized encoding. We show that the modified protocol is not secure.
APA, Harvard, Vancouver, ISO, and other styles
5

Williams, Colin, Pieter Kok, Hwang Lee, and Jonathan P. Dowling. "Quantum lithography: A non-computing application of quantum information." Informatik - Forschung und Entwicklung 21, no. 1-2 (September 26, 2006): 73–82. http://dx.doi.org/10.1007/s00450-006-0017-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Sibi, Alex. "The Impact of Quantum Computing on Cryptography." International Journal for Research in Applied Science and Engineering Technology 11, no. 3 (March 31, 2023): 1762–65. http://dx.doi.org/10.22214/ijraset.2023.49770.

Full text
Abstract:
Abstract: The purpose of this paper's abstract is to explain how quantum computing works in terms of current cryptography and to provide the reader a rudimentary understanding of post-quantum algorithms. Community key encoding methods affected, symmetric structures affected, the influence on hash purposes, upright quantum cryptography, distinctions amongst quantum and standard computing, obstacles in quantum computation, and quantum procedures (Shor's and Grover's). The PostQuantum Cryptography section specifically discusses various mathematically based quantum crucial circulation techniques, lattice-built cryptography, multivariate-built cryptography, hash-based signs, and code-based encoding. One of the modern technologies in today's society is quantum computation. The advance of quantum computing applications is the focus of numerous communities and research institutions worldwide. Another developing field at the moment that is becoming stable is artificial intelligence. The major goal of this work is to determine the effects of the development of quantum computing research on applications involving artificial intelligence. Hence, computational methods are utilised in the study's methodology. So that this study's findings about the expanding impact of quantum computing research for a particular application of artificial intelligence can be drawn. The impact and potential of quantum computing on the subject of artificial intelligence is also discussed in this study, along with how quantum computing affects that discipline.
APA, Harvard, Vancouver, ISO, and other styles
7

CR, Senise Jr. "The (Present) Age of Quantum Computing." Physical Science & Biophysics Journal 7, no. 1 (January 5, 2023): 1–3. http://dx.doi.org/10.23880/psbj-16000229.

Full text
Abstract:
Quantum computing is an intense and challenging research area, that promises to change the world we live in. But what is its current status, both in terms of understanding and applications? We discuss some points related to this question in this article.
APA, Harvard, Vancouver, ISO, and other styles
8

Griol-Barres, Israel, Sergio Milla, Antonio Cebrián, Yashar Mansoori, and José Millet. "Variational Quantum Circuits for Machine Learning. An Application for the Detection of Weak Signals." Applied Sciences 11, no. 14 (July 12, 2021): 6427. http://dx.doi.org/10.3390/app11146427.

Full text
Abstract:
Quantum computing is a new paradigm for a multitude of computing applications. This study presents the technologies that are currently available for the physical implementation of qubits and quantum gates, establishing their main advantages and disadvantages and the available frameworks for programming and implementing quantum circuits. One of the main applications for quantum computing is the development of new algorithms for machine learning. In this study, an implementation of a quantum circuit based on support vector machines (SVMs) is described for the resolution of classification problems. This circuit is specially designed for the noisy intermediate-scale quantum (NISQ) computers that are currently available. As an experiment, the circuit is tested on a real quantum computer based on superconducting qubits for an application to detect weak signals of the future. Weak signals are indicators of incipient changes that will have a future impact. Even for experts, the detection of these events is complicated since it is too early to predict this impact. The data obtained with the experiment shows promising results but also confirms that ongoing technological development is still required to take full advantage of quantum computing.
APA, Harvard, Vancouver, ISO, and other styles
9

Magomadov, V. S. "Exploring the current state and application of quantum computing." Journal of Physics: Conference Series 2373, no. 5 (December 1, 2022): 052011. http://dx.doi.org/10.1088/1742-6596/2373/5/052011.

Full text
Abstract:
Abstract This paper is focused on the field of quantum computing which is an important area of research these days. The paper gives a brief history of this phenomenon and discusses how it has been developing since its conception. Furthermore, the paper describes the principles on which the quantity computer is built, such as qubits, entanglement, and superposition. It also discusses the necessity to build a quantum computer and how it could an improvement upon the existing computers. In addition, the paper covers some of the fields in which quantum computing could be particularly beneficial. Finally, some of the problems and challenges associated with the development of quantum computing are addressed.
APA, Harvard, Vancouver, ISO, and other styles
10

Amundson, James, and Elizabeth Sexton-Kennedy. "Quantum Computing." EPJ Web of Conferences 214 (2019): 09010. http://dx.doi.org/10.1051/epjconf/201921409010.

Full text
Abstract:
In recent years Quantum Computing has attracted a great deal of attention in the scientific and technical communities. Interest in the field has expanded to include the popular press and various funding agencies. We discuss the origins of the idea of using quantum systems for computing. We then give an overview in recent developments in quantum hardware and software, as well as some potential applications for high energy physics.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Application of quantum computing"

1

Lovett, Neil Brian. "Application of quantum walks on graph structures to quantum computing." Thesis, University of Leeds, 2011. http://etheses.whiterose.ac.uk/1689/.

Full text
Abstract:
Quantum computation is a new computational paradigm which can provide fundamentally faster computation than in the classical regime. This is dependent on finding efficient quantum algorithms for problems of practical interest. One of the most successful tools in developing new quantum algorithms is the quantum walk. In this thesis, we explore two applications of the discrete time quantum walk. In addition, we introduce an experimental scheme for generating cluster states, a universal resource for quantum computation. We give an explicit construction which provides a link between the circuit model of quantum computation, and a graph structure on which the discrete time quantum walk traverses, performing the same computation. We implement a universal gate set, proving the discrete time quantum walk is universal for quantum computation, thus confirming any quantum algorithm can be recast as a quantum walk algorithm. In addition, we study factors affecting the efficiency of the quantum walk search algorithm. Although there is a strong dependence on the spatial dimension of the structure being searched, we find secondary dependencies on other factors including the connectivity and disorder (symmetry). Fairly intuitively, as the connectivity increases, the efficiency of the algorithm increases, as the walker can coalesce on the marked state with higher probability in a quicker time. In addition, we find as disorder in the system increases, the algorithm can maintain the quantum speed up for a certain level of disorder before gradually reverting to the classical run time. Finally, we give an abstract scheme for generating cluster states. We see a linear scaling, better than many schemes, as doubling the size of the generating grid in our scheme produces a cluster state which is double the depth. Our scheme is able to create other interesting topologies of entangled states, including the unit cell for topological error correcting schemes.
APA, Harvard, Vancouver, ISO, and other styles
2

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.

Full text
Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles
3

Estarellas, Pascual. "Spin chain systems for quantum computing and quantum information applications." Thesis, University of York, 2018. http://etheses.whiterose.ac.uk/20556/.

Full text
Abstract:
One of the most essential processes in classical computation is that related to the information manipulation; each component or register of a computer needs to communicate to others by exchanging information encoded in bits and transforming it through logical operations. Hence the theoretical study of methods for information transfer and processing in classical information theory is of fundamental importance for telecommunications and computer science, along with study of errors and robustness of such proposals. When adding the quantum ingredient, there arises a whole new set of paradigms and devices, based on manipulations of \emph{qubits}, the quantum analogues of conventional data bits. Such systems can show enormous advantage against their classical analogues, but at the same time present a whole new set of technical and conceptual challenges to overcome. The full and detailed understanding of quantum processes and studies of theoretical models and devices therefore provide the first logical steps to the future technological exploitation of these new machines. In this line, this thesis focuses on spin chains as such theoretical models, formed by series of coupled qubits that can be applied to a wide range of physical systems, and its several potential applications as quantum devices. In this work spin chains are presented as reliable devices for quantum communication with high transfer fidelities, entanglement generation and distribution over distant parties and protected storage of quantum information. Methods to design these tools to have some robustness against errors and noise are provided, giving optimism for future quantum technologies.
APA, Harvard, Vancouver, ISO, and other styles
4

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.

Full text
Abstract:
In this work, we theoretically study the properties of diatomic molecular systems, their dynamics, and the control thereof through the use of laser fields. We more specifically study three compounds:

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

APA, Harvard, Vancouver, ISO, and other styles
5

Di, Tiegang. "Entanglement generation and applications in quantum information." Texas A&M University, 2006. http://hdl.handle.net/1969.1/3840.

Full text
Abstract:
This dissertation consists of three sections. In the first section, we discuss the generation of arbitrary two-qubit entangled states and present three generation methods. The first method is based on the interaction of an atom with classical and quantized cavity fields. The second method is based on the interaction of two coupled two-level atoms with a laser field. In the last method, we use two spin-1/2 systems which interact with a tuned radio frequency pulse. Using those methods we have generated two qubit arbitrary entangled states which is widely used in quantum computing and quantum information. In the second section, we discuss a possible experimental implementation of quantum walk which is based on the passage of an atom through a high-Q cavity. The chirality is determined by the atomic states and the displacement is characterized by the photon number inside the cavity. Our scheme makes quantum walk possible in a cavity QED system and the results could be widely used on quantum computer. In the last section, we investigate the properties of teleporting an arbitrary superposition of entangled Dicke states of any number of atoms (qubits) between two distant cavities. We also studied teleporting continuous variables of an optical field. Teleportation of Dicke states relies on adiabatic passage using multiatom dark states in each cavity and a conditional detection of photons leaking out of both cavities. In the continuous variables teleportation scheme we first reformulate the protocol of quantum teleportation of arbitrary input optical field states in the density matrix form, and established the relation between the P-function of the input and output states. We then present a condition involving squeeze parameter and detection efficiency under which the P-function of the output state becomes the Q function of the input state such that any nonclassical features in the input state will be eliminated in the teleported state. Based on the research in this section we have made it possible of arbitrary atomic Dicke states teleportation from one cavity to another, and this teleortation will play an essential role in quantum communication. Since quantum properties is so important in quantum communication, the condition we give in this section to distinguish classical and quantum teleportation is also important.
APA, Harvard, Vancouver, ISO, and other styles
6

CIRILLO, GIOVANNI AMEDEO. "Engineering quantum computing technologies: from compact modelling to applications." Doctoral thesis, Politecnico di Torino, 2022. http://hdl.handle.net/11583/2971119.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

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.

Full text
Abstract:
One of today’s challenges to realise computing based on quantum mechanics is to reliably and scalably encode information in quantum systems. Here, we present a photon source to on-demand deliver photonic quantum bits of information based on a strongly coupled atom-cavity system. The source operates intermittently for periods of up to 100 μs, with a single-photon repetition rate of 1 MHz, and an intra-cavity production efficiency of up to 85%. Our ability to arbitrarily control the photons’ wavepackets and phase profiles, together with long coherence times of 500 ns, allows to store time-bin encoded quantum information within a single photon. To do so, the spatio-temporal envelope of a single photon is sub-divided in d time bins which allows for the delivery of arbitrary qu-d-its. This is done with a fidelity of > 95% for qubits, and 94% for qutrits verified using a newly developed time-resolved quantum-homodyne measurement technique. Additionally, we combine two separate fields of quantum physics by using our deterministic single-photon source to seed linear optics quantum computing (LOQC) circuits. As a step towards quantum networking, it is shown that this photon source can be combined with quantum gates, namely a chip-integrated beam splitter, a controlled-NOT (CNOT) gate as well as a CNOT4 gate. We use this CNOT4 gate to entangle photons deterministically emitted from our source and observe non-classical correlations between events separated by periods exceeding the travel time across the chip by three orders of magnitude. Additionally, we use time-bin encoded qubits to systematically study the de- and re-phasing of quantum states as well as the the effects of time-varying internal phases in photonic quantum circuits.
APA, Harvard, Vancouver, ISO, and other styles
8

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.

Full text
Abstract:
In this thesis we have focused on two topics: Discrete Quantum Walks and Quantum Image Processing. Our work is a contribution within the field of quantum computation from the perspective of a computer scientist. With the purpose of finding new techniques to develop quantum algorithms, there has been an increasing interest in studying Quantum Walks, the quantum counterparts of classical random walks. Our work in quantum walks begins with a critical and comprehensive assessment of those elements of classical random walks and discrete quantum walks on undirected graphs relevant to algorithm development. We propose a model of discrete quantum walks on an infinite line using pairs of quantum coins under different degrees of entanglement, as well as quantum walkers in different initial state configurations, including superpositions of corresponding basis states. We have found that the probability distributions of such quantum walks have particular forms which are different from the probability distributions of classical random walks. Also, our numerical results show that the symmetry properties of quantum walks with entangled coins have a non-trivial relationship with corresponding initial states and evolution operators. In addition, we have studied the properties of the entanglement generated between walkers, in a family of discrete Hadamard quantum walks on an infinite line with one coin and two walkers. We have found that there is indeed a relation between the amount of entanglement available in each step of the quantum walk and the symmetry of the initial coin state. However, as we show with our numerical simulations, such a relation is not straightforward and, in fact, it can be counterintuitive. Quantum Image Processing is a blend of two fields: quantum computation and image processing. Our aim has been to promote cross-fertilisation and to explore how ideas from quantum computation could be used to develop image processing algorithms. Firstly, we propose methods for storing and retrieving images using non-entangled and entangled qubits. Secondly, we study a case in which 4 different values are randomly stored in a single qubit, and show that quantum mechanical properties can, in certain cases, allow better reproduction of original stored values compared with classical methods. Finally, we briefly note that entanglement may be used as a computational resource to perform hardware-based pattern recognition of geometrical shapes that would otherwise require classical hardware and software.
APA, Harvard, Vancouver, ISO, and other styles
9

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.

Full text
Abstract:
L'informatique quantique gagne en popularité dans la communauté informatique. La prise de conscience du potentiel de l'informatique quantique a commencée en 1981, lorsque Richard Feynman a imaginé la construction d'un ordinateur quantique. Cependant, le domaine a connu beaucoup de scepticisme quant à ses capacités pratiques à long terme pour résoudre les problèmes. En particulier, les chercheurs tente de relever le défi de construire des ordinateurs quantiques scalables et fiables. Dernièrement, de nombreuses entreprises ont obtenu des résultats encourageants et ont construit des machines quantiques avec suffisamment de qubits pour commencer à mener des expériences intéressantes dessus. Nous avons choisi l'évaluation du pire temps d'exécution (WCET) comme application de nos recherches sur l'informatique quantique, car elle est cruciale pour diverses applications temps réel. L'analyse WCET garantit que le temps d'exécution d'un programme respecte toutes les contraintes d'ordonnancement et de timing. Dans l'histoire des algorithmes quantiques, l'attention a souvent été accordée aux problèmes avec une structure mathématique particulière. L'évaluation des WCET, à l'opposé, n'est pas un problème a priori favorable au contexte quantique, et possède des solutions classiques efficaces déjà éprouvées. Ainsi, il est intéressant d'explorer l'impact de l'informatique quantique sur ce type de problèmes, dans l'esprit de trouver des domaines nouveaux et concrets dans lesquels l'informatique quantique pourrait apporter sa contribution. Si ce n'est pas le cas, la recherche dans ces domaines spécifiques peut aider à définir les limites des applications qui pourraient bénéficier de l'informatique quantique. Cette thèse présente différentes approches quantiques pour effectuer des évaluations WCETs de programmes pour des modèles simplifiés
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
APA, Harvard, Vancouver, ISO, and other styles
10

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.

Full text
Abstract:
This work is about diagrammatic languages, how they can be represented, and what they in turn can be used to represent. More specifically, it focuses on representations and applications of string diagrams. String diagrams are used to represent a collection of processes, depicted as "boxes" with multiple (typed) inputs and outputs, depicted as "wires". If we allow plugging input and output wires together, we can intuitively represent complex compositions of processes, formalised as morphisms in a monoidal category. While string diagrams are very intuitive, existing methods for defining them rigorously rely on topological notions that do not extend naturally to automated computation. The first major contribution of this dissertation is the introduction of a discretised version of a string diagram called a string graph. String graphs form a partial adhesive category, so they can be manipulated using double-pushout graph rewriting. Furthermore, we show how string graphs modulo a rewrite system can be used to construct free symmetric traced and compact closed categories on a monoidal signature. The second contribution is in the application of graphical languages to quantum information theory. We use a mixture of diagrammatic and algebraic techniques to prove a new classification result for strongly complementary observables. Namely, maximal sets of strongly complementary observables of dimension D must be of size no larger than 2, and are in 1-to-1 correspondence with the Abelian groups of order D. We also introduce a graphical language for multipartite entanglement and illustrate a simple graphical axiom that distinguishes the two maximally-entangled tripartite qubit states: GHZ and W. Notably, we illustrate how the algebraic structures induced by these operations correspond to the (partial) arithmetic operations of addition and multiplication on the complex projective line. The third contribution is a description of two software tools developed in part by the author to implement much of the theoretical content described here. The first tool is Quantomatic, a desktop application for building string graphs and graphical theories, as well as performing automated graph rewriting visually. The second is QuantoCoSy, which performs fully automated, model-driven theory creation using a procedure called conjecture synthesis.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Application of quantum computing"

1

Vos, Alexis de. Reversible computing: Fundamentals, quantum computing, and applications. Weinheim: Wiley-VCH, 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Taha, Saleem Mohammed Ridha. Reversible Logic Synthesis Methodologies with Application to Quantum Computing. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-23479-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Carfora, Mauro. Quantum Triangulations: Moduli Spaces, Strings, and Quantum Computing. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Alicki, Robert. Quantum Dynamical Semigroups and Applications. Berlin, Heidelberg: Springer Berlin Heidelberg, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Klaus, Hentschel, Weinert Friedel, and SpringerLink (Online service), eds. Compendium of Quantum Physics. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Kiong, Loo Chu. Biological and quantum computing for human vision: Holonomic models and applications. Hershey, PA: Medical Information Science Reference, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Perus, Mitja. Biological and quantum computing for human vision: Holonomic models and applications. Hershey, PA: Medical Information Science Reference, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Castro, Leandro N. De. Fundamentals of natural computing: Basic concepts, algorithms, and applications. Boca Raton: Chapman & Hall/CRC, 2006.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Federico, Carminati, Galli Carminati Giuliana, and SpringerLink (Online service), eds. From the Web to the Grid and Beyond: Computing Paradigms Driven by High-Energy Physics. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Nev.) International Conference on Scientific Computing and Applications (8th 2012 Las Vegas. Recent advances in scientific computing and applications: Eigth International Conference on Scientific Computing and Applications, April 1-4, 2012, University of Nevada, Las Vegas, Nevada. Edited by Li, Jichun, editor of compilation, Yang, Hongtao, 1962- editor of compilation, and Machorro, Eric A. (Eric Alexander), 1969- editor of compilation. Providence, Rhode Island: American Mathematical Society, 2013.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Application of quantum computing"

1

Akama, Seiki. "Applications of Quantum Computing." In Elements of Quantum Computing, 91–100. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-08284-4_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Yung, Choi Tim Antony, Laurice Sattouf, William Tam, Andro Younan, Chandler L. Snyder, Shadrach W. Viste, Anthony Nursalim, et al. "Quantum Computing and Its Application in Cryptography." In Proceedings of the Future Technologies Conference (FTC) 2021, Volume 3, 301–10. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-89912-7_23.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Calude, Cristian S. "Dialogues on Quantum Computing." In Formal Languages and Applications, 493–505. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-39886-8_26.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

(Bo) Ewald, Robert H. "An Introduction to Quantum Computing and Its Application." In Quantum Technology and Optimization Problems, 3–8. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-14082-3_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Brooks, Michael. "Applications." In Quantum Computing and Communications, 43–47. London: Springer London, 1999. http://dx.doi.org/10.1007/978-1-4471-0839-9_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Leena, H. U., and R. Lawrance. "Future Perspectives of Quantum Applications Using AI." In Quantum Computing Environments, 193–207. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-89746-8_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Hughes, Ciaran, Joshua Isaacson, Anastasia Perry, Ranbel F. Sun, and Jessica Turner. "Quantum Teleportation." In Quantum Computing for the Quantum Curious, 73–79. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-61601-4_8.

Full text
Abstract:
AbstractOne interesting application of entanglement is quantum teleportation, which is a technique for transferring an unknown quantum state from one place to another. In science fiction, teleportation generally involves a machine scanning a person and another machine reassembling the person on the other end. The original body disintegrates and no longer exists. Similarly, quantum teleportation works by “scanning” the original qubit, sending a recipe, and reconstructing the qubit elsewhere. The original qubit is not physically destroyed in the science fiction sense, but it is no longer in the same state. Otherwise, the previously mentioned no-cloning theorem—which states that a qubit cannot be exactly copied onto another qubit—would be violated.1 As we will see, the “scanning” part poses a problem which can only be solved by leveraging quantum entanglement.
APA, Harvard, Vancouver, ISO, and other styles
8

Ozhigov, Y. "Quantum Computer Can Not Speed Up Iterated Applications of a Black Box." In Quantum Computing and Quantum Communications, 152–59. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-49208-9_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Saakian, D. B., and A. E. Allahverdyan. "Strengthened Lindblad Inequality: Applications in Non-equilibrium Thermodynamics and Quantum Information Theory." In Quantum Computing and Quantum Communications, 296–301. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-49208-9_26.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Chuharski, Jake M. "Adiabatic Quantum Computing and Applications to Music." In Quantum Computer Music, 357–72. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-13909-3_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Application of quantum computing"

1

Manykin, E. A., and E. V. Melnichenko. "TRFWM application for quantum computing." In International Quantum Electronics Conference, 2005. IEEE, 2005. http://dx.doi.org/10.1109/iqec.2005.1561074.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Barila, Adina. "From classical computing to quantum computing." In 2014 International Conference on Development and Application Systems (DAS). IEEE, 2014. http://dx.doi.org/10.1109/daas.2014.6842455.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Zoller, P. "Quantum Computing." In The European Conference on Lasers and Electro-Optics. Washington, D.C.: Optica Publishing Group, 1996. http://dx.doi.org/10.1364/cleo_europe.1996.tutg.

Full text
Abstract:
In this tutorial we review basic ideas of quantum computing, from quantum bits and state entanglement to quantum gates and quantum networks [1]. In addition, we give an overview over possible physical implementations of quantum gates[2-6], with emphasis on quantum optical systems: this includes ion traps [2,3], and cavity QED in the optical and microwave domain [4-6], Fundamental problems of building quantum computers, in particular the decoherence problem, and error correction schemes for quantum memory elements [7] and quantum gates [8] will be discussed. We conclude with a critical evaluation what should be expected from quantum computing ideas in terms of applications in physics (quantum optics) and mathematics within the nest few years.
APA, Harvard, Vancouver, ISO, and other styles
4

UCHIYAMA, CHIKAKO. "CONTROL OF DECOHERENCE WITH MULTIPULSE APPLICATION." In Quantum Information and Computing. WORLD SCIENTIFIC, 2006. http://dx.doi.org/10.1142/9789812774491_0029.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Tretyakov, D. B., I. I. Beterov, V. M. Entin, and I. I. Ryabtsev. "Application of Rydberg atoms to quantum computing." In SPIE Proceedings, edited by Yuri I. Ozhigov. SPIE, 2006. http://dx.doi.org/10.1117/12.683123.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Li, Meng-liang, Hong Yang, and Xiong Guo. "Research on Quantum Computing Technology and Application." In Proceedings of the 2019 International Conference on Modeling, Analysis, Simulation Technologies and Applications (MASTA 2019). Paris, France: Atlantis Press, 2019. http://dx.doi.org/10.2991/masta-19.2019.30.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Li, Hongyu, Aaron Chit Siong Lau, Norhanani Jaafar, Rainer Cheow Siong Lee, Calvin Pei Yu Wong, Kuan Eng Johnson Goh, and King-Jien Chui. "3D Cryogenic Interposer for Quantum Computing Application." In 2022 IEEE 72nd Electronic Components and Technology Conference (ECTC). IEEE, 2022. http://dx.doi.org/10.1109/ectc51906.2022.00246.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Thompson, Mark G. "Photonic Quantum Computing." In CLEO: Applications and Technology. Washington, D.C.: OSA, 2020. http://dx.doi.org/10.1364/cleo_at.2020.ath1i.1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

White, Andrew. "Photonic Quantum Computing." In CLEO: Applications and Technology. Washington, D.C.: OSA, 2012. http://dx.doi.org/10.1364/cleo_at.2012.jw3i.1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

O’Brien, J. L. "Photonic Quantum Computing." In CLEO: Applications and Technology. Washington, D.C.: OSA, 2017. http://dx.doi.org/10.1364/cleo_at.2017.jth1e.1.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Application of quantum computing"

1

Steel, Duncan G. Development and Application of Semiconductor Quantum Dots to Quantum Computing. Fort Belvoir, VA: Defense Technical Information Center, March 2002. http://dx.doi.org/10.21236/ada413562.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Wachen, John, and Steven McGee. Qubit by Qubit’s Four-Week Quantum Computing Summer School Evaluation Report for 2021. The Learning Partnership, September 2021. http://dx.doi.org/10.51420/report.2021.4.

Full text
Abstract:
Qubit by Qubit’s Quantum Computing Summer School is a four-week summer course for high school and university students in their first or second year of studies. The aim of the summer school is to introduce the field of Quantum Information Sciences and Engineering (QISE), specifically quantum computing. Through the course, students learn about quantum mechanics, quantum computation and information (quantum gates, circuits, and algorithms and protocols, including Grover’s Algorithm and Quantum Key Distribution), applications of quantum computing, and quantum hardware. Students also learn how to program in Qiskit and basic mathematics for quantum, including matrices and vectors. The Quantum Computing Summer School program enrolled a diverse population of high school and undergraduate students with 48% of participants identifying at female or non-binary, 20% of students identifying as Hispanic, 17% identifying as Black, and 38% identifying as Asian. The program substantially increased participants’ knowledge about quantum computing, as exhibited by large gains on a technical assessment that was administered at the beginning and end of the program. On a survey of student motivation, students in the program showed a statistically significant increase in their expectancy of being successful in quantum computing and valuing quantum computing. From the beginning of the program to the end of the program, there was a statistically significant increase in students’ reported sense of belonging in quantum. Participation in the program increased students’ interest in pursuing additional coursework and careers in STEM generally and in quantum specifically.
APA, Harvard, Vancouver, ISO, and other styles
3

Mou, Chung-Yuan. Applications of Nanotechnology in Biomimetics and Quantum Computing. Fort Belvoir, VA: Defense Technical Information Center, October 2007. http://dx.doi.org/10.21236/ada473229.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Tracy, Lisa A., John Louis Reno, and Terry W. Hargett. High-mobility 2D hole systems for quantum computing applications. Office of Scientific and Technical Information (OSTI), October 2012. http://dx.doi.org/10.2172/1055622.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Allende López, Marcos, Diego López, Sergio Cerón, Antonio Leal, Adrián Pareja, Marcelo Da Silva, Alejandro Pardo, et al. Quantum-Resistance in Blockchain Networks. Inter-American Development Bank, June 2021. http://dx.doi.org/10.18235/0003313.

Full text
Abstract:
This paper describes the work carried out by the Inter-American Development Bank, the IDB Lab, LACChain, Cambridge Quantum Computing (CQC), and Tecnológico de Monterrey to identify and eliminate quantum threats in blockchain networks. The advent of quantum computing threatens internet protocols and blockchain networks because they utilize non-quantum resistant cryptographic algorithms. When quantum computers become robust enough to run Shor's algorithm on a large scale, the most used asymmetric algorithms, utilized for digital signatures and message encryption, such as RSA, (EC)DSA, and (EC)DH, will be no longer secure. Quantum computers will be able to break them within a short period of time. Similarly, Grover's algorithm concedes a quadratic advantage for mining blocks in certain consensus protocols such as proof of work. Today, there are hundreds of billions of dollars denominated in cryptocurrencies that rely on blockchain ledgers as well as the thousands of blockchain-based applications storing value in blockchain networks. Cryptocurrencies and blockchain-based applications require solutions that guarantee quantum resistance in order to preserve the integrity of data and assets in their public and immutable ledgers. We have designed and developed a layer-two solution to secure the exchange of information between blockchain nodes over the internet and introduced a second signature in transactions using post-quantum keys. Our versatile solution can be applied to any blockchain network. In our implementation, quantum entropy was provided via the IronBridge Platform from CQC and we used LACChain Besu as the blockchain network.
APA, Harvard, Vancouver, ISO, and other styles
6

Sands, Georgia. The synthesis of a covalent-organic framework for applications in quantum computing. Office of Scientific and Technical Information (OSTI), July 2022. http://dx.doi.org/10.2172/1879346.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Hemmer, Philip, and Robert Armstrong. Fractal-Enhancement of Photon Band-Gap Cavities for Quantum Computing and Other Applications. Fort Belvoir, VA: Defense Technical Information Center, August 2005. http://dx.doi.org/10.21236/ada444845.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Elmgren, Karson, Ashwin Acharya, and Will Will Hunt. Superconductor Electronics Research. Center for Security and Emerging Technology, November 2021. http://dx.doi.org/10.51593/20210003.

Full text
Abstract:
Devices based on superconductor electronics can achieve much higher energy efficiency than standard electronics. Research in superconductor electronics could advance a range of commercial and defense priorities, with potential applications for supercomputing, artificial intelligence, sensors, signal processing, and quantum computing. This brief identifies the countries most actively contributing to superconductor electronics research and assesses their relative competitiveness in terms of both research output and funding.
APA, Harvard, Vancouver, ISO, and other styles
9

Sexton-Kennedy, Elizabeth S., and James Amundson. Quantum Computing. Office of Scientific and Technical Information (OSTI), January 2019. http://dx.doi.org/10.2172/1477986.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Pakin, Scott D. Quantum Computing. Office of Scientific and Technical Information (OSTI), December 2017. http://dx.doi.org/10.2172/1415361.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Application of quantum computing' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography