You searched for subject:(quantum computing).
Showing records 1 – 30 of
503 total matches.
◁ [1] [2] [3] [4] [5] … [17] ▶
University of Oxford
1.
Endo, Suguru.
Hybrid quantum-classical algorithms and error mitigation.
Degree: PhD, 2019, University of Oxford
URL: http://ora.ox.ac.uk/objects/uuid:6733c0f6-1b19-4d12-a899-18946aa5df85 
;
https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.791688
► These days, research groups such as Google, Microsoft, and Rigetti are working towards fabricating quantum devices which have hundreds to thousands of qubits. In recently…
(more)
▼ These days, research groups such as Google, Microsoft, and Rigetti are working towards fabricating quantum devices which have hundreds to thousands of qubits. In recently proposed quantum algorithms, i.e. hybrid quantum-classical algorithms, such quantum devices are used as subroutines for calculation of classically intractable tasks. However, the applicability of hybrid algorithms was quite limited, for example, the search of the ground state, and simulation of the dynamics of quan- tum systems. In addition, near-term quantum devices are expected to be quite noisy, impairing the precision of computation seriously and removing any potential advantages with quantum computers. Therefore, it is necessary to extend the applicability of hybrid algorithms and mitigate errors on quantum computers. In this thesis, we describe the generalisation of hybrid algorithms so that they can be applied to variety of problems, such as search of the spectrum of quantum systems, simulation of open quantum systems and even general mathematical tasks. The algorithm for finding spectra is useful for applications such as new drug discovery, design of batteries. Generally speaking, quantum systems of interest to physicists, chemists, and materials scientists inevitably interact with their environments, and quantum states are decohered. Therefore, to investigate quantum phenomena, new algorithms simulating open quantum systems are described in this thesis. Algorithms for general mathematical tasks such as matrix multiplication to a vector and solving linear equations, useful for a large number of problems, such as machine learning, are also presented. Furthermore, in order to make hybrid algorithms useful, we also invented a practical error mitigation method for suppressing physical errors, which may make hybrid algorithms useful. We showed that errors can be suppressed for a quantum system with over 50 qubits for the current achievable error rate, which is believed to be hard to simulate with classical computers. Also, we generalised the error mitigation technique to be applied to mitigate algorithmic errors, which may enhance the accuracy of Hamiltonian simulation.
Subjects/Keywords: Quantum computing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Endo, S. (2019). Hybrid quantum-classical algorithms and error mitigation. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:6733c0f6-1b19-4d12-a899-18946aa5df85 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.791688
Chicago Manual of Style (16th Edition):
Endo, Suguru. “Hybrid quantum-classical algorithms and error mitigation.” 2019. Doctoral Dissertation, University of Oxford. Accessed January 16, 2021.
http://ora.ox.ac.uk/objects/uuid:6733c0f6-1b19-4d12-a899-18946aa5df85 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.791688.
MLA Handbook (7th Edition):
Endo, Suguru. “Hybrid quantum-classical algorithms and error mitigation.” 2019. Web. 16 Jan 2021.
Vancouver:
Endo S. Hybrid quantum-classical algorithms and error mitigation. [Internet] [Doctoral dissertation]. University of Oxford; 2019. [cited 2021 Jan 16].
Available from: http://ora.ox.ac.uk/objects/uuid:6733c0f6-1b19-4d12-a899-18946aa5df85 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.791688.
Council of Science Editors:
Endo S. Hybrid quantum-classical algorithms and error mitigation. [Doctoral Dissertation]. University of Oxford; 2019. Available from: http://ora.ox.ac.uk/objects/uuid:6733c0f6-1b19-4d12-a899-18946aa5df85 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.791688
California State Polytechnic University – Pomona
2.
Rodriguez, Juan.
Encryption and Decryption Systems Using Post-Quantum Technology.
Degree: MS, Department of Computer Science, 2020, California State Polytechnic University – Pomona
URL: http://hdl.handle.net/10211.3/216832
► For decades, the RSA algorithm has been the leading algorithm for encryption and decryption security systems. The fact of using RSA infrastructure is that everything…
(more)
▼ For decades, the RSA algorithm has been the leading algorithm for encryption and decryption security systems. The fact of using RSA infrastructure is that everything is performed using a server system, which are classical computers meaning that there are some limitations in processing power threshold. There are many leading companies, such as governments, financial, and many other industries that currently uses the RSA algorithm to encrypt their data whenever it is being transferred between the computer and the server. Today, there exists a newer technology that is more powerful than the classical computer that we are currently using today, and that innovative technology is
quantum computing. This technology can perform a brute-force attack, encryption, and decryption process, and many more at a very fast and impressive speed that no other technologies are able to perform. Due to its outstanding speed, this will open door to vulnerabilities, which means that if hackers get their hands on the
quantum technology and have knowledge of writing PyQuil programs, then they will be able to successfully perform a brute-force attack on RSA system meaning that RSA algorithm will no longer be the safest security standard for industries to use. For this research study, experiments will be performed on several encryption and decryption post-
quantum algorithms to compare and determine which of these algorithms are the most secure for the industry to utilize them for their encryption system. The algorithms that will be used in this experiment are the Diffie-Hellman Key Exchange, Merkle Signature Scheme, Ring-LWE Signature, and Rainbow. In this experiment, the advantages and disadvantages of using these four algorithms will be determined alongside determining the best post-
quantum algorithm for encryption and decryption system.
Advisors/Committee Members: Young, Gilbert (advisor), Sun, Yu (committee member).
Subjects/Keywords: quantum computing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Rodriguez, J. (2020). Encryption and Decryption Systems Using Post-Quantum Technology. (Masters Thesis). California State Polytechnic University – Pomona. Retrieved from http://hdl.handle.net/10211.3/216832
Chicago Manual of Style (16th Edition):
Rodriguez, Juan. “Encryption and Decryption Systems Using Post-Quantum Technology.” 2020. Masters Thesis, California State Polytechnic University – Pomona. Accessed January 16, 2021.
http://hdl.handle.net/10211.3/216832.
MLA Handbook (7th Edition):
Rodriguez, Juan. “Encryption and Decryption Systems Using Post-Quantum Technology.” 2020. Web. 16 Jan 2021.
Vancouver:
Rodriguez J. Encryption and Decryption Systems Using Post-Quantum Technology. [Internet] [Masters thesis]. California State Polytechnic University – Pomona; 2020. [cited 2021 Jan 16].
Available from: http://hdl.handle.net/10211.3/216832.
Council of Science Editors:
Rodriguez J. Encryption and Decryption Systems Using Post-Quantum Technology. [Masters Thesis]. California State Polytechnic University – Pomona; 2020. Available from: http://hdl.handle.net/10211.3/216832
University of Melbourne
3.
Wang, David.
Topological quantum error correction and quantum algorithm simulations.
Degree: 2011, University of Melbourne
URL: http://hdl.handle.net/11343/36984
► Quantum computers are machines that manipulate quantum information stored in the form of qubits, the quantum analogue to the classical bit. Unlike the bit, quantum…
(more)
▼ Quantum computers are machines that manipulate quantum information stored in the form of qubits, the quantum analogue to the classical bit. Unlike the bit, quantum mechanics allows a qubit to be in a linear superposition of both its basis states. Given the same number of bits and qubits, the latter stores exponentially more information. Quantum algorithms exploit these superposition states, allowing quantum computers to solve problems such as prime number factorisation and searches faster than classical computers.
Realising a large-scale quantum computer is difficult because quantum information is highly susceptible to noise. Error correction may be employed to suppress the noise, so that the results of large quantum algorithms are valid. The overhead incurred from introducing error correction is neutralised if all elementary quantum operations are constructed with an error rate below some threshold error rate. Below threshold, arbitrary length quantum computation is possible. We investigate two topological quantum error correcting codes, the planar code and the 2D colour code. We find the threshold for the 2D colour code to be 0.1%, and improve the planar code threshold from 0.75% to 1.1%.
Existing protocols for the transmission of quantum states are hindered by maximum communication distances and low communication rates. We adapt the planar code for use in quantum communication, and show that this allows the fault-tolerant transmission of quantum information over arbitrary distances at a rate limited only by local quantum gate speed.
Error correction is an expensive investment and thus one seeks to employ as little as possible without compromising the integrity of the results. It is therefore important to study the robustness of algorithms to noise. We show that using the matrix product state representation allows one to simulate far larger instances of the quantum factoring algorithm than under the traditional amplitude formalism representation. We simulate systems with as many as 42 qubits on a single processor with 32GB RAM, comparable to amplitude formalism simulations performed on far larger computers.
Subjects/Keywords: quantum computing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Wang, D. (2011). Topological quantum error correction and quantum algorithm simulations. (Doctoral Dissertation). University of Melbourne. Retrieved from http://hdl.handle.net/11343/36984
Chicago Manual of Style (16th Edition):
Wang, David. “Topological quantum error correction and quantum algorithm simulations.” 2011. Doctoral Dissertation, University of Melbourne. Accessed January 16, 2021.
http://hdl.handle.net/11343/36984.
MLA Handbook (7th Edition):
Wang, David. “Topological quantum error correction and quantum algorithm simulations.” 2011. Web. 16 Jan 2021.
Vancouver:
Wang D. Topological quantum error correction and quantum algorithm simulations. [Internet] [Doctoral dissertation]. University of Melbourne; 2011. [cited 2021 Jan 16].
Available from: http://hdl.handle.net/11343/36984.
Council of Science Editors:
Wang D. Topological quantum error correction and quantum algorithm simulations. [Doctoral Dissertation]. University of Melbourne; 2011. Available from: http://hdl.handle.net/11343/36984
University of Waterloo
4.
Onuma-Kalu, Marvellous.
Exploring new routes to decoherence-free quantum computing; and quantum thermodynamics for fermions.
Degree: 2020, University of Waterloo
URL: http://hdl.handle.net/10012/15540
► This thesis has two parts; the first part is a contribution to the research field of quantum measurement in quantum optics while the second part…
(more)
▼ This thesis has two parts; the first part is a contribution to the research field of quantum measurement in quantum optics while the second part focuses on quantum thermodynamics for fermionic systems.
The aim of the research on quantum optics is to detect and subsequently characterize quantum states of light. Specifically, we focus on characterizing 1) entanglement between a two-level atom and superposition of coherent states (known as Bell cat state) 2) quantum superposition of coherent states (Schrödinger cat states). The photon is the particle of light which carries quantum information; it is usually lost (destroyed) while being detected. Many physical implementations of quantum logic gate aim to encode quantum information processing into large registers of entangled qubits. However for these larger much distinguishable states, creating and preserving entanglement becomes difficult due to rapid onset of decoherence. Encoding quantum information on Schrodinger's cat states take advantage of a cavity resonators much larger Hilbert space, as compared with that of a two-level system. This architecture allows redundant qubit encodings that can simplify the operations needed to initialize, manipulate and measure the encoded information. For such a system to be viable as a quantum computing platform, efficient measurement of such encoded qubit observables must be possible.
The concept of quantum non demolition measurement was introduced to evade the problem of decoherence. Researchers now know through quantum theory that it is indeed possible to count photons in a given state of light without destroying them. This nondestructive measurement scheme is coined in the term ``quantum non-demolition measurement". We can extend the ideas of quantum nondemolition measurement scheme to detect a system made up of two or more quantum states (not necessarily states of light) that are combined based on the superposition principle. An example is the Schrödinger's cat state which is a superposition of two coherent states of light of equal amplitudes but opposite phase. At this point, one is not only interested in counting photons, but in understanding the nature of the superposition, the possible problems and the different physical properties that follow. Ways to detect the Schrödinger cat states and subsequently a Bell cat state (Schrödinger cat entangled with a qubit) without significantly perturbing them are discussed. The method analyzed is the mode-invisibility measurement scheme earlier proposed to detect single Fock states and coherent states of light. The method gives a new insight to the known properties of Schrödinger cat states and contributes to our understanding of the quantum-classical boundary problem.
The second part of the thesis falls in the research field of quantum thermodynamics and open quantum systems. Most problems in quantum thermodynamics have been explored in bosonic systems with little or less done in fermionic systems. Therefore the aim of this part of the thesis is to explore related…
Subjects/Keywords: Quantum computing; Quantum theory; Fermions
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Onuma-Kalu, M. (2020). Exploring new routes to decoherence-free quantum computing; and quantum thermodynamics for fermions. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/15540
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Onuma-Kalu, Marvellous. “Exploring new routes to decoherence-free quantum computing; and quantum thermodynamics for fermions.” 2020. Thesis, University of Waterloo. Accessed January 16, 2021.
http://hdl.handle.net/10012/15540.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Onuma-Kalu, Marvellous. “Exploring new routes to decoherence-free quantum computing; and quantum thermodynamics for fermions.” 2020. Web. 16 Jan 2021.
Vancouver:
Onuma-Kalu M. Exploring new routes to decoherence-free quantum computing; and quantum thermodynamics for fermions. [Internet] [Thesis]. University of Waterloo; 2020. [cited 2021 Jan 16].
Available from: http://hdl.handle.net/10012/15540.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Onuma-Kalu M. Exploring new routes to decoherence-free quantum computing; and quantum thermodynamics for fermions. [Thesis]. University of Waterloo; 2020. Available from: http://hdl.handle.net/10012/15540
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
University of Washington
5.
Crosson, Elizabeth.
Classical and Quantum Computation in Ground States and Beyond.
Degree: PhD, 2015, University of Washington
URL: http://hdl.handle.net/1773/34128
► In this dissertation we study classical and quantum spin systems with applications to the theory of computation. In particular, we examine computational aspects of these…
(more)
▼ In this dissertation we study classical and
quantum spin systems with applications to the theory of computation. In particular, we examine computational aspects of these systems beyond their ground states by considering the effects of non-zero temperatures and excited energy states. In the first part we show that universal classical computations can be encoded into equilibrium thermal states of classical spin systems, at sufficiently low temperatures which are independent of the system size. In the second part we explore different strategies for optimization with the
quantum adiabatic algorithm, and we show that it is possible to increase the success probability for hard random instances by following the counterintuitive strategy of evolving along the Hamiltonian path more rapidly. In the third part we examine the performance of simulated
quantum annealing in finding the minimum of an energy function which contains a high energy barrier, and we provide evidence that simulated
quantum annealing inherits some of the advantages of
quantum annealing which allow it to pass through the high barrier and minimize the energy function efficiently. In the last part we show that the path-integral
quantum Monte Carlo method leads to a provably efficient algorithm for approximating the partition function of any 1D generalized transverse Ising spin chain (with position-dependent local fields and frustrated interactions), at temperatures which are independent of the system size.
Advisors/Committee Members: Den Nijs, Marcel P (advisor).
Subjects/Keywords: Quantum Computing; Quantum physics; physics
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Crosson, E. (2015). Classical and Quantum Computation in Ground States and Beyond. (Doctoral Dissertation). University of Washington. Retrieved from http://hdl.handle.net/1773/34128
Chicago Manual of Style (16th Edition):
Crosson, Elizabeth. “Classical and Quantum Computation in Ground States and Beyond.” 2015. Doctoral Dissertation, University of Washington. Accessed January 16, 2021.
http://hdl.handle.net/1773/34128.
MLA Handbook (7th Edition):
Crosson, Elizabeth. “Classical and Quantum Computation in Ground States and Beyond.” 2015. Web. 16 Jan 2021.
Vancouver:
Crosson E. Classical and Quantum Computation in Ground States and Beyond. [Internet] [Doctoral dissertation]. University of Washington; 2015. [cited 2021 Jan 16].
Available from: http://hdl.handle.net/1773/34128.
Council of Science Editors:
Crosson E. Classical and Quantum Computation in Ground States and Beyond. [Doctoral Dissertation]. University of Washington; 2015. Available from: http://hdl.handle.net/1773/34128
University of Waterloo
6.
Govia, Luke Colin Gene.
Theory and Applications of Josephson Photomultipliers.
Degree: 2012, University of Waterloo
URL: http://hdl.handle.net/10012/6971
► This thesis describes the back action of microwave-photon detection via a Josephson photomultiplier (JPM), a superconducting qubit coupled strongly to a high-quality mi- crowave cavity,…
(more)
▼ This thesis describes the back action of microwave-photon detection via a Josephson photomultiplier (JPM), a superconducting qubit coupled strongly to a high-quality mi- crowave cavity, and the applications of these devices. The back action operator depends qualitatively on the duration of the measurement interval, resembling the regular photon annihilation operator at short interaction times and approaching a variant of the photon subtraction operator at long times. The optimal operating conditions of the JPM differ from those considered optimal for processing and storing of quantum information, in that a short T2 of the JPM suppresses the cavity dephasing incurred during measurement. Un- derstanding this back action opens the possibility to perform multiple JPM measurements on the same state, hence performing efficient state tomography. In addition, this the- sis describes the creation of non-classical states of microwave radiation via single photon detection using JPMs. When operated in the low T2 regime, the back action of a JPM resembles the photon subtraction operator. Using the non-linearity of this back action, it is possible to create non-classical states of microwave radiation, including squeezed vacuum and odd Schro ̈dinger cat states, starting from a coherent state.
Subjects/Keywords: Quantum Information; Quantum Computing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Govia, L. C. G. (2012). Theory and Applications of Josephson Photomultipliers. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/6971
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Govia, Luke Colin Gene. “Theory and Applications of Josephson Photomultipliers.” 2012. Thesis, University of Waterloo. Accessed January 16, 2021.
http://hdl.handle.net/10012/6971.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Govia, Luke Colin Gene. “Theory and Applications of Josephson Photomultipliers.” 2012. Web. 16 Jan 2021.
Vancouver:
Govia LCG. Theory and Applications of Josephson Photomultipliers. [Internet] [Thesis]. University of Waterloo; 2012. [cited 2021 Jan 16].
Available from: http://hdl.handle.net/10012/6971.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Govia LCG. Theory and Applications of Josephson Photomultipliers. [Thesis]. University of Waterloo; 2012. Available from: http://hdl.handle.net/10012/6971
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Dalhousie University
7.
Yousefabadi, Navid.
OPTIMAL ANNEALING PATHS FOR ADIABATIC QUANTUM
COMPUTATION.
Degree: MS, Department of Physics & Atmospheric
Science, 2011, Dalhousie University
URL: http://hdl.handle.net/10222/14381
► Shor’s algorithm shows that circuit-model quantum computers can factorize integers in polynomial time – exponentially more efficiently than classical computers. There is currently no analogous…
(more)
▼ Shor’s algorithm shows that circuit-model
quantum
computers can factorize integers in polynomial time – exponentially
more efficiently than classical computers. There is currently no
analogous algorithm for Adiabatic
Quantum Computers(AQCs). We
illustrate through a number of factorization problems that a naive
AQC implemen- tation fails to reveal an exponential speed up. An
exponential speed up does become evident with the optimization of
the AQC evolution path utilizing existing optimisa- tion
approaches. We reduce the computation time even further by
optimization over heuristically-derived parametrised functions.
Finally, we improve our own results by exploring two-dimensional
paths, and give arguments that using more dimensions in the search
space can enhance the computational power to an even greater
extent.
Advisors/Committee Members: Andrew D. Rutenberg (external-examiner), Randall Martin (graduate-coordinator), Kimberley C. Hall (thesis-reader), Jordan Kyriakidis (thesis-supervisor), Not Applicable (ethics-approval), Not Applicable (manuscripts), Not Applicable (copyright-release).
Subjects/Keywords: Adiabatic Quantum Computing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Yousefabadi, N. (2011). OPTIMAL ANNEALING PATHS FOR ADIABATIC QUANTUM
COMPUTATION. (Masters Thesis). Dalhousie University. Retrieved from http://hdl.handle.net/10222/14381
Chicago Manual of Style (16th Edition):
Yousefabadi, Navid. “OPTIMAL ANNEALING PATHS FOR ADIABATIC QUANTUM
COMPUTATION.” 2011. Masters Thesis, Dalhousie University. Accessed January 16, 2021.
http://hdl.handle.net/10222/14381.
MLA Handbook (7th Edition):
Yousefabadi, Navid. “OPTIMAL ANNEALING PATHS FOR ADIABATIC QUANTUM
COMPUTATION.” 2011. Web. 16 Jan 2021.
Vancouver:
Yousefabadi N. OPTIMAL ANNEALING PATHS FOR ADIABATIC QUANTUM
COMPUTATION. [Internet] [Masters thesis]. Dalhousie University; 2011. [cited 2021 Jan 16].
Available from: http://hdl.handle.net/10222/14381.
Council of Science Editors:
Yousefabadi N. OPTIMAL ANNEALING PATHS FOR ADIABATIC QUANTUM
COMPUTATION. [Masters Thesis]. Dalhousie University; 2011. Available from: http://hdl.handle.net/10222/14381
Dalhousie University
8.
Snow-Kropla, Elliot.
COMPILING PROGRAMS FOR AN ADIABATIC QUANTUM COMPUTER.
Degree: MS, Department of Physics & Atmospheric
Science, 2014, Dalhousie University
URL: http://hdl.handle.net/10222/53780
► A method for compiling programs for adiabatic quantum computers is described, and the resulting programs evaluated on a physically implemented adiabatic quantum machine. These results…
(more)
▼ A method for compiling programs for adiabatic
quantum
computers is described, and the resulting programs evaluated on a
physically implemented adiabatic
quantum machine. These results are
used to characterize the performance of the machine. The AQC
machine is found to perform well on some problems with linear
scaling with problem size for some instances, but it performs
poorly on others and is unable to solve a 6-variable satisfiability
problem at all.
Advisors/Committee Members: n/a (external-examiner), Dr. Kevin Hewitt (graduate-coordinator), Dr. Daniel Labrie (thesis-reader), Dr. Scott Chapman (thesis-reader), Dr. Jordan Kyriakidis (thesis-supervisor), Not Applicable (ethics-approval), Not Applicable (manuscripts), Not Applicable (copyright-release).
Subjects/Keywords: Physics; Quantum Computing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Snow-Kropla, E. (2014). COMPILING PROGRAMS FOR AN ADIABATIC QUANTUM COMPUTER. (Masters Thesis). Dalhousie University. Retrieved from http://hdl.handle.net/10222/53780
Chicago Manual of Style (16th Edition):
Snow-Kropla, Elliot. “COMPILING PROGRAMS FOR AN ADIABATIC QUANTUM COMPUTER.” 2014. Masters Thesis, Dalhousie University. Accessed January 16, 2021.
http://hdl.handle.net/10222/53780.
MLA Handbook (7th Edition):
Snow-Kropla, Elliot. “COMPILING PROGRAMS FOR AN ADIABATIC QUANTUM COMPUTER.” 2014. Web. 16 Jan 2021.
Vancouver:
Snow-Kropla E. COMPILING PROGRAMS FOR AN ADIABATIC QUANTUM COMPUTER. [Internet] [Masters thesis]. Dalhousie University; 2014. [cited 2021 Jan 16].
Available from: http://hdl.handle.net/10222/53780.
Council of Science Editors:
Snow-Kropla E. COMPILING PROGRAMS FOR AN ADIABATIC QUANTUM COMPUTER. [Masters Thesis]. Dalhousie University; 2014. Available from: http://hdl.handle.net/10222/53780
University of Edinburgh
9.
Pius, Einar.
Parallel quantum computing : from theory to practice.
Degree: PhD, 2015, University of Edinburgh
URL: http://hdl.handle.net/1842/15857
► The term quantum parallelism is commonly used to refer to a property of quantum computations where an algorithm can act simultaneously on a superposition of…
(more)
▼ The term quantum parallelism is commonly used to refer to a property of quantum computations where an algorithm can act simultaneously on a superposition of states. However, this is not the only aspect of parallelism in quantum computing. Analogously to the classical computing model, every algorithm consists of elementary quantum operations and the application of them could be parallelised itself. This kind of parallelism is explored in this thesis in the one way quantum computing (1WQC) and the quantum circuit model. In the quantum circuit model we explore arithmetic circuits and circuit complexity theory. Two new arithmetic circuits for quantum computers are introduced in this work: an adder and a multiply-adder. The latter is especially interesting because its depth (i.e. the number of parallel steps required to finish the computation) is smaller than for any known classical circuit when applied sequentially. From the complexity theoretical perspective we concentrate on the classes QAC0 and QAC0[2], the quantum counterparts of AC0 and AC0[2]. The class AC0 comprises of constant depth circuits with unbounded fan-in AND and OR gates and AC0[2] is obtained when unbounded fan-in parity gates are added to AC0 circuits. We prove that QAC0 circuits with two layers of multi-qubit gates cannot compute parity exactly. This is a step towards proving QAC0 6= QAC0[2], a relation known to hold for AC0 and AC0[2]. In 1WQC, computation is done through measurements on an entangled state called the resource state. Two well known parallelisation methods exist in this model: signal shifting and finding the maximally delayed general flow. The first one uses the measurement calculus formalism to rewrite the dependencies of an existing computation, whereas the second technique exploits the geometry of the resource state to find the optimal ordering of measurements. We prove that the aforementioned methods result in same depth computations when the input and output sizes are equal. Through showing this equivalence we reveal new properties of 1WQC computations and design a new algorithm for the above mentioned parallelisations.
Subjects/Keywords: 006.3; quantum computing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Pius, E. (2015). Parallel quantum computing : from theory to practice. (Doctoral Dissertation). University of Edinburgh. Retrieved from http://hdl.handle.net/1842/15857
Chicago Manual of Style (16th Edition):
Pius, Einar. “Parallel quantum computing : from theory to practice.” 2015. Doctoral Dissertation, University of Edinburgh. Accessed January 16, 2021.
http://hdl.handle.net/1842/15857.
MLA Handbook (7th Edition):
Pius, Einar. “Parallel quantum computing : from theory to practice.” 2015. Web. 16 Jan 2021.
Vancouver:
Pius E. Parallel quantum computing : from theory to practice. [Internet] [Doctoral dissertation]. University of Edinburgh; 2015. [cited 2021 Jan 16].
Available from: http://hdl.handle.net/1842/15857.
Council of Science Editors:
Pius E. Parallel quantum computing : from theory to practice. [Doctoral Dissertation]. University of Edinburgh; 2015. Available from: http://hdl.handle.net/1842/15857
Macquarie University
10.
Kieferová, Mária.
Quantum algorithmic techniques for fault-tolerant quantum computers.
Degree: 2019, Macquarie University
URL: http://hdl.handle.net/1959.14/1274798
► Empirical thesis.
Degree carried out under a cotutelle program with the University of Waterloo.
Bibliography: pages139-161.
1. Introduction – 2. Background – 3. Quantum sort…
(more)
▼ Empirical thesis.
Degree carried out under a cotutelle program with the University of Waterloo.
Bibliography: pages139-161.
1. Introduction – 2. Background – 3. Quantum sort and shuffle – 4. Simulation of time-dependent Hamiltonians – 5. Training and tomography with quantum Boltzmann machines – 6. Conclusion and future work – Abbreviations – References – Appendices.
Quantum computers have the potential to push the limits of computation in areas such as quantum chemistry, cryptography, optimization, and machine learning. Even though many quantum algorithms show asymptotic improvement compared to classical ones, the overhead of running quantum computers limits when quantum computing becomes useful. Thus, by optimizing components of quantum algorithms, we can bring the regime of quantum advantage closer. My work focuses on developing efficient subroutines for quantum computation. I focus specifically on algorithms for scalable, fault-tolerant quantum computers. While it is possible that even noisy quantum computers can outperform classical ones for specific tasks, high-depth and therefore fault-tolerance is likely required for most applications. In this thesis, I introduce three sets of techniques that can be used by themselves or as subroutines in other algorithms.
The first components are coherent versions of classical sort and shuffle. We require that a quantum shuffle prepares a uniform superposition over all permutations of a sequence. The quantum sort is used within the shuffle and as well as in the next algorithm in this thesis. The quantum shuffle is an essential part of state preparation for quantum chemistry computation in first quantization.
Second, I review the progress of Hamiltonian simulations and give a new algorithm for simulating time-dependent Hamiltonians. This algorithm scales polylogarithmic in the inverse error, and the query complexity does not depend on the derivatives of the Hamiltonian. A time-dependent Hamiltonian simulation was recently used for interaction picture simulation with applications to quantum chemistry.
Next, I present a fully quantum Boltzmann machine. I show that our algorithm can train on quantum data and learn a classical description of quantum states. This type of machine learning can be used for tomography, Hamiltonian learning, and approximate quantum cloning.
1 online resource (xv, 166 pages) colour illustrations
Advisors/Committee Members: Macquarie University. Department of Physics and Astronomy, University of Waterloo.
Subjects/Keywords: Quantum computing; Computer algorithms; Fault-tolerant computing; quantum computing; quantum algorithms
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Kieferová, M. (2019). Quantum algorithmic techniques for fault-tolerant quantum computers. (Doctoral Dissertation). Macquarie University. Retrieved from http://hdl.handle.net/1959.14/1274798
Chicago Manual of Style (16th Edition):
Kieferová, Mária. “Quantum algorithmic techniques for fault-tolerant quantum computers.” 2019. Doctoral Dissertation, Macquarie University. Accessed January 16, 2021.
http://hdl.handle.net/1959.14/1274798.
MLA Handbook (7th Edition):
Kieferová, Mária. “Quantum algorithmic techniques for fault-tolerant quantum computers.” 2019. Web. 16 Jan 2021.
Vancouver:
Kieferová M. Quantum algorithmic techniques for fault-tolerant quantum computers. [Internet] [Doctoral dissertation]. Macquarie University; 2019. [cited 2021 Jan 16].
Available from: http://hdl.handle.net/1959.14/1274798.
Council of Science Editors:
Kieferová M. Quantum algorithmic techniques for fault-tolerant quantum computers. [Doctoral Dissertation]. Macquarie University; 2019. Available from: http://hdl.handle.net/1959.14/1274798
University of Bristol
11.
Morley-Short, Sam.
Towards realistic architectures for linear optical quantum computing.
Degree: PhD, 2019, University of Bristol
URL: https://research-information.bris.ac.uk/en/studentTheses/ecf3e9e6-3287-4dcd-871b-d879a8bf0bec
;
https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.774447
► With the end of Moore's Law within sight, quantum computers offer a tantalising paradigm shift in computational power. Currently, many quanta are competing to realise…
(more)
▼ With the end of Moore's Law within sight, quantum computers offer a tantalising paradigm shift in computational power. Currently, many quanta are competing to realise such a revolutionary device, of which this thesis considers one in particular: linear optical quantum computation (LOQC). Over the past decade LOQC architectures have developed from "efficient" but unfeasible toy models to serious contenders. A significant step in previous works was the blueprint of an LOQC architecture that could be conceivably implemented with idealised optical components. However, in reality nature is not kind and devices not ideal. As such, we consider open questions addressing gaps between LOQC's theoretical architecture and experimental constraints. In doing so, a selection of numerical tools are also developed for the design, simulation and analyses of novel architectures. Specifically, we consider three problems. Firstly, can an infinite-sized quantum state be realised within a finite-sized device? Through development of a simple, generalised model, we find some small, finite device size at which the infinite state is faithfully reproduced. We also find that increasing device size above this confers no advantage, thereby identifying some necessary and sufficient minimum LOQC device size. Secondly, we consider the challenge of accommodating unheralded photon loss in an LOQC architecture, a problem for which no previous solution was known. By developing a novel protocol for optimal teleportation on stabilizer states, we show that unheralded loss may be tolerated, perhaps entirely, by adaptive measurement strategies. Finally, we consider the optimisation of LOQC architectures via local complementation. This work both sets hard limits on the states accessible by postselected linear optics circuits as well as develops novel tools for the analysis of higher-dimensional quantum states. We conclude with an example of how such works can be combined to optimise the LOQC architecture as well as provide improved device resource estimates.
Subjects/Keywords: 530; quantum computing; linear optical quantum computing; photonics; quantum computing architectures
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Morley-Short, S. (2019). Towards realistic architectures for linear optical quantum computing. (Doctoral Dissertation). University of Bristol. Retrieved from https://research-information.bris.ac.uk/en/studentTheses/ecf3e9e6-3287-4dcd-871b-d879a8bf0bec ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.774447
Chicago Manual of Style (16th Edition):
Morley-Short, Sam. “Towards realistic architectures for linear optical quantum computing.” 2019. Doctoral Dissertation, University of Bristol. Accessed January 16, 2021.
https://research-information.bris.ac.uk/en/studentTheses/ecf3e9e6-3287-4dcd-871b-d879a8bf0bec ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.774447.
MLA Handbook (7th Edition):
Morley-Short, Sam. “Towards realistic architectures for linear optical quantum computing.” 2019. Web. 16 Jan 2021.
Vancouver:
Morley-Short S. Towards realistic architectures for linear optical quantum computing. [Internet] [Doctoral dissertation]. University of Bristol; 2019. [cited 2021 Jan 16].
Available from: https://research-information.bris.ac.uk/en/studentTheses/ecf3e9e6-3287-4dcd-871b-d879a8bf0bec ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.774447.
Council of Science Editors:
Morley-Short S. Towards realistic architectures for linear optical quantum computing. [Doctoral Dissertation]. University of Bristol; 2019. Available from: https://research-information.bris.ac.uk/en/studentTheses/ecf3e9e6-3287-4dcd-871b-d879a8bf0bec ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.774447
University of Waterloo
12.
Chamberland, Christopher.
New methods in quantum error correction and fault-tolerant quantum computing.
Degree: 2018, University of Waterloo
URL: http://hdl.handle.net/10012/14049
► Quantum computers have the potential to solve several interesting problems in polynomial time for which no polynomial time classical algorithms have been found. However, one…
(more)
▼ Quantum computers have the potential to solve several interesting problems in polynomial
time for which no polynomial time classical algorithms have been found. However,
one of the major challenges in building quantum devices is that quantum systems are very
sensitive to noise arising from undesired interactions with the environment. Noise can lead
to errors which can corrupt the results of the computation. Quantum error correction is
one way to mitigate the effects of noise arising in quantum devices.
With a plethora of quantum error correcting codes that can be used in various settings,
one of the main challenges of quantum error correction is understanding how well various
codes perform under more realistic noise models that can be observed in experiments.
This thesis proposes a new decoding algorithm which can optimize threshold values of
error correcting codes under different noise models. The algorithm can be applied to
any Markovian noise model. Further, it is shown that for certain noise models, logical
Clifford corrections can further improve a code's threshold value if the code obeys certain
symmetries.
Since gates and measurements cannot in general be performed with perfect precision,
the operations required to perform quantum error correction can introduce more errors
into the system thus negating the benefits of error correction. Fault-tolerant quantum
computing is a way to perform quantum error correction with imperfect operations while
retaining the ability to suppress errors as long as the noise is below a code's threshold.
One of the main challenges in performing fault-tolerant error correction is the high resource
requirements that are needed to obtain very low logical noise rates. With the use of
flag qubits, this thesis develops new fault-tolerant error correction protocols that are applicable
to arbitrary distance codes. Various code families are shown to satisfy the requirements
of flag fault-tolerant error correction. We also provide circuits using a constant number of
qubits for these codes. It is shown that the proposed flag fault-tolerant method uses fewer
qubits than previous fault-tolerant error correction protocols.
It is often the case that the noise afflicting a quantum device cannot be fully characterized.
Further, even with some knowledge of the noise, it can be very challenging to use
analytic decoding methods to improve the performance of a fault-tolerant scheme. This
thesis presents decoding schemes using several state of the art machine learning techniques
with a focus on fault-tolerant quantum error correction in regimes that are relevant to near
term experiments. It is shown that even in low noise rate regimes and with no knowledge
of the noise, noise can be further suppressed for small distance codes. Limitations of machine
learning decoders as well as the classical resources required to perform active error
correction are discussed.
In many cases, gate times can be much shorter than typical measurement times of
quantum states.…
Subjects/Keywords: Quantum error correction; Quantum computing; Fault-tolerant quantum computing; Quantum information
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Chamberland, C. (2018). New methods in quantum error correction and fault-tolerant quantum computing. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/14049
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Chamberland, Christopher. “New methods in quantum error correction and fault-tolerant quantum computing.” 2018. Thesis, University of Waterloo. Accessed January 16, 2021.
http://hdl.handle.net/10012/14049.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Chamberland, Christopher. “New methods in quantum error correction and fault-tolerant quantum computing.” 2018. Web. 16 Jan 2021.
Vancouver:
Chamberland C. New methods in quantum error correction and fault-tolerant quantum computing. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2021 Jan 16].
Available from: http://hdl.handle.net/10012/14049.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Chamberland C. New methods in quantum error correction and fault-tolerant quantum computing. [Thesis]. University of Waterloo; 2018. Available from: http://hdl.handle.net/10012/14049
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
University of Waterloo
13.
Kothari, Robin.
Efficient algorithms in quantum query complexity.
Degree: 2014, University of Waterloo
URL: http://hdl.handle.net/10012/8625
► In this thesis we provide new upper and lower bounds on the quantum query complexity of a diverse set of problems. Specifically, we study quantum…
(more)
▼ In this thesis we provide new upper and lower bounds on the quantum query complexity of a diverse set of problems. Specifically, we study quantum algorithms for Hamiltonian simulation, matrix multiplication, oracle identification, and graph-property recognition.
For the Hamiltonian simulation problem, we provide a quantum algorithm with query complexity sublogarithmic in the inverse error, an exponential improvement over previous methods. Our algorithm is based on a new quantum algorithm for implementing unitary matrices that can be written as linear combinations of efficiently implementable unitary gates. This algorithm uses a new form of ``oblivious amplitude amplification'' that can be applied even though the reflection about the input state is unavailable.
In the oracle identification problem, we are given oracle access to an unknown N-bit string x promised to belong to a known set of size M, and our task is to identify x. We present the first quantum algorithm for the problem that is optimal in its dependence on N and M. Our algorithm is based on ideas from classical learning theory and a new composition theorem for solutions of the filtered gamma2-norm semidefinite program.
We then study the quantum query complexity of matrix multiplication and related problems over rings, semirings, and the Boolean semiring in particular. Our main result is an output-sensitive algorithm for Boolean matrix multiplication that multiplies two n x n Boolean matrices with query complexity O(n sqrt{l}), where l is the sparsity of the output matrix. The algorithm is based on a reduction to the graph collision problem and a new algorithm for graph collision.
Finally, we study the quantum query complexity of minor-closed graph properties and show that most minor-closed properties – those that cannot be characterized by a finite set of forbidden subgraphs – have quantum query complexity Theta(n3/2) and those that do have such a characterization can be solved strictly faster, with o(n3/2) queries. Our lower bound is based on a detailed analysis of the structure of minor-closed properties with respect to forbidden topological minors and forbidden subgraphs. Our algorithms are a novel application of the quantum walk search framework and give improved upper bounds for several subgraph-finding problems.
Subjects/Keywords: Quantum computing; Quantum algorithms; Quantum query complexity
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Kothari, R. (2014). Efficient algorithms in quantum query complexity. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/8625
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Kothari, Robin. “Efficient algorithms in quantum query complexity.” 2014. Thesis, University of Waterloo. Accessed January 16, 2021.
http://hdl.handle.net/10012/8625.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Kothari, Robin. “Efficient algorithms in quantum query complexity.” 2014. Web. 16 Jan 2021.
Vancouver:
Kothari R. Efficient algorithms in quantum query complexity. [Internet] [Thesis]. University of Waterloo; 2014. [cited 2021 Jan 16].
Available from: http://hdl.handle.net/10012/8625.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Kothari R. Efficient algorithms in quantum query complexity. [Thesis]. University of Waterloo; 2014. Available from: http://hdl.handle.net/10012/8625
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Wesleyan University
14.
Kan, Angus.
Quantum Computing: Temperature Scaling of Decoherence.
Degree: Physics, 2018, Wesleyan University
URL: https://wesscholar.wesleyan.edu/etd_mas_theses/193
► After years of effort by quantum scientists, decoherence due to thermal effects still remains a huge hindrance to the upscaling of quantum computers. This…
(more)
▼ After years of effort by
quantum scientists, decoherence due to thermal effects still remains a huge hindrance to the upscaling of
quantum computers. This thesis presents the temperature scaling of decoherence in a trapped-ion qubit. Microscopic
quantum noise simulations are carried out. The resulting numerical scaling laws of coherence times, T1 and T2, are presented. The results enable experimentalists to determine, as a function of temperature, an upper bound for the time over which a
quantum computer can be operated without a disastrous loss of
quantum coherence, and the duration over which a memory qubit retains its information. Given the tradeoff between the enormous resource overhead demanded by
quantum error correction protocols and the adverse effects of decoherence, the results provide guidance for the implementation and optimization of practical error suppression methods in the current era of
quantum computers.
Advisors/Committee Members: Reinhold Blümel.
Subjects/Keywords: Quantum; Quantum Computing; Quantum Information; Decoherence
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Kan, A. (2018). Quantum Computing: Temperature Scaling of Decoherence. (Masters Thesis). Wesleyan University. Retrieved from https://wesscholar.wesleyan.edu/etd_mas_theses/193
Chicago Manual of Style (16th Edition):
Kan, Angus. “Quantum Computing: Temperature Scaling of Decoherence.” 2018. Masters Thesis, Wesleyan University. Accessed January 16, 2021.
https://wesscholar.wesleyan.edu/etd_mas_theses/193.
MLA Handbook (7th Edition):
Kan, Angus. “Quantum Computing: Temperature Scaling of Decoherence.” 2018. Web. 16 Jan 2021.
Vancouver:
Kan A. Quantum Computing: Temperature Scaling of Decoherence. [Internet] [Masters thesis]. Wesleyan University; 2018. [cited 2021 Jan 16].
Available from: https://wesscholar.wesleyan.edu/etd_mas_theses/193.
Council of Science Editors:
Kan A. Quantum Computing: Temperature Scaling of Decoherence. [Masters Thesis]. Wesleyan University; 2018. Available from: https://wesscholar.wesleyan.edu/etd_mas_theses/193
15.
Schmitz, Albert Thomas.
Quantum Walks: Theory, Application, And Implementation.
Degree: MS, Physics & Astrophysics, 2016, University of North Dakota
URL: https://commons.und.edu/theses/1959
► The quantum walk is a method for conceptualizing and designing quantum computing algorithms and it comes in two forms: the continuous-time and discrete-time quantum…
(more)
▼ The
quantum walk is a method for conceptualizing and designing
quantum computing algorithms and it comes in two forms: the continuous-time and discrete-time
quantum walk. The thesis is organized into three parts, each of which looks to develop the concept and uses of the
quantum walk. The first part is the theory of the
quantum walk. This includes definitions and considerations for the various incarnations of the discrete-time
quantum walk and a discussion on the general method for connecting the continuous-time and discrete-time versions. As a result, it is shown that most versions of the discrete-time
quantum walk can be put into a general form and this can be used to simulate any continuous-time
quantum walk. The second part uses these results for a hypothetical application. The application presented is a search algorithm that appears to scale in the time for completion independent of the size of the search space. This behavior is then elaborated upon and shown to have general qualitative agreement with simulations to within the approximations that are made. The third part introduces a method of implementation. Given a universal
quantum computer, the method is discussed and shown to simulate an arbitrary discrete-time
quantum walk. Some of the benefits of this method are that half the unitary evolution can be achieved without the use of any gates and there may be some possibility for error detection. The three parts combined suggest a possible experiment, given a
quantum computing scheme of sufficient robustness.
Advisors/Committee Members: William W. Schwalm.
Subjects/Keywords: Quantum Algorithm; Quantum Computing; Quantum Walks
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Schmitz, A. T. (2016). Quantum Walks: Theory, Application, And Implementation. (Masters Thesis). University of North Dakota. Retrieved from https://commons.und.edu/theses/1959
Chicago Manual of Style (16th Edition):
Schmitz, Albert Thomas. “Quantum Walks: Theory, Application, And Implementation.” 2016. Masters Thesis, University of North Dakota. Accessed January 16, 2021.
https://commons.und.edu/theses/1959.
MLA Handbook (7th Edition):
Schmitz, Albert Thomas. “Quantum Walks: Theory, Application, And Implementation.” 2016. Web. 16 Jan 2021.
Vancouver:
Schmitz AT. Quantum Walks: Theory, Application, And Implementation. [Internet] [Masters thesis]. University of North Dakota; 2016. [cited 2021 Jan 16].
Available from: https://commons.und.edu/theses/1959.
Council of Science Editors:
Schmitz AT. Quantum Walks: Theory, Application, And Implementation. [Masters Thesis]. University of North Dakota; 2016. Available from: https://commons.und.edu/theses/1959
University of New Mexico
16.
Cesare, Christopher.
Topological Code Architectures for Quantum Computation.
Degree: Physics & Astronomy, 2014, University of New Mexico
URL: http://hdl.handle.net/1928/24543
► This dissertation is concerned with quantum computation using many-body quantum systems encoded in topological codes. The interest in these topological systems has increased in recent…
(more)
▼ This dissertation is concerned with
quantum computation using many-body
quantum systems encoded in topological codes. The interest in these topological systems has increased in recent years as devices in the lab begin to reach the fidelities required for performing arbitrarily long
quantum algorithms. The most well-studied system, Kitaev's toric code, provides both a physical substrate for performing universal fault-tolerant
quantum computations and a useful pedagogical tool for explaining the way other topological codes work. In this dissertation, I first review the necessary formalism for
quantum information and
quantum stabilizer codes, and then I introduce two families of topological codes: Kitaev's toric code and Bombin's color codes. I then present three chapters of original work. First, I explore the distinctness of encoding schemes in the color codes. Second, I introduce a model of
quantum computation based on the toric code that uses adiabatic interpolations between static Hamiltonians with gaps constant in the system size. Lastly, I describe novel state distillation protocols that are naturally suited for topological architectures and show that they provide resource savings in terms of the number of required ancilla states when compared to more traditional approaches to
quantum gate approximation.
Advisors/Committee Members: Landahl, Andrew, Miyake, Akimasa, Allahverdi, Rouzbeh, Deutsch, Ivan.
Subjects/Keywords: physics; quantum; quantum computing; quantum memory
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Cesare, C. (2014). Topological Code Architectures for Quantum Computation. (Doctoral Dissertation). University of New Mexico. Retrieved from http://hdl.handle.net/1928/24543
Chicago Manual of Style (16th Edition):
Cesare, Christopher. “Topological Code Architectures for Quantum Computation.” 2014. Doctoral Dissertation, University of New Mexico. Accessed January 16, 2021.
http://hdl.handle.net/1928/24543.
MLA Handbook (7th Edition):
Cesare, Christopher. “Topological Code Architectures for Quantum Computation.” 2014. Web. 16 Jan 2021.
Vancouver:
Cesare C. Topological Code Architectures for Quantum Computation. [Internet] [Doctoral dissertation]. University of New Mexico; 2014. [cited 2021 Jan 16].
Available from: http://hdl.handle.net/1928/24543.
Council of Science Editors:
Cesare C. Topological Code Architectures for Quantum Computation. [Doctoral Dissertation]. University of New Mexico; 2014. Available from: http://hdl.handle.net/1928/24543
University of Waterloo
17.
Layden, David.
Indirect Quantum Control: An Implementation-Independent Scheme.
Degree: 2016, University of Waterloo
URL: http://hdl.handle.net/10012/10645
► The ability to control quantum systems rapidly as compared to their coherence times is a central requirement for most proposed quantum technologies, such as quantum…
(more)
▼ The ability to control quantum systems rapidly as compared to their coherence times is a central requirement for most proposed quantum technologies, such as quantum computing and quantum metrology. Improving the ratio of control timescales to coherence times, however, is made difficult by the fact that both timescales depend on the coupling strength between systems and their environment. One promising method of improving this ratio involves indirect control: steering a quantum system via a quantum actuator, rather than by driving it directly. While this approach has shown promise in a variety of experimental
settings, all implementations to date have relied crucially on special properties of the system at hand, and the control schemes they have used are not generally applicable to arbitrary systems.
Here we propose an implementation-independent indirect control scheme. It relies upon an unexpected emergent feature of a model in which a quantum system is made to interact with a rapid succession of ancillas, one at a time. We introduce this model by discussing the quantum Zeno effect, a special instance of quantum control in which a state is preserved through frequent measurements. We then further develop the model and show how it can be used to construct a universal scheme for indirect quantum control. Finally, we discuss the possibility of using this scheme not only for coherent control, but also for dissipative quantum control, which has a number of important applications.
Subjects/Keywords: Quantum physics; Quantum computing; Quantum control
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Layden, D. (2016). Indirect Quantum Control: An Implementation-Independent Scheme. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/10645
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Layden, David. “Indirect Quantum Control: An Implementation-Independent Scheme.” 2016. Thesis, University of Waterloo. Accessed January 16, 2021.
http://hdl.handle.net/10012/10645.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Layden, David. “Indirect Quantum Control: An Implementation-Independent Scheme.” 2016. Web. 16 Jan 2021.
Vancouver:
Layden D. Indirect Quantum Control: An Implementation-Independent Scheme. [Internet] [Thesis]. University of Waterloo; 2016. [cited 2021 Jan 16].
Available from: http://hdl.handle.net/10012/10645.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Layden D. Indirect Quantum Control: An Implementation-Independent Scheme. [Thesis]. University of Waterloo; 2016. Available from: http://hdl.handle.net/10012/10645
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Princeton University
18.
Liu, Yanbing.
Reservoir engineering in circuit quantum electrodynamics
.
Degree: PhD, 2016, Princeton University
URL: http://arks.princeton.edu/ark:/88435/dsp01mw22v794j
► Superconducting circuits have become an ideal platform to implement prototypi- cal quantum computing ideas and to study nonequilibrium quantum dynamics. This thesis covers research topics…
(more)
▼ Superconducting circuits have become an ideal platform to implement prototypi- cal
quantum computing ideas and to study nonequilibrium
quantum dynamics. This thesis covers research topics conducted in both subfields. Fast and reliable readout of volatile
quantum states is one of the key requirements to build a universal
quantum computer. In the first part, we utilize a number of techniques, ranging from a low noise amplifier to an on-chip stepped-impedance Purcell filter, to improve superconducting qubits readout fidelity. Interestingly, full
quantum theory of SIPF requires the understanding of strong coupling
quantum electrodynamics near a photonic band-gap. This problem, intimately tied to
quantum impurity problems in condensed matter physics, has never been studied experimentally prior to the development of superconducting circuits. This realization then leads to the second part, the study of atom-light interaction in structured vacuum. The word ‘structured’ means the spectral function of the vacuum is drastically different from that of free space. We directly couple a transmon qubit to a microwave photonic crystal and discuss the concepts of photon bound states and
quantum dissipative engineering in such a system. Following this research direction,
quantum electrodynamics in a driven multimode cavity, another form of structured vacuum, is also investigated both experimentally and theoretically. The most intriguing phenomenon is the multimode ultranarrow resonance fluorescence, attributed to correlated light emission.
Advisors/Committee Members: Houck, Andrew (advisor).
Subjects/Keywords: quantum computing;
quantum electrodynamics;
quantum optics
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Liu, Y. (2016). Reservoir engineering in circuit quantum electrodynamics
. (Doctoral Dissertation). Princeton University. Retrieved from http://arks.princeton.edu/ark:/88435/dsp01mw22v794j
Chicago Manual of Style (16th Edition):
Liu, Yanbing. “Reservoir engineering in circuit quantum electrodynamics
.” 2016. Doctoral Dissertation, Princeton University. Accessed January 16, 2021.
http://arks.princeton.edu/ark:/88435/dsp01mw22v794j.
MLA Handbook (7th Edition):
Liu, Yanbing. “Reservoir engineering in circuit quantum electrodynamics
.” 2016. Web. 16 Jan 2021.
Vancouver:
Liu Y. Reservoir engineering in circuit quantum electrodynamics
. [Internet] [Doctoral dissertation]. Princeton University; 2016. [cited 2021 Jan 16].
Available from: http://arks.princeton.edu/ark:/88435/dsp01mw22v794j.
Council of Science Editors:
Liu Y. Reservoir engineering in circuit quantum electrodynamics
. [Doctoral Dissertation]. Princeton University; 2016. Available from: http://arks.princeton.edu/ark:/88435/dsp01mw22v794j
University of Waterloo
19.
Edwards, Marcus.
Towards Practical Hybrid Quantum / Classical Computing.
Degree: 2020, University of Waterloo
URL: http://hdl.handle.net/10012/16383
► Quantum computing is in a critical phase where theoretical schemes and protocols are now being implemented in the real world for the first time. Experimental…
(more)
▼ Quantum computing is in a critical phase where theoretical schemes and protocols are now being implemented in the real world for the first time. Experimental implementations can help us solidify ideas, and can also complicate them. In the case of quantum communication protocols, we present the first experimental implementations of two entanglement-based schemes using IBM’s superconducting transmon qubit based technology. We find that the schemes are experimentally feasible with current technology, and give an idea of how much room for improvement there is before quantum technology can meet the highest theoretical expectations. These communication schemes may be fundamental components of the future quantum internet. We also present an overview of the emerging field of quantum blockchain protocols that could form a part of the quantum / classical communication structures of the future. Interaction between classical and quantum technologies can impair purely quantum designs, but can also be harnessed to enhance hybrid quantum / classical approaches. Finally, we suggest a path towards the hybridization of arbitrary code execution and verification in the hybrid quantum / classical networks of the future.
Subjects/Keywords: quantum information; quantum blockchain; quantum teleportation; quantum algorithms; quantum annealing; quantum computing; hybrid quantum / classical computing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Edwards, M. (2020). Towards Practical Hybrid Quantum / Classical Computing. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/16383
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Edwards, Marcus. “Towards Practical Hybrid Quantum / Classical Computing.” 2020. Thesis, University of Waterloo. Accessed January 16, 2021.
http://hdl.handle.net/10012/16383.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Edwards, Marcus. “Towards Practical Hybrid Quantum / Classical Computing.” 2020. Web. 16 Jan 2021.
Vancouver:
Edwards M. Towards Practical Hybrid Quantum / Classical Computing. [Internet] [Thesis]. University of Waterloo; 2020. [cited 2021 Jan 16].
Available from: http://hdl.handle.net/10012/16383.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Edwards M. Towards Practical Hybrid Quantum / Classical Computing. [Thesis]. University of Waterloo; 2020. Available from: http://hdl.handle.net/10012/16383
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Georgia Tech
20.
Schieber, Matthew Cole.
Optimizing computational kernels in quantum chemistry.
Degree: MS, Computational Science and Engineering, 2018, Georgia Tech
URL: http://hdl.handle.net/1853/59949
► Density fitting is a rank reduction technique popularly used in quantum chemistry in order to reduce the computational cost of evaluating, transforming, and processing the…
(more)
▼ Density fitting is a rank reduction technique popularly used in
quantum chemistry in
order to reduce the computational cost of evaluating, transforming, and processing the
4-center electron repulsion integrals (ERIs). By utilizing the resolution of the identity technique, density fitting reduces the 4-center ERIs into a 3-center form. Doing so not only alleviates the high storage cost of the ERIs, but it also reduces the computational cost of operations involving them. Still, these operations can remain as computational bottlenecks which commonly plague
quantum chemistry procedures. The goal of this thesis is to investigate various optimizations for density-fitted version of computational kernels used ubiquitously throughout
quantum chemistry. First, we detail the spatial sparsity available to the 3-center integrals and the application of such sparsity to various operations, including integral computation, metric contractions, and integral transformations. Next, we investigate sparse memory layouts and their implication on the performance of the integral transformation kernel. Next, we analyze two transformation algorithms and how their performance will vary depending on the context in which they are used. Then, we propose two sparse memory layouts and the resulting performance of Coulomb and exchange evaluations. Since the memory required for these tensors grows rapidly, we frame these discussions in the context of their in-core and disk performance. We implement these methods in the P SI 4 electronic structure package and reveal the optimal algorithm for the kernel should vary depending on whether a disk-based implementation must be used.
Advisors/Committee Members: Sherrill, Charles D. (advisor), Chow, Edmond (committee member), McDaniel, Jesse (committee member).
Subjects/Keywords: Quantum chemistry; Parallel computing; High performance computing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Schieber, M. C. (2018). Optimizing computational kernels in quantum chemistry. (Masters Thesis). Georgia Tech. Retrieved from http://hdl.handle.net/1853/59949
Chicago Manual of Style (16th Edition):
Schieber, Matthew Cole. “Optimizing computational kernels in quantum chemistry.” 2018. Masters Thesis, Georgia Tech. Accessed January 16, 2021.
http://hdl.handle.net/1853/59949.
MLA Handbook (7th Edition):
Schieber, Matthew Cole. “Optimizing computational kernels in quantum chemistry.” 2018. Web. 16 Jan 2021.
Vancouver:
Schieber MC. Optimizing computational kernels in quantum chemistry. [Internet] [Masters thesis]. Georgia Tech; 2018. [cited 2021 Jan 16].
Available from: http://hdl.handle.net/1853/59949.
Council of Science Editors:
Schieber MC. Optimizing computational kernels in quantum chemistry. [Masters Thesis]. Georgia Tech; 2018. Available from: http://hdl.handle.net/1853/59949
Georgia Tech
21.
Li, Muyuan.
Fault-tolerance on near-term quantum computers and subsystem quantum error correcting codes.
Degree: PhD, Computational Science and Engineering, 2020, Georgia Tech
URL: http://hdl.handle.net/1853/62750
► Large-scale fault-tolerant quantum computers are supposed to provide exponential speedup over many classical algorithms for solving realistic computationally intensive problems. Given that practical quantum computers…
(more)
▼ Large-scale fault-tolerant
quantum computers are supposed to provide exponential speedup over many classical algorithms for solving realistic computationally intensive problems. Given that practical
quantum computers are extremely sensitive to noise, error correction protocols have to be employed in order to suppress noises in the
quantum system and maintain the fidelity of computations. As
quantum computing experiments are progressing into the regime where active
quantum error correction can soon be implemented, it is becoming more important to understand the properties of small
quantum error correcting codes and how to efficiently implement them in actual experiments given realistic near-term
quantum device specifications. In this dissertation, we present our work on suppressing errors in
quantum computing systems in two directions: realizing fault-tolerance with several small
quantum error-correcting codes under realistic device assumptions, and developing large-scale code families with subsystem
quantum error correcting codes. For small codes such as the Bare [[7,1,3]] code, the Bacon-Shor code, and the rotated 17-qubit surface code, we show designs for implementing them in realistic ion trap
quantum computers while minimizing the amount of resources needed and optimizing fidelity of the logical system. For families of subsystem
quantum error correcting codes, we investigate the compass codes, Bravyi-Bacon-Shor codes and subsystem hypergraph product codes, and show that these codes can be advantageous in terms of handling biased noises, having good code parameters, and exhibiting efficient decoding performance.
Advisors/Committee Members: Brown, Kenneth R. (advisor), Kennedy, Brian (committee member), Vuduc, Richard (committee member), Chow, Edmond (committee member), Sherrill, David (committee member).
Subjects/Keywords: Quantum computing; Quantum error correction; Ion trap
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Li, M. (2020). Fault-tolerance on near-term quantum computers and subsystem quantum error correcting codes. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/62750
Chicago Manual of Style (16th Edition):
Li, Muyuan. “Fault-tolerance on near-term quantum computers and subsystem quantum error correcting codes.” 2020. Doctoral Dissertation, Georgia Tech. Accessed January 16, 2021.
http://hdl.handle.net/1853/62750.
MLA Handbook (7th Edition):
Li, Muyuan. “Fault-tolerance on near-term quantum computers and subsystem quantum error correcting codes.” 2020. Web. 16 Jan 2021.
Vancouver:
Li M. Fault-tolerance on near-term quantum computers and subsystem quantum error correcting codes. [Internet] [Doctoral dissertation]. Georgia Tech; 2020. [cited 2021 Jan 16].
Available from: http://hdl.handle.net/1853/62750.
Council of Science Editors:
Li M. Fault-tolerance on near-term quantum computers and subsystem quantum error correcting codes. [Doctoral Dissertation]. Georgia Tech; 2020. Available from: http://hdl.handle.net/1853/62750
University of Waterloo
22.
Peters, Evan.
Applications of the Quantum Kernel Method on a Superconducting Quantum Processor.
Degree: 2020, University of Waterloo
URL: http://hdl.handle.net/10012/15962
► The widespread benefits of classical machine learning along with promised speedups by quantum algorithms over their best performing classical counterparts have motivated development of quantum…
(more)
▼ The widespread benefits of classical machine learning along with promised speedups by quantum algorithms over their best performing classical counterparts have motivated development of quantum machine learning algorithms that combine these two approaches. Quantum Kernel Methods (QKMs) [22, 49] describe one such combination, which seeks to leverage the high dimensional Hilbert space over quantum states to perform classification on encoded classical data. In this work I present an analysis of QKM algorithms used to encode and classify real data using a quantum processor, aided by a suite of custom noise models and hardware optimizations. I introduce and validate techniques for error mitigation and readout error correction designed specifically for this algorithm/hardware combination. Though I do not achieve high accuracy with one type of QKM-based classifier, I provide evidence for possible fundamental limitations to the QKM as well as hardware limitations that are unaccounted for by a reasonable Markovian noise model.
Subjects/Keywords: quantum machine learning; quantum computing; machine learning
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Peters, E. (2020). Applications of the Quantum Kernel Method on a Superconducting Quantum Processor. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/15962
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Peters, Evan. “Applications of the Quantum Kernel Method on a Superconducting Quantum Processor.” 2020. Thesis, University of Waterloo. Accessed January 16, 2021.
http://hdl.handle.net/10012/15962.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Peters, Evan. “Applications of the Quantum Kernel Method on a Superconducting Quantum Processor.” 2020. Web. 16 Jan 2021.
Vancouver:
Peters E. Applications of the Quantum Kernel Method on a Superconducting Quantum Processor. [Internet] [Thesis]. University of Waterloo; 2020. [cited 2021 Jan 16].
Available from: http://hdl.handle.net/10012/15962.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Peters E. Applications of the Quantum Kernel Method on a Superconducting Quantum Processor. [Thesis]. University of Waterloo; 2020. Available from: http://hdl.handle.net/10012/15962
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Harvard University
23.
Tempel, David Gabriel.
Time-Dependent Density Functional Theory for Open Quantum Systems and Quantum Computation.
Degree: PhD, Physics, 2012, Harvard University
URL: http://nrs.harvard.edu/urn-3:HUL.InstRepos:9396424
► First-principles electronic structure theory explains properties of atoms, molecules and solids from underlying physical principles without input from empirical parameters. Time-dependent density functional theory (TDDFT)…
(more)
▼ First-principles electronic structure theory explains properties of atoms, molecules and solids from underlying physical principles without input from empirical parameters. Time-dependent density functional theory (TDDFT) has emerged as arguably the most widely used first-principles method for describing the time-dependent quantum mechanics of many-electron systems. In this thesis, we will show how the fundamental principles of TDDFT can be extended and applied in two novel directions: The theory of open quantum systems (OQS) and quantum computation (QC). In the first part of this thesis, we prove theorems that establish the foundations of TDDFT for open quantum systems (OQS-TDDFT). OQS-TDDFT allows for a first principles description of non-equilibrium systems, in which the electronic degrees of freedom undergo relaxation and decoherence due to coupling with a thermal environment, such as a vibrational or photon bath. We then discuss properties of functionals in OQS-TDDFT and investigate how these differ from functionals in conventional TDDFT using an exactly solvable model system. Next, we formulate OQS-TDDFT in the linear-response regime, which gives access to environmentally broadened excitation spectra. Lastly, we present a hybrid approach in which TDDFT can be used to construct master equations from first-principles for describing energy transfer in condensed phase systems. In the second part of this thesis, we prove that the theorems of TDDFT can be extended to a class of qubit Hamiltonians that are universal for quantum computation. TDDFT applied to universal Hamiltonians implies that single-qubit expectation values can be used as the basic variables in quantum computation and information theory, rather than wavefunctions. This offers the possibility of simplifying computations by using the principles of TDDFT similar to how it is applied in electronic structure theory. Lastly, we discuss a related result; the computational complexity of TDDFT.
Physics
Advisors/Committee Members: Aspuru-Guzik, Alan (advisor).
Subjects/Keywords: open quantum systems; quantum computing; TDDFT; physics
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Tempel, D. G. (2012). Time-Dependent Density Functional Theory for Open Quantum Systems and Quantum Computation. (Doctoral Dissertation). Harvard University. Retrieved from http://nrs.harvard.edu/urn-3:HUL.InstRepos:9396424
Chicago Manual of Style (16th Edition):
Tempel, David Gabriel. “Time-Dependent Density Functional Theory for Open Quantum Systems and Quantum Computation.” 2012. Doctoral Dissertation, Harvard University. Accessed January 16, 2021.
http://nrs.harvard.edu/urn-3:HUL.InstRepos:9396424.
MLA Handbook (7th Edition):
Tempel, David Gabriel. “Time-Dependent Density Functional Theory for Open Quantum Systems and Quantum Computation.” 2012. Web. 16 Jan 2021.
Vancouver:
Tempel DG. Time-Dependent Density Functional Theory for Open Quantum Systems and Quantum Computation. [Internet] [Doctoral dissertation]. Harvard University; 2012. [cited 2021 Jan 16].
Available from: http://nrs.harvard.edu/urn-3:HUL.InstRepos:9396424.
Council of Science Editors:
Tempel DG. Time-Dependent Density Functional Theory for Open Quantum Systems and Quantum Computation. [Doctoral Dissertation]. Harvard University; 2012. Available from: http://nrs.harvard.edu/urn-3:HUL.InstRepos:9396424
Columbia University
24.
Hadfield, Stuart Andrew.
Quantum Algorithms for Scientific Computing and Approximate Optimization.
Degree: 2018, Columbia University
URL: https://doi.org/10.7916/D8X650C9
► Quantum computation appears to offer significant advantages over classical computation and this has generated a tremendous interest in the field. In this thesis we study…
(more)
▼ Quantum computation appears to offer significant advantages over classical computation and this has generated a tremendous interest in the field. In this thesis we study the application of quantum computers to computational problems in science and engineering, and to combinatorial optimization problems. We outline the results below.
Algorithms for scientific computing require modules, i.e., building blocks, implementing elementary numerical functions that have well-controlled numerical error, are uniformly scalable and reversible, and that can be implemented efficiently. We derive quantum algorithms and circuits for computing square roots, logarithms, and arbitrary fractional powers, and derive worst-case error and cost bounds. We describe a modular approach to quantum algorithm design as a first step towards numerical standards and mathematical libraries for quantum scientific computing.
A fundamental but computationally hard problem in physics is to solve the time-independent Schrödinger equation. This is accomplished by computing the eigenvalues of the corresponding Hamiltonian operator. The eigenvalues describe the different energy levels of a system. The cost of classical deterministic algorithms computing these eigenvalues grows exponentially with the number of system degrees of freedom. The number of degrees of freedom is typically proportional to the number of particles in a physical system. We show an efficient quantum algorithm for approximating a constant number of low-order eigenvalues of a Hamiltonian using a perturbation approach. We apply this algorithm to a special case of the Schrödinger equation and show that our algorithm succeeds with high probability, and has cost that scales polynomially with the number of degrees of freedom and the reciprocal of the desired accuracy. This improves and extends earlier results on quantum algorithms for estimating the ground state energy.
We consider the simulation of quantum mechanical systems on a quantum computer. We show a novel divide and conquer approach for Hamiltonian simulation. Using the Hamiltonian structure, we can obtain faster simulation algorithms. Considering a sum of Hamiltonians we split them into groups, simulate each group separately, and combine the partial results. Simulation is customized to take advantage of the properties of each group, and hence yield refined bounds to the overall simulation cost. We illustrate our results using the electronic structure problem of quantum chemistry, where we obtain significantly improved cost estimates under mild assumptions.
We turn to combinatorial optimization problems. An important open question is whether quantum computers provide advantages for the approximation of classically hard combinatorial problems. A promising recently proposed approach of Farhi et al. is the Quantum Approximate Optimization Algorithm (QAOA). We study the application of QAOA to the Maximum Cut problem, and derive analytic performance bounds for the lowest circuit-depth realization, for both general and…
Subjects/Keywords: Computer science; Quantum theory; Quantum computing; Algorithms
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Hadfield, S. A. (2018). Quantum Algorithms for Scientific Computing and Approximate Optimization. (Doctoral Dissertation). Columbia University. Retrieved from https://doi.org/10.7916/D8X650C9
Chicago Manual of Style (16th Edition):
Hadfield, Stuart Andrew. “Quantum Algorithms for Scientific Computing and Approximate Optimization.” 2018. Doctoral Dissertation, Columbia University. Accessed January 16, 2021.
https://doi.org/10.7916/D8X650C9.
MLA Handbook (7th Edition):
Hadfield, Stuart Andrew. “Quantum Algorithms for Scientific Computing and Approximate Optimization.” 2018. Web. 16 Jan 2021.
Vancouver:
Hadfield SA. Quantum Algorithms for Scientific Computing and Approximate Optimization. [Internet] [Doctoral dissertation]. Columbia University; 2018. [cited 2021 Jan 16].
Available from: https://doi.org/10.7916/D8X650C9.
Council of Science Editors:
Hadfield SA. Quantum Algorithms for Scientific Computing and Approximate Optimization. [Doctoral Dissertation]. Columbia University; 2018. Available from: https://doi.org/10.7916/D8X650C9
25.
Tai, Yu-Tsung.
Discrete Quantum Theories and Computing
.
Degree: 2019, Indiana University
URL: http://hdl.handle.net/2022/23178
► Most quantum computing models are based on the continuum of real numbers, while classical digital computers faithfully realize only discrete computational models. Analog computers appear…
(more)
▼ Most
quantum computing models are based on the continuum of real numbers, while classical digital computers faithfully realize only discrete computational models. Analog computers appear to be an option, but in reality are far weaker than would be needed for computational models requiring real numbers. One approach to resolving this conflict is to find consistent mathematical ways to limit measurement precision to computable contexts that do not require incomputable real numbers. Our goal is to build a more philosophically consistent models by investigating discrete
quantum comput- ing using finite number systems, and, alternatively, by incorporating finite precision measurement using intervals into
quantum theory. We begin by replacing the continuum of complex numbers by discrete finite fields in
quantum theory. The simplest theory, defined over unrestricted finite fields, is so weak that it cannot ex- press Deutsch’s algorithm, but, paradoxically, is also so powerful that it can be used to solve the UNIQUE-SAT problem, which is as hard as a general NP-complete problem. (See the thesis for full Abstract)
Advisors/Committee Members: Sabry, Amr A (advisor), Thurston, Dylan Paul (advisor), Ortiz, Gerardo (advisor).
Subjects/Keywords: quantum computing;
finite fields;
quantum probability
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Tai, Y. (2019). Discrete Quantum Theories and Computing
. (Thesis). Indiana University. Retrieved from http://hdl.handle.net/2022/23178
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Tai, Yu-Tsung. “Discrete Quantum Theories and Computing
.” 2019. Thesis, Indiana University. Accessed January 16, 2021.
http://hdl.handle.net/2022/23178.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Tai, Yu-Tsung. “Discrete Quantum Theories and Computing
.” 2019. Web. 16 Jan 2021.
Vancouver:
Tai Y. Discrete Quantum Theories and Computing
. [Internet] [Thesis]. Indiana University; 2019. [cited 2021 Jan 16].
Available from: http://hdl.handle.net/2022/23178.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Tai Y. Discrete Quantum Theories and Computing
. [Thesis]. Indiana University; 2019. Available from: http://hdl.handle.net/2022/23178
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Delft University of Technology
26.
Yadav, Amitabh (author).
CC-Spin: A Micro-architecture design for scalable control of Spin-Qubit Quantum Processor.
Degree: 2019, Delft University of Technology
URL: http://resolver.tudelft.nl/uuid:5afeea39-eabf-4561-832f-35f93e6bcc3e
► Quantum Computing is an emerging field of technology with the promise that engineered quantum systems can address hard problems such as, problems with exponential compute…
(more)
▼ Quantum Computing is an emerging field of technology with the promise that engineered quantum systems can address hard problems such as, problems with exponential compute complexity in Chemistry, Genomics, Optimization and many more applications. Quantum Computer Architecture is an area of research targeted for the NISQ-era quantum computing and little research has been done for development of a scalable classical control and read-out infrastructure for the quantum processors. The project is aimed at study of SoC-FPGA design methodology and architecture design for control of quantum processor. The targeted quantum hardware is the Spin-Qubit in Semiconductor Quantum Dot Chip. The project is intended for understanding the design and working of a silicon-spin qubit for a computer (architecture) engineer. It further helps identify necessities for an architecture, Instruction Set requirements, bottlenecks and future challenges (specific to Spin-Qubit quantum processor) that would help in better designs for new control architectures. The objective of this thesis is directed towards addressing the architectural challenges for the quantum-classical hardware for controlling the NISQ-era quantum devices and beyond. We analyze the control infrastructure requirements and propose a micro-architecture and waveform generation methodology to integrate the physical device with the quantum compilation tool-chain.
Computer Engineering
Advisors/Committee Members: Khammassi, Nader (mentor), Bertels, Koen (mentor), Sebastiano, Fabio (graduation committee), Al-Ars, Zaid (graduation committee), Delft University of Technology (degree granting institution).
Subjects/Keywords: Quantum Computing; Quantum Control Microarchitecture; Computer Architecture
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Yadav, A. (. (2019). CC-Spin: A Micro-architecture design for scalable control of Spin-Qubit Quantum Processor. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:5afeea39-eabf-4561-832f-35f93e6bcc3e
Chicago Manual of Style (16th Edition):
Yadav, Amitabh (author). “CC-Spin: A Micro-architecture design for scalable control of Spin-Qubit Quantum Processor.” 2019. Masters Thesis, Delft University of Technology. Accessed January 16, 2021.
http://resolver.tudelft.nl/uuid:5afeea39-eabf-4561-832f-35f93e6bcc3e.
MLA Handbook (7th Edition):
Yadav, Amitabh (author). “CC-Spin: A Micro-architecture design for scalable control of Spin-Qubit Quantum Processor.” 2019. Web. 16 Jan 2021.
Vancouver:
Yadav A(. CC-Spin: A Micro-architecture design for scalable control of Spin-Qubit Quantum Processor. [Internet] [Masters thesis]. Delft University of Technology; 2019. [cited 2021 Jan 16].
Available from: http://resolver.tudelft.nl/uuid:5afeea39-eabf-4561-832f-35f93e6bcc3e.
Council of Science Editors:
Yadav A(. CC-Spin: A Micro-architecture design for scalable control of Spin-Qubit Quantum Processor. [Masters Thesis]. Delft University of Technology; 2019. Available from: http://resolver.tudelft.nl/uuid:5afeea39-eabf-4561-832f-35f93e6bcc3e
Delft University of Technology
27.
Vaal, Elmore (author).
Towards measuring the microscopic origin of 1/f-flux noise using nanowire transmons subject to a magnetic field.
Degree: 2019, Delft University of Technology
URL: http://resolver.tudelft.nl/uuid:a56077b1-4633-4a30-bfe6-46d1c315028c
► Superconducting-normalconducting-superconducting (SNS) transmons with 2-facet Al-shell nanowires are qubits compatible with magnetic fields above 10 mT. There are important correlations of the room temperature nanowire…
(more)
▼ Superconducting-normalconducting-superconducting (SNS) transmons with 2-facet Al-shell nanowires are qubits compatible with magnetic fields above 10 mT. There are important correlations of the room temperature nanowire resistance with the chance of the qubit being measurable: at a resistance of 2−3 kΩ, the qubit is almost guaranteed to work. The chance of success halves every 2−3 kΩ increase. This information can be used to increase the yield. The flux noise power spectral density (PSD) of a model spin-1/2 fluctuator has been investigated as a function of the magnetic field using the Zeeman interaction. Not only the fluctuations parallel to the magnetic field contribute, but also the fluctuations perpendicular to the magnetic field. Cross-terms cancel out. The flux noise PSD of the SQUID is a linear combination of these spin PSDs when the spins are spatially uncorrelated. The magnetic field suppresses the parallel spin-axis noise PSD contribution as cosh^(-2)(μB/kBT). The magnetic field changes the perpendicular spin-axis PSD contribution due to the Larmor precession frequency peak 2fZ~μB, but does not influence the PSD contribution at frequencies higher that the Larmor precession frequency. When rotational asymmetry in the SQUID geometry is present, the PSD contributions of the perpendicular and parallel components can be separated. In our setup, a perpendicular coil is used to align the magnetic field with the transmon plane. The alignment procedure of maximizing the resonator frequency vs. the perpendicular coil field has been verified. To measure the flux noise, the perpendicular coil is first used to change the flux bias by large amounts. Then a dedicated flux bias is used to make a fine-grained sweep over the flux without flux-jumps, to calibrate the magnetic field at the SQUID. We have found a signal of the flux noise at zero field and at field. A flux noise amplitude of A~1000 μΦ_0 has been found at zero magnetic field.
Applied Physics
Advisors/Committee Members: di Carlo, Leo (mentor), Akhmerov, Anton (graduation committee), Endo, Akira (graduation committee), Dobrovitski, Viatcheslav (graduation committee), Delft University of Technology (degree granting institution).
Subjects/Keywords: quantum computing; quantum information; superconducting transmon; nanowire
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Vaal, E. (. (2019). Towards measuring the microscopic origin of 1/f-flux noise using nanowire transmons subject to a magnetic field. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:a56077b1-4633-4a30-bfe6-46d1c315028c
Chicago Manual of Style (16th Edition):
Vaal, Elmore (author). “Towards measuring the microscopic origin of 1/f-flux noise using nanowire transmons subject to a magnetic field.” 2019. Masters Thesis, Delft University of Technology. Accessed January 16, 2021.
http://resolver.tudelft.nl/uuid:a56077b1-4633-4a30-bfe6-46d1c315028c.
MLA Handbook (7th Edition):
Vaal, Elmore (author). “Towards measuring the microscopic origin of 1/f-flux noise using nanowire transmons subject to a magnetic field.” 2019. Web. 16 Jan 2021.
Vancouver:
Vaal E(. Towards measuring the microscopic origin of 1/f-flux noise using nanowire transmons subject to a magnetic field. [Internet] [Masters thesis]. Delft University of Technology; 2019. [cited 2021 Jan 16].
Available from: http://resolver.tudelft.nl/uuid:a56077b1-4633-4a30-bfe6-46d1c315028c.
Council of Science Editors:
Vaal E(. Towards measuring the microscopic origin of 1/f-flux noise using nanowire transmons subject to a magnetic field. [Masters Thesis]. Delft University of Technology; 2019. Available from: http://resolver.tudelft.nl/uuid:a56077b1-4633-4a30-bfe6-46d1c315028c
Delft University of Technology
28.
Serrão Morato Moreira, Miguel (author).
QuTech Central Controller: A Quantum Control Architecture for a Surface-17 Logical Qubit.
Degree: 2019, Delft University of Technology
URL: http://resolver.tudelft.nl/uuid:502ed5e5-87f7-42bd-a077-c24b7281cd94
► The goal of this thesis is the design and development of the QuTech Central Controller, a system conceived to serve as the hardware/software interface of…
(more)
▼ The goal of this thesis is the design and development of the QuTech Central Controller, a system conceived to serve as the hardware/software interface of a quantum computer. This system represents an evolution of the QuMA microarchitecture to control a Surface-17 superconducting quantum processor, even though several architectural mechanisms are used to ensure the compatibility of the design with different quantum hardware technologies. In addition to an expansion of the control microarchitecture, the QuTech Central Controller represents an evolution of the overall system architecture, making use of a different hardware infrastructure to overcome previous scalability limitations. The main contributions of this thesis are a proposed centralized microarchitecture capable of controlling up to 17 qubits, the implementation of this microarchitecture in a device called the QuTech Central Controller and its testing in dynamic quantum information processing experiments with superconducting qubits.
Computer Engineering
Advisors/Committee Members: Bertels, Koen (mentor), di Carlo, Leo (graduation committee), García Almudever, Carmina (graduation committee), Delft University of Technology (degree granting institution).
Subjects/Keywords: Quantum Computing; Computer Architecture; Quantum Control Microarchitecture
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Serrão Morato Moreira, M. (. (2019). QuTech Central Controller: A Quantum Control Architecture for a Surface-17 Logical Qubit. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:502ed5e5-87f7-42bd-a077-c24b7281cd94
Chicago Manual of Style (16th Edition):
Serrão Morato Moreira, Miguel (author). “QuTech Central Controller: A Quantum Control Architecture for a Surface-17 Logical Qubit.” 2019. Masters Thesis, Delft University of Technology. Accessed January 16, 2021.
http://resolver.tudelft.nl/uuid:502ed5e5-87f7-42bd-a077-c24b7281cd94.
MLA Handbook (7th Edition):
Serrão Morato Moreira, Miguel (author). “QuTech Central Controller: A Quantum Control Architecture for a Surface-17 Logical Qubit.” 2019. Web. 16 Jan 2021.
Vancouver:
Serrão Morato Moreira M(. QuTech Central Controller: A Quantum Control Architecture for a Surface-17 Logical Qubit. [Internet] [Masters thesis]. Delft University of Technology; 2019. [cited 2021 Jan 16].
Available from: http://resolver.tudelft.nl/uuid:502ed5e5-87f7-42bd-a077-c24b7281cd94.
Council of Science Editors:
Serrão Morato Moreira M(. QuTech Central Controller: A Quantum Control Architecture for a Surface-17 Logical Qubit. [Masters Thesis]. Delft University of Technology; 2019. Available from: http://resolver.tudelft.nl/uuid:502ed5e5-87f7-42bd-a077-c24b7281cd94
Delft University of Technology
29.
Cornelissen, Arjan (author).
Quantum gradient estimation and its application to quantum reinforcement learning.
Degree: 2018, Delft University of Technology
URL: http://resolver.tudelft.nl/uuid:26fe945f-f02e-4ef7-bdcb-0a2369eb867e
► In 2005, Jordan showed how to estimate the gradient of a real-valued function with a high-dimensional domain on a quantum computer. Subsequently, in 2017, it…
(more)
▼ In 2005, Jordan showed how to estimate the gradient of a real-valued function with a high-dimensional domain on a
quantum computer. Subsequently, in 2017, it was shown by Gilyén et al. how to do this with a different input model. They also proved optimality of their algorithm for ℓ^∞ -approximations of functions satisfying some smoothness conditions. In this text, we expand the ideas of Gilyén et al., and extend their algorithm such that functions with fewer regularity constraints can be used as input. Moreover, we show that their algorithm is essentially optimal in the query complexity to the phase oracle even for classes of functions that have more stringent smoothness conditions. Finally, we also prove that their algorithm is optimal for approximating gradients with respect to general ℓ
p -norms, where p ∈ [1,∞]. Furthermore, we investigate how Gilyén et al.’s algorithm can be used to do reinforcement learning on a
quantum computer. We elaborate on Montanaro’s ideas for
quantum Monte-Carlo simulation, and show how they can be used to implement
quantum value estimation of Markov reward processes. We also show essential optimality of this algorithm in the query complexity of all its oracles. Next, we show how we can construct a
quantum policy evaluation algorithm, and how we can use these algorithms as subroutines in Gilyén et al.’s
quantum gradient estimation algorithm to perform
quantum policy optimization. The most important open questions remain whether it is possible to improve the query complexity of the extension of Gilyén et al.’s algorithm, when function classes containing functions of Gevrey-type 1 are used as input, as at the moment for this specific parameter setting the algorithm is not better than a very simple classical gradient estimation procedure. Improvement of this result would automatically improve the
quantum policy optimization routine as well.
Advisors/Committee Members: Caspers, Martijn (mentor), van Neerven, Jan (mentor), de Wolf, R.M. (mentor), Delft University of Technology (degree granting institution).
Subjects/Keywords: quantum computing; quantum algorithms; gradient; reinforcement learning
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Cornelissen, A. (. (2018). Quantum gradient estimation and its application to quantum reinforcement learning. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:26fe945f-f02e-4ef7-bdcb-0a2369eb867e
Chicago Manual of Style (16th Edition):
Cornelissen, Arjan (author). “Quantum gradient estimation and its application to quantum reinforcement learning.” 2018. Masters Thesis, Delft University of Technology. Accessed January 16, 2021.
http://resolver.tudelft.nl/uuid:26fe945f-f02e-4ef7-bdcb-0a2369eb867e.
MLA Handbook (7th Edition):
Cornelissen, Arjan (author). “Quantum gradient estimation and its application to quantum reinforcement learning.” 2018. Web. 16 Jan 2021.
Vancouver:
Cornelissen A(. Quantum gradient estimation and its application to quantum reinforcement learning. [Internet] [Masters thesis]. Delft University of Technology; 2018. [cited 2021 Jan 16].
Available from: http://resolver.tudelft.nl/uuid:26fe945f-f02e-4ef7-bdcb-0a2369eb867e.
Council of Science Editors:
Cornelissen A(. Quantum gradient estimation and its application to quantum reinforcement learning. [Masters Thesis]. Delft University of Technology; 2018. Available from: http://resolver.tudelft.nl/uuid:26fe945f-f02e-4ef7-bdcb-0a2369eb867e
University of Waterloo
30.
Paulson, Daniel.
Towards simulating 2D effects in lattice gauge theories on a quantum computer.
Degree: 2020, University of Waterloo
URL: http://hdl.handle.net/10012/16464
► Quantum Field Theories (QFTs) are the most successful theories for describing nature at its most fundamental level. Despite the fact that QFTs are capable of…
(more)
▼ Quantum Field Theories (QFTs) are the most successful theories for describing nature at its most fundamental level. Despite the fact that QFTs are capable of predicting a wide range of phenomena, obtaining solutions to QFTs in parameter regimes where perturbation theory cannot be applied remains a challenge. We propose an experimental scheme to perform quantum simulations of two-dimensional Abelian lattice gauge theories using contemporary quantum devices, paving the way to reach beyond the capabilities of classical simulations. We consider quantum electrodynamics and examine the basic building block of the two-dimensional lattice to study non-trivial magnetic field effects, which are absent in one-dimensional systems. By imposing periodic boundary conditions, we extend the scope of our work to include an infinite 2D structure. Our protocol uses a variational quantum-classical approach to relax the hardware requirements for capturing the intricate many-body interactions that naturally arise in the formulation of gauge-invariant effective field theories. Although we remain platform-independent, we also provide a detailed example of implementation on state-of-the-art trapped ion quantum devices, which can be generalized to other platforms. The techniques for simulating QFTs presented here, combined with advancements in quantum hardware, pose the potential to address longstanding questions in high energy physics.
Subjects/Keywords: quantum simulations; lattice gauge theory; quantum computing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Paulson, D. (2020). Towards simulating 2D effects in lattice gauge theories on a quantum computer. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/16464
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Paulson, Daniel. “Towards simulating 2D effects in lattice gauge theories on a quantum computer.” 2020. Thesis, University of Waterloo. Accessed January 16, 2021.
http://hdl.handle.net/10012/16464.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Paulson, Daniel. “Towards simulating 2D effects in lattice gauge theories on a quantum computer.” 2020. Web. 16 Jan 2021.
Vancouver:
Paulson D. Towards simulating 2D effects in lattice gauge theories on a quantum computer. [Internet] [Thesis]. University of Waterloo; 2020. [cited 2021 Jan 16].
Available from: http://hdl.handle.net/10012/16464.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Paulson D. Towards simulating 2D effects in lattice gauge theories on a quantum computer. [Thesis]. University of Waterloo; 2020. Available from: http://hdl.handle.net/10012/16464
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
◁ [1] [2] [3] [4] [5] … [17] ▶
. 
Open Access Theses and Dissertations
