Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(quantum algorithms). Showing records 1 – 30 of 88 total matches.

[1] [2] [3]

Search Limiters

Last 2 Years | English Only

Languages

Country

▼ Search Limiters

1. Potoček Václav. Quantum Walks .

Degree: 2013, Czech University of Technology

Quantum Walks:New theoretical and experimental results; Quantum Walks:New theoretical and experimental results Advisors/Committee Members: Jex Igor (advisor).

Subjects/Keywords: Quantum Walks; Quantum algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Václav, P. (2013). Quantum Walks . (Thesis). Czech University of Technology. Retrieved from http://hdl.handle.net/10467/14024

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):

Václav, Potoček. “Quantum Walks .” 2013. Thesis, Czech University of Technology. Accessed January 23, 2020. http://hdl.handle.net/10467/14024.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Václav, Potoček. “Quantum Walks .” 2013. Web. 23 Jan 2020.

Vancouver:

Václav P. Quantum Walks . [Internet] [Thesis]. Czech University of Technology; 2013. [cited 2020 Jan 23]. Available from: http://hdl.handle.net/10467/14024.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Václav P. Quantum Walks . [Thesis]. Czech University of Technology; 2013. Available from: http://hdl.handle.net/10467/14024

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of KwaZulu-Natal

2. Mpofu, Kelvin Tafadzwa. Quantum analogues of classical optimization algorithms.

Degree: 2017, University of KwaZulu-Natal

 This thesis explores the quantum analogues of algorithms used in mathematical optimization. The thesis focuses primarily on the iterative gradient search algorithm (algorithm for finding… (more)

Subjects/Keywords: Quantum optimization.; Quantum algorithms.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Mpofu, K. T. (2017). Quantum analogues of classical optimization algorithms. (Thesis). University of KwaZulu-Natal. Retrieved from http://hdl.handle.net/10413/15712

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):

Mpofu, Kelvin Tafadzwa. “Quantum analogues of classical optimization algorithms.” 2017. Thesis, University of KwaZulu-Natal. Accessed January 23, 2020. http://hdl.handle.net/10413/15712.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Mpofu, Kelvin Tafadzwa. “Quantum analogues of classical optimization algorithms.” 2017. Web. 23 Jan 2020.

Vancouver:

Mpofu KT. Quantum analogues of classical optimization algorithms. [Internet] [Thesis]. University of KwaZulu-Natal; 2017. [cited 2020 Jan 23]. Available from: http://hdl.handle.net/10413/15712.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Mpofu KT. Quantum analogues of classical optimization algorithms. [Thesis]. University of KwaZulu-Natal; 2017. Available from: http://hdl.handle.net/10413/15712

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Waterloo

3. Kothari, Robin. Efficient algorithms in quantum query complexity.

Degree: 2014, University of Waterloo

 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)

Subjects/Keywords: Quantum computing; Quantum algorithms; Quantum query complexity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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 23, 2020. 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. 23 Jan 2020.

Vancouver:

Kothari R. Efficient algorithms in quantum query complexity. [Internet] [Thesis]. University of Waterloo; 2014. [cited 2020 Jan 23]. 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


Portland State University

4. Patino, Alberto. Reversible Logic Synthesis Using a Non-blocking Order Search.

Degree: MS(M.S.) in Computer Engineering, Electrical and Computer Engineering, 2010, Portland State University

  Reversible logic is an emerging area of research. With the rapid growth of markets such as mobile computing, power dissipation has become an increasing… (more)

Subjects/Keywords: Quantum computers  – Research; Computer algorithms; Quantum logic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Patino, A. (2010). Reversible Logic Synthesis Using a Non-blocking Order Search. (Masters Thesis). Portland State University. Retrieved from https://pdxscholar.library.pdx.edu/open_access_etds/162

Chicago Manual of Style (16th Edition):

Patino, Alberto. “Reversible Logic Synthesis Using a Non-blocking Order Search.” 2010. Masters Thesis, Portland State University. Accessed January 23, 2020. https://pdxscholar.library.pdx.edu/open_access_etds/162.

MLA Handbook (7th Edition):

Patino, Alberto. “Reversible Logic Synthesis Using a Non-blocking Order Search.” 2010. Web. 23 Jan 2020.

Vancouver:

Patino A. Reversible Logic Synthesis Using a Non-blocking Order Search. [Internet] [Masters thesis]. Portland State University; 2010. [cited 2020 Jan 23]. Available from: https://pdxscholar.library.pdx.edu/open_access_etds/162.

Council of Science Editors:

Patino A. Reversible Logic Synthesis Using a Non-blocking Order Search. [Masters Thesis]. Portland State University; 2010. Available from: https://pdxscholar.library.pdx.edu/open_access_etds/162


University of Western Australia

5. Douglas, Brendan. Quantum and classical algorithms for graph classification and search problems.

Degree: PhD, 2011, University of Western Australia

[Truncated abstract] This thesis is split into three parts, each addressing the overarching theme of applying graph theoretic techniques to classi cation and search problems.… (more)

Subjects/Keywords: Quantum algorithms; Graph isomorphism; Quantum walks; Adinkras

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Douglas, B. (2011). Quantum and classical algorithms for graph classification and search problems. (Doctoral Dissertation). University of Western Australia. Retrieved from http://repository.uwa.edu.au:80/R/?func=dbin-jump-full&object_id=30840&local_base=GEN01-INS01

Chicago Manual of Style (16th Edition):

Douglas, Brendan. “Quantum and classical algorithms for graph classification and search problems.” 2011. Doctoral Dissertation, University of Western Australia. Accessed January 23, 2020. http://repository.uwa.edu.au:80/R/?func=dbin-jump-full&object_id=30840&local_base=GEN01-INS01.

MLA Handbook (7th Edition):

Douglas, Brendan. “Quantum and classical algorithms for graph classification and search problems.” 2011. Web. 23 Jan 2020.

Vancouver:

Douglas B. Quantum and classical algorithms for graph classification and search problems. [Internet] [Doctoral dissertation]. University of Western Australia; 2011. [cited 2020 Jan 23]. Available from: http://repository.uwa.edu.au:80/R/?func=dbin-jump-full&object_id=30840&local_base=GEN01-INS01.

Council of Science Editors:

Douglas B. Quantum and classical algorithms for graph classification and search problems. [Doctoral Dissertation]. University of Western Australia; 2011. Available from: http://repository.uwa.edu.au:80/R/?func=dbin-jump-full&object_id=30840&local_base=GEN01-INS01


Columbia University

6. Hadfield, Stuart Andrew. Quantum Algorithms for Scientific Computing and Approximate Optimization.

Degree: 2018, Columbia University

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)

Subjects/Keywords: Computer science; Quantum theory; Quantum computing; Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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 23, 2020. https://doi.org/10.7916/D8X650C9.

MLA Handbook (7th Edition):

Hadfield, Stuart Andrew. “Quantum Algorithms for Scientific Computing and Approximate Optimization.” 2018. Web. 23 Jan 2020.

Vancouver:

Hadfield SA. Quantum Algorithms for Scientific Computing and Approximate Optimization. [Internet] [Doctoral dissertation]. Columbia University; 2018. [cited 2020 Jan 23]. 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


University of Waterloo

7. Kothari, Robin. Efficient simulation of Hamiltonians.

Degree: 2010, University of Waterloo

 The problem considered in this thesis is the following: We are given a Hamiltonian H and time t, and our goal is to approximately implement… (more)

Subjects/Keywords: Quantum algorithms; Hamiltonian simulation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kothari, R. (2010). Efficient simulation of Hamiltonians. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/5356

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 simulation of Hamiltonians.” 2010. Thesis, University of Waterloo. Accessed January 23, 2020. http://hdl.handle.net/10012/5356.

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 simulation of Hamiltonians.” 2010. Web. 23 Jan 2020.

Vancouver:

Kothari R. Efficient simulation of Hamiltonians. [Internet] [Thesis]. University of Waterloo; 2010. [cited 2020 Jan 23]. Available from: http://hdl.handle.net/10012/5356.

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 simulation of Hamiltonians. [Thesis]. University of Waterloo; 2010. Available from: http://hdl.handle.net/10012/5356

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

8. O'Malley, Peter James Joyce. Superconducting Qubits: Dephasing and Quantum Chemistry.

Degree: 2016, University of California – eScholarship, University of California

 One of the most exciting potential applications of a quantum computer is the abilityto efficiently simulate quantum systems, a task that is out of the… (more)

Subjects/Keywords: Quantum physics; Physics; Chemistry; Quantum Algorithms; Quantum Chemistry; Quantum Computation; Quantum Information; Quantum Noise

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

O'Malley, P. J. J. (2016). Superconducting Qubits: Dephasing and Quantum Chemistry. (Thesis). University of California – eScholarship, University of California. Retrieved from http://www.escholarship.org/uc/item/21x6x9tk

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):

O'Malley, Peter James Joyce. “Superconducting Qubits: Dephasing and Quantum Chemistry.” 2016. Thesis, University of California – eScholarship, University of California. Accessed January 23, 2020. http://www.escholarship.org/uc/item/21x6x9tk.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

O'Malley, Peter James Joyce. “Superconducting Qubits: Dephasing and Quantum Chemistry.” 2016. Web. 23 Jan 2020.

Vancouver:

O'Malley PJJ. Superconducting Qubits: Dephasing and Quantum Chemistry. [Internet] [Thesis]. University of California – eScholarship, University of California; 2016. [cited 2020 Jan 23]. Available from: http://www.escholarship.org/uc/item/21x6x9tk.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

O'Malley PJJ. Superconducting Qubits: Dephasing and Quantum Chemistry. [Thesis]. University of California – eScholarship, University of California; 2016. Available from: http://www.escholarship.org/uc/item/21x6x9tk

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

9. Niskanen, Antti O. Control of Quantum Evolution and Josephson Junction Circuits.

Degree: 2004, VTT Technical Research Centre of Finland

Ever since Peter Shor's ground-breaking discovery in 1994 of an algorithm capable of factoring large integers on a quantum-mechanical computer exponentially faster than using any… (more)

Subjects/Keywords: quantum systems; quantum mechanics; quantum computing; quantum algorithms; Cooper pair pumping

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Niskanen, A. O. (2004). Control of Quantum Evolution and Josephson Junction Circuits. (Thesis). VTT Technical Research Centre of Finland. Retrieved from http://lib.tkk.fi/Diss/2004/isbn9513864219/

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):

Niskanen, Antti O. “Control of Quantum Evolution and Josephson Junction Circuits.” 2004. Thesis, VTT Technical Research Centre of Finland. Accessed January 23, 2020. http://lib.tkk.fi/Diss/2004/isbn9513864219/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Niskanen, Antti O. “Control of Quantum Evolution and Josephson Junction Circuits.” 2004. Web. 23 Jan 2020.

Vancouver:

Niskanen AO. Control of Quantum Evolution and Josephson Junction Circuits. [Internet] [Thesis]. VTT Technical Research Centre of Finland; 2004. [cited 2020 Jan 23]. Available from: http://lib.tkk.fi/Diss/2004/isbn9513864219/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Niskanen AO. Control of Quantum Evolution and Josephson Junction Circuits. [Thesis]. VTT Technical Research Centre of Finland; 2004. Available from: http://lib.tkk.fi/Diss/2004/isbn9513864219/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Leiden University

10. Polla, Stefano. Quantum Digital Cooling.

Degree: 2019, Leiden University

 The preparation of a qubit register in the ground state of a given Hamiltonian is a challenging problem in the field of quantum algorithms. Its… (more)

Subjects/Keywords: Quantum Information; Quantum Algorithms; Quantum Digital Cooling; Algorithmic Cooling

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Polla, S. (2019). Quantum Digital Cooling. (Masters Thesis). Leiden University. Retrieved from http://hdl.handle.net/1887/74196

Chicago Manual of Style (16th Edition):

Polla, Stefano. “Quantum Digital Cooling.” 2019. Masters Thesis, Leiden University. Accessed January 23, 2020. http://hdl.handle.net/1887/74196.

MLA Handbook (7th Edition):

Polla, Stefano. “Quantum Digital Cooling.” 2019. Web. 23 Jan 2020.

Vancouver:

Polla S. Quantum Digital Cooling. [Internet] [Masters thesis]. Leiden University; 2019. [cited 2020 Jan 23]. Available from: http://hdl.handle.net/1887/74196.

Council of Science Editors:

Polla S. Quantum Digital Cooling. [Masters Thesis]. Leiden University; 2019. Available from: http://hdl.handle.net/1887/74196


San Jose State University

11. Shi, Yun Xuan. Zero and Low Energy Thresholds in Quantum Simulation.

Degree: MS, Physics and Astronomy, 2019, San Jose State University

Quantum simulation is the process of simulating a quantum mechanical system using either a quantum or a classical computer. Because quantum mechanical systems contain… (more)

Subjects/Keywords: ion trap; quantum algorithms; quantum computing; quantum simulation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Shi, Y. X. (2019). Zero and Low Energy Thresholds in Quantum Simulation. (Masters Thesis). San Jose State University. Retrieved from https://doi.org/10.31979/etd.ay96-ubf4 ; https://scholarworks.sjsu.edu/etd_theses/5019

Chicago Manual of Style (16th Edition):

Shi, Yun Xuan. “Zero and Low Energy Thresholds in Quantum Simulation.” 2019. Masters Thesis, San Jose State University. Accessed January 23, 2020. https://doi.org/10.31979/etd.ay96-ubf4 ; https://scholarworks.sjsu.edu/etd_theses/5019.

MLA Handbook (7th Edition):

Shi, Yun Xuan. “Zero and Low Energy Thresholds in Quantum Simulation.” 2019. Web. 23 Jan 2020.

Vancouver:

Shi YX. Zero and Low Energy Thresholds in Quantum Simulation. [Internet] [Masters thesis]. San Jose State University; 2019. [cited 2020 Jan 23]. Available from: https://doi.org/10.31979/etd.ay96-ubf4 ; https://scholarworks.sjsu.edu/etd_theses/5019.

Council of Science Editors:

Shi YX. Zero and Low Energy Thresholds in Quantum Simulation. [Masters Thesis]. San Jose State University; 2019. Available from: https://doi.org/10.31979/etd.ay96-ubf4 ; https://scholarworks.sjsu.edu/etd_theses/5019


University of Waterloo

12. Kieferova, Maria. Quantum Algorithmic Techniques for Fault-Tolerant Quantum Computers.

Degree: 2019, University of Waterloo

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… (more)

Subjects/Keywords: quantum computing; quantum information; quantum algorithms; Hamiltonian simulation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kieferova, M. (2019). Quantum Algorithmic Techniques for Fault-Tolerant Quantum Computers. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/15190

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):

Kieferova, Maria. “Quantum Algorithmic Techniques for Fault-Tolerant Quantum Computers.” 2019. Thesis, University of Waterloo. Accessed January 23, 2020. http://hdl.handle.net/10012/15190.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Kieferova, Maria. “Quantum Algorithmic Techniques for Fault-Tolerant Quantum Computers.” 2019. Web. 23 Jan 2020.

Vancouver:

Kieferova M. Quantum Algorithmic Techniques for Fault-Tolerant Quantum Computers. [Internet] [Thesis]. University of Waterloo; 2019. [cited 2020 Jan 23]. Available from: http://hdl.handle.net/10012/15190.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kieferova M. Quantum Algorithmic Techniques for Fault-Tolerant Quantum Computers. [Thesis]. University of Waterloo; 2019. Available from: http://hdl.handle.net/10012/15190

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Columbia University

13. Mukherjee, Soumyodipto. Algorithms for discrete and continuous quantum systems.

Degree: 2018, Columbia University

 This thesis is divided into three chapters. In the first chapter we outline a simple and numerically inexpensive approach to describe the spectral features of… (more)

Subjects/Keywords: Chemistry; Anderson model; Algorithms; Quantum systems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Mukherjee, S. (2018). Algorithms for discrete and continuous quantum systems. (Doctoral Dissertation). Columbia University. Retrieved from https://doi.org/10.7916/D8RN4RM3

Chicago Manual of Style (16th Edition):

Mukherjee, Soumyodipto. “Algorithms for discrete and continuous quantum systems.” 2018. Doctoral Dissertation, Columbia University. Accessed January 23, 2020. https://doi.org/10.7916/D8RN4RM3.

MLA Handbook (7th Edition):

Mukherjee, Soumyodipto. “Algorithms for discrete and continuous quantum systems.” 2018. Web. 23 Jan 2020.

Vancouver:

Mukherjee S. Algorithms for discrete and continuous quantum systems. [Internet] [Doctoral dissertation]. Columbia University; 2018. [cited 2020 Jan 23]. Available from: https://doi.org/10.7916/D8RN4RM3.

Council of Science Editors:

Mukherjee S. Algorithms for discrete and continuous quantum systems. [Doctoral Dissertation]. Columbia University; 2018. Available from: https://doi.org/10.7916/D8RN4RM3


Indian Institute of Science

14. Mitra, Avik. Quantum Algorithms Using Nuclear Magnetic Resonance Quantum Information Processor.

Degree: 2007, Indian Institute of Science

 The present work, briefly described below, consists of implementation of several quantum algorithms in an NMR Quantum Information Processor. Game theory gives us mathematical tools… (more)

Subjects/Keywords: Nuclear Magnetic Resonance (NMR); Quantum Information Processor; Adiabatic Algorithms; Quantum Games; Quantum Search Algorithm; Quantum Computation; Quantum Information Processing; Magnetism

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Mitra, A. (2007). Quantum Algorithms Using Nuclear Magnetic Resonance Quantum Information Processor. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/492

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):

Mitra, Avik. “Quantum Algorithms Using Nuclear Magnetic Resonance Quantum Information Processor.” 2007. Thesis, Indian Institute of Science. Accessed January 23, 2020. http://hdl.handle.net/2005/492.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Mitra, Avik. “Quantum Algorithms Using Nuclear Magnetic Resonance Quantum Information Processor.” 2007. Web. 23 Jan 2020.

Vancouver:

Mitra A. Quantum Algorithms Using Nuclear Magnetic Resonance Quantum Information Processor. [Internet] [Thesis]. Indian Institute of Science; 2007. [cited 2020 Jan 23]. Available from: http://hdl.handle.net/2005/492.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Mitra A. Quantum Algorithms Using Nuclear Magnetic Resonance Quantum Information Processor. [Thesis]. Indian Institute of Science; 2007. Available from: http://hdl.handle.net/2005/492

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Oxford

15. Gogioso, Stefano. Categorical quantum dynamics.

Degree: PhD, 2016, University of Oxford

 Since their original introduction, strongly complementary observables have been a fundamental ingredient of the ZX calculus, one of the most successful fragments of Categorical Quantum(more)

Subjects/Keywords: Categories; Quantum theory; Quantum Dynamics; Non-locality; Quantum Symmetries; Quantum Algorithms; Categorical Quantum Mechanics; Device-independent Security

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Gogioso, S. (2016). Categorical quantum dynamics. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:cbfb821f-6b76-4a81-b882-17b9ca386264 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.748667

Chicago Manual of Style (16th Edition):

Gogioso, Stefano. “Categorical quantum dynamics.” 2016. Doctoral Dissertation, University of Oxford. Accessed January 23, 2020. http://ora.ox.ac.uk/objects/uuid:cbfb821f-6b76-4a81-b882-17b9ca386264 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.748667.

MLA Handbook (7th Edition):

Gogioso, Stefano. “Categorical quantum dynamics.” 2016. Web. 23 Jan 2020.

Vancouver:

Gogioso S. Categorical quantum dynamics. [Internet] [Doctoral dissertation]. University of Oxford; 2016. [cited 2020 Jan 23]. Available from: http://ora.ox.ac.uk/objects/uuid:cbfb821f-6b76-4a81-b882-17b9ca386264 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.748667.

Council of Science Editors:

Gogioso S. Categorical quantum dynamics. [Doctoral Dissertation]. University of Oxford; 2016. Available from: http://ora.ox.ac.uk/objects/uuid:cbfb821f-6b76-4a81-b882-17b9ca386264 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.748667

16. Jeffery, Stacey. Frameworks for Quantum Algorithms.

Degree: 2014, University of Waterloo

 Due to the difficulty of constructing new quantum algorithms, frameworks that facilitate this construction are of great importance in quantum computing. These frameworks reduce the… (more)

Subjects/Keywords: quantum algorithms; quantum walks

…number of completely “new” quantum algorithms — two famous examples being Shor’s factoring… …algorithm and Grover’s search algorithm [Sho97, Gro96] — most other quantum algorithms… …are built upon already existing quantum algorithms, and their main contributions often stem… …follow directly from some properties of this object. A very large number of quantum algorithms… …advantage that they can be applied with essentially no background in quantum algorithms. The… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Jeffery, S. (2014). Frameworks for Quantum Algorithms. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/8710

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):

Jeffery, Stacey. “Frameworks for Quantum Algorithms.” 2014. Thesis, University of Waterloo. Accessed January 23, 2020. http://hdl.handle.net/10012/8710.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Jeffery, Stacey. “Frameworks for Quantum Algorithms.” 2014. Web. 23 Jan 2020.

Vancouver:

Jeffery S. Frameworks for Quantum Algorithms. [Internet] [Thesis]. University of Waterloo; 2014. [cited 2020 Jan 23]. Available from: http://hdl.handle.net/10012/8710.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Jeffery S. Frameworks for Quantum Algorithms. [Thesis]. University of Waterloo; 2014. Available from: http://hdl.handle.net/10012/8710

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

17. Konstandakis, Christos. Albebraic, geometric and complexity aspects of quantum search algorithms.

Degree: 2018, Technical University of Crete (TUC); Πολυτεχνείο Κρήτης

Quantum search algorithm determines k marked items in an otherwise unstructured set (database), of size N by performing Order(SQRT(N/k)) trials. Hence a quadratic reduction of… (more)

Subjects/Keywords: Κβαντική πληροφορία; Κβαντικοί αλγόριθμοι; Κβαντική Αναζήτηση; Quantum Computing; Quantum algorithms; Quantum Search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Konstandakis, C. (2018). Albebraic, geometric and complexity aspects of quantum search algorithms. (Thesis). Technical University of Crete (TUC); Πολυτεχνείο Κρήτης. Retrieved from http://hdl.handle.net/10442/hedi/43606

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):

Konstandakis, Christos. “Albebraic, geometric and complexity aspects of quantum search algorithms.” 2018. Thesis, Technical University of Crete (TUC); Πολυτεχνείο Κρήτης. Accessed January 23, 2020. http://hdl.handle.net/10442/hedi/43606.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Konstandakis, Christos. “Albebraic, geometric and complexity aspects of quantum search algorithms.” 2018. Web. 23 Jan 2020.

Vancouver:

Konstandakis C. Albebraic, geometric and complexity aspects of quantum search algorithms. [Internet] [Thesis]. Technical University of Crete (TUC); Πολυτεχνείο Κρήτης; 2018. [cited 2020 Jan 23]. Available from: http://hdl.handle.net/10442/hedi/43606.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Konstandakis C. Albebraic, geometric and complexity aspects of quantum search algorithms. [Thesis]. Technical University of Crete (TUC); Πολυτεχνείο Κρήτης; 2018. Available from: http://hdl.handle.net/10442/hedi/43606

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Indian Institute of Science

18. Tulsi, Tathagat Avatar. Generalizations Of The Quantum Search Algorithm.

Degree: 2009, Indian Institute of Science

Quantum computation has attracted a great deal of attention from the scientific community in recent years. By using the quantum mechanical phenomena of superposition and… (more)

Subjects/Keywords: Quantum Theory; Algorithm; Quantum Search Algorithm; Grover's Search Algorithm; Quantum Computation; Adiabatic Quantum Search; Robust Quantum Search Algorithm; Kato's Algorithm; Fixed-point Quantum Search; Quantum Algorithms; Quantum Mechanics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Tulsi, T. A. (2009). Generalizations Of The Quantum Search Algorithm. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/951

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):

Tulsi, Tathagat Avatar. “Generalizations Of The Quantum Search Algorithm.” 2009. Thesis, Indian Institute of Science. Accessed January 23, 2020. http://hdl.handle.net/2005/951.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Tulsi, Tathagat Avatar. “Generalizations Of The Quantum Search Algorithm.” 2009. Web. 23 Jan 2020.

Vancouver:

Tulsi TA. Generalizations Of The Quantum Search Algorithm. [Internet] [Thesis]. Indian Institute of Science; 2009. [cited 2020 Jan 23]. Available from: http://hdl.handle.net/2005/951.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Tulsi TA. Generalizations Of The Quantum Search Algorithm. [Thesis]. Indian Institute of Science; 2009. Available from: http://hdl.handle.net/2005/951

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Indian Institute of Science

19. Rao, M V Panduranga. Bounds On Augmented Automata And Quantum Adiabatic Optimization.

Degree: 2007, Indian Institute of Science

Quantum computing has generated a lot of interested in the past two decades. Research into powerful models of quantum computation has yielded important and elegant… (more)

Subjects/Keywords: Quantum Theory; Computer Science - Quantum Theory; Quantum Computing; Quantum Computing - Interference; Quantum Adiabatic Algorithms; Quantum Finite Automata; Quantum Adiabatic Optimization; Bounds; Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Rao, M. V. P. (2007). Bounds On Augmented Automata And Quantum Adiabatic Optimization. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/518

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):

Rao, M V Panduranga. “Bounds On Augmented Automata And Quantum Adiabatic Optimization.” 2007. Thesis, Indian Institute of Science. Accessed January 23, 2020. http://hdl.handle.net/2005/518.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Rao, M V Panduranga. “Bounds On Augmented Automata And Quantum Adiabatic Optimization.” 2007. Web. 23 Jan 2020.

Vancouver:

Rao MVP. Bounds On Augmented Automata And Quantum Adiabatic Optimization. [Internet] [Thesis]. Indian Institute of Science; 2007. [cited 2020 Jan 23]. Available from: http://hdl.handle.net/2005/518.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Rao MVP. Bounds On Augmented Automata And Quantum Adiabatic Optimization. [Thesis]. Indian Institute of Science; 2007. Available from: http://hdl.handle.net/2005/518

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Universidade do Rio Grande do Sul

20. Conceição, Calebe Micael de Oliveira. Uma arquitetura de co-processador para simulação de algoritmos quânticos em FPGA.

Degree: 2013, Universidade do Rio Grande do Sul

Simuladores quânticos têm tido um importante papel no estudo e desenvolvimento da computação quântica ao longo dos anos. A simulação de algoritmos quânticos em computadores… (more)

Subjects/Keywords: Microeletrônica; Computer science; Microelectronics; Fpga; Quantum mechanics; Computação quântica; Quantum computing; Quantum algorithms; Simulation; EDA tool; Quantum circuits; FPGA

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Conceição, C. M. d. O. (2013). Uma arquitetura de co-processador para simulação de algoritmos quânticos em FPGA. (Thesis). Universidade do Rio Grande do Sul. Retrieved from http://hdl.handle.net/10183/81297

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):

Conceição, Calebe Micael de Oliveira. “Uma arquitetura de co-processador para simulação de algoritmos quânticos em FPGA.” 2013. Thesis, Universidade do Rio Grande do Sul. Accessed January 23, 2020. http://hdl.handle.net/10183/81297.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Conceição, Calebe Micael de Oliveira. “Uma arquitetura de co-processador para simulação de algoritmos quânticos em FPGA.” 2013. Web. 23 Jan 2020.

Vancouver:

Conceição CMdO. Uma arquitetura de co-processador para simulação de algoritmos quânticos em FPGA. [Internet] [Thesis]. Universidade do Rio Grande do Sul; 2013. [cited 2020 Jan 23]. Available from: http://hdl.handle.net/10183/81297.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Conceição CMdO. Uma arquitetura de co-processador para simulação de algoritmos quânticos em FPGA. [Thesis]. Universidade do Rio Grande do Sul; 2013. Available from: http://hdl.handle.net/10183/81297

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of New Mexico

21. Ryan-Anderson, Ciarán. Quantum Algorithms, Architecture, and Error Correction.

Degree: Physics & Astronomy, 2018, University of New Mexico

Quantum algorithms have the potential to provide exponential speedups over some of the best known classical algorithms. These speedups may enable quantum devices to… (more)

Subjects/Keywords: quantum algorithms; quantum architecture; quantum error correction; quantum computation; QAOA; lattice surgery; Astrophysics and Astronomy; Physics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Ryan-Anderson, C. (2018). Quantum Algorithms, Architecture, and Error Correction. (Doctoral Dissertation). University of New Mexico. Retrieved from https://digitalrepository.unm.edu/phyc_etds/203

Chicago Manual of Style (16th Edition):

Ryan-Anderson, Ciarán. “Quantum Algorithms, Architecture, and Error Correction.” 2018. Doctoral Dissertation, University of New Mexico. Accessed January 23, 2020. https://digitalrepository.unm.edu/phyc_etds/203.

MLA Handbook (7th Edition):

Ryan-Anderson, Ciarán. “Quantum Algorithms, Architecture, and Error Correction.” 2018. Web. 23 Jan 2020.

Vancouver:

Ryan-Anderson C. Quantum Algorithms, Architecture, and Error Correction. [Internet] [Doctoral dissertation]. University of New Mexico; 2018. [cited 2020 Jan 23]. Available from: https://digitalrepository.unm.edu/phyc_etds/203.

Council of Science Editors:

Ryan-Anderson C. Quantum Algorithms, Architecture, and Error Correction. [Doctoral Dissertation]. University of New Mexico; 2018. Available from: https://digitalrepository.unm.edu/phyc_etds/203


University of Adelaide

22. Lagana, Antonio. Quantum computation and a universal quantum computer.

Degree: 2012, University of Adelaide

 This thesis covers two main topics in quantum computing: universal quantum computation and quantum search. We first demonstrate how a quantum harmonic oscillator can be… (more)

Subjects/Keywords: universal quantum turing machine; programmable quantum computer; oracle based algorithms; quantum search; Grover search; quantum halting problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Lagana, A. (2012). Quantum computation and a universal quantum computer. (Thesis). University of Adelaide. Retrieved from http://hdl.handle.net/2440/77320

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):

Lagana, Antonio. “Quantum computation and a universal quantum computer.” 2012. Thesis, University of Adelaide. Accessed January 23, 2020. http://hdl.handle.net/2440/77320.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Lagana, Antonio. “Quantum computation and a universal quantum computer.” 2012. Web. 23 Jan 2020.

Vancouver:

Lagana A. Quantum computation and a universal quantum computer. [Internet] [Thesis]. University of Adelaide; 2012. [cited 2020 Jan 23]. Available from: http://hdl.handle.net/2440/77320.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lagana A. Quantum computation and a universal quantum computer. [Thesis]. University of Adelaide; 2012. Available from: http://hdl.handle.net/2440/77320

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Waterloo

23. Wang, Chunhao. Computational Problems Related to Open Quantum Systems.

Degree: 2018, University of Waterloo

 A quantum system that has interaction with external resources, such as probability distribution, dissipation, and noise, is referred to as an open quantum system. Not… (more)

Subjects/Keywords: quantum computing; quantum algorithms; open quantum systems; unitary 2-designs; Lindblad evolution; dissipative quantum search; Lindblad simulation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Wang, C. (2018). Computational Problems Related to Open Quantum Systems. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/13640

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):

Wang, Chunhao. “Computational Problems Related to Open Quantum Systems.” 2018. Thesis, University of Waterloo. Accessed January 23, 2020. http://hdl.handle.net/10012/13640.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Wang, Chunhao. “Computational Problems Related to Open Quantum Systems.” 2018. Web. 23 Jan 2020.

Vancouver:

Wang C. Computational Problems Related to Open Quantum Systems. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2020 Jan 23]. Available from: http://hdl.handle.net/10012/13640.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wang C. Computational Problems Related to Open Quantum Systems. [Thesis]. University of Waterloo; 2018. Available from: http://hdl.handle.net/10012/13640

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Indian Institute of Science

24. Das, Ranabir. Developments In Quantum Information Processing By Nuclear Magnetic Resonance.

Degree: 2004, Indian Institute of Science

 Residual dipolar couplings can be used to increase the number of qubits for quantum information processing. We have used molecules containing 3, 5 and 8… (more)

Subjects/Keywords: Nuclear Magnetic Resonance; Quantum Theory; Information Theory; Quantum Information Processing; Phase Shift Gate; Quantum Computing; Quantum Algorithms; Quantum State Tomography; Quantum Mechanics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Das, R. (2004). Developments In Quantum Information Processing By Nuclear Magnetic Resonance. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/1326

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):

Das, Ranabir. “Developments In Quantum Information Processing By Nuclear Magnetic Resonance.” 2004. Thesis, Indian Institute of Science. Accessed January 23, 2020. http://hdl.handle.net/2005/1326.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Das, Ranabir. “Developments In Quantum Information Processing By Nuclear Magnetic Resonance.” 2004. Web. 23 Jan 2020.

Vancouver:

Das R. Developments In Quantum Information Processing By Nuclear Magnetic Resonance. [Internet] [Thesis]. Indian Institute of Science; 2004. [cited 2020 Jan 23]. Available from: http://hdl.handle.net/2005/1326.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Das R. Developments In Quantum Information Processing By Nuclear Magnetic Resonance. [Thesis]. Indian Institute of Science; 2004. Available from: http://hdl.handle.net/2005/1326

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Leiden University

25. Steudtner, M. Methods to simulate fermions on quantum computers with hardware limitations.

Degree: 2019, Leiden University

 This thesis is a collection of theoretical works aiming at adjusting quantum algorithms to the hardware of quantum computers. The overarching topic of these efforts… (more)

Subjects/Keywords: Quantum simulation; Quantum algorithms; Quantum computing; Quantum dots; Quantum simulation; Quantum algorithms; Quantum computing; Quantum dots

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Steudtner, M. (2019). Methods to simulate fermions on quantum computers with hardware limitations. (Doctoral Dissertation). Leiden University. Retrieved from http://hdl.handle.net/1887/80413

Chicago Manual of Style (16th Edition):

Steudtner, M. “Methods to simulate fermions on quantum computers with hardware limitations.” 2019. Doctoral Dissertation, Leiden University. Accessed January 23, 2020. http://hdl.handle.net/1887/80413.

MLA Handbook (7th Edition):

Steudtner, M. “Methods to simulate fermions on quantum computers with hardware limitations.” 2019. Web. 23 Jan 2020.

Vancouver:

Steudtner M. Methods to simulate fermions on quantum computers with hardware limitations. [Internet] [Doctoral dissertation]. Leiden University; 2019. [cited 2020 Jan 23]. Available from: http://hdl.handle.net/1887/80413.

Council of Science Editors:

Steudtner M. Methods to simulate fermions on quantum computers with hardware limitations. [Doctoral Dissertation]. Leiden University; 2019. Available from: http://hdl.handle.net/1887/80413

26. JoÃo Luzeilton de Oliveira. Ferramentas algÃbricas para o estudo do entrelaÃamento quÃntico.

Degree: PhD, 2012, Universidade Federal do Ceará

Esta tese apresenta alguns resultados sobre dois temas importantes para a teoria da informaÃÃo quÃntica: entrelaÃamento quÃntico e algoritmos quÃnticos Com respeito ao entrelaÃamento Ã… (more)

Subjects/Keywords: CIENCIA DA COMPUTACAO; TeleinformÃtica; EntrelaÃamento quÃntico; AlgorÃtmos quÃnticos; Teleinformatic; Quantum Entanglement; Quantum Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Oliveira, J. L. d. (2012). Ferramentas algÃbricas para o estudo do entrelaÃamento quÃntico. (Doctoral Dissertation). Universidade Federal do Ceará. Retrieved from http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=7493 ;

Chicago Manual of Style (16th Edition):

Oliveira, JoÃo Luzeilton de. “Ferramentas algÃbricas para o estudo do entrelaÃamento quÃntico.” 2012. Doctoral Dissertation, Universidade Federal do Ceará. Accessed January 23, 2020. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=7493 ;.

MLA Handbook (7th Edition):

Oliveira, JoÃo Luzeilton de. “Ferramentas algÃbricas para o estudo do entrelaÃamento quÃntico.” 2012. Web. 23 Jan 2020.

Vancouver:

Oliveira JLd. Ferramentas algÃbricas para o estudo do entrelaÃamento quÃntico. [Internet] [Doctoral dissertation]. Universidade Federal do Ceará 2012. [cited 2020 Jan 23]. Available from: http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=7493 ;.

Council of Science Editors:

Oliveira JLd. Ferramentas algÃbricas para o estudo do entrelaÃamento quÃntico. [Doctoral Dissertation]. Universidade Federal do Ceará 2012. Available from: http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=7493 ;


University of California – Berkeley

27. Wang, Guoming. Span Programs, Electrical Flows, and Beyond: New Approaches to Quantum Algorithms.

Degree: Electrical Engineering & Computer Sciences, 2014, University of California – Berkeley

 Over the last decade, a large number of quantum algorithms have been discovered that outperform their classical counterparts. However, depending on the main techniques used,… (more)

Subjects/Keywords: Computer science; Electrcial Flows; Hamiltonian Simulation; Quantum Algorithms; Quantum Computing; Span Programs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Wang, G. (2014). Span Programs, Electrical Flows, and Beyond: New Approaches to Quantum Algorithms. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/18b166mv

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):

Wang, Guoming. “Span Programs, Electrical Flows, and Beyond: New Approaches to Quantum Algorithms.” 2014. Thesis, University of California – Berkeley. Accessed January 23, 2020. http://www.escholarship.org/uc/item/18b166mv.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Wang, Guoming. “Span Programs, Electrical Flows, and Beyond: New Approaches to Quantum Algorithms.” 2014. Web. 23 Jan 2020.

Vancouver:

Wang G. Span Programs, Electrical Flows, and Beyond: New Approaches to Quantum Algorithms. [Internet] [Thesis]. University of California – Berkeley; 2014. [cited 2020 Jan 23]. Available from: http://www.escholarship.org/uc/item/18b166mv.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wang G. Span Programs, Electrical Flows, and Beyond: New Approaches to Quantum Algorithms. [Thesis]. University of California – Berkeley; 2014. Available from: http://www.escholarship.org/uc/item/18b166mv

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Florida

28. Debhaumik, Anales. The Hidden Subgroup Problem.

Degree: PhD, Mathematics, 2010, University of Florida

 The topic of my research is the Hidden Subgroup Problem. The problem can be stated as follows: {(Hidden Subgroup Problem)} Let G be a finite… (more)

Subjects/Keywords: Algorithms; Boxes; Computer science; Fourier transformations; Integers; Mathematical constants; Polynomials; Quantum computers; Quantum efficiency; Quantum field theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Debhaumik, A. (2010). The Hidden Subgroup Problem. (Doctoral Dissertation). University of Florida. Retrieved from http://ufdc.ufl.edu/UFE0041526

Chicago Manual of Style (16th Edition):

Debhaumik, Anales. “The Hidden Subgroup Problem.” 2010. Doctoral Dissertation, University of Florida. Accessed January 23, 2020. http://ufdc.ufl.edu/UFE0041526.

MLA Handbook (7th Edition):

Debhaumik, Anales. “The Hidden Subgroup Problem.” 2010. Web. 23 Jan 2020.

Vancouver:

Debhaumik A. The Hidden Subgroup Problem. [Internet] [Doctoral dissertation]. University of Florida; 2010. [cited 2020 Jan 23]. Available from: http://ufdc.ufl.edu/UFE0041526.

Council of Science Editors:

Debhaumik A. The Hidden Subgroup Problem. [Doctoral Dissertation]. University of Florida; 2010. Available from: http://ufdc.ufl.edu/UFE0041526


Indian Institute of Science

29. Gopinath, T. Quantum Information Processing By NMR : Quantum State Discrimination, Hadamard Spectroscopy, Liouville Space Search, Use Of Geometric Phase For Gates And Algorithms.

Degree: 2007, Indian Institute of Science

 The progess in NMRQIP can be outlined in to four parts.1) Implementation of theoretical protocols on small number of qubits. 2) Demonstration of QIP on… (more)

Subjects/Keywords: Algorithm; Nuclear Magnetic Resonance; Quantum Theory; Quantum Information Processing; Quantum Algorithms; Hadamard NMR Spectroscopy; Liouville Space Search Algorithm; Quantum Computation; Non-Adiabatic Geometric Phases; Quantum State Discriminator; Quantum Gates; Parallel Search Algorithms; Dipolar Coupled Nuclear Spins; Deutsch-Jozsa Algorithm; Quantum Mechanics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Gopinath, T. (2007). Quantum Information Processing By NMR : Quantum State Discrimination, Hadamard Spectroscopy, Liouville Space Search, Use Of Geometric Phase For Gates And Algorithms. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/1078

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):

Gopinath, T. “Quantum Information Processing By NMR : Quantum State Discrimination, Hadamard Spectroscopy, Liouville Space Search, Use Of Geometric Phase For Gates And Algorithms.” 2007. Thesis, Indian Institute of Science. Accessed January 23, 2020. http://hdl.handle.net/2005/1078.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Gopinath, T. “Quantum Information Processing By NMR : Quantum State Discrimination, Hadamard Spectroscopy, Liouville Space Search, Use Of Geometric Phase For Gates And Algorithms.” 2007. Web. 23 Jan 2020.

Vancouver:

Gopinath T. Quantum Information Processing By NMR : Quantum State Discrimination, Hadamard Spectroscopy, Liouville Space Search, Use Of Geometric Phase For Gates And Algorithms. [Internet] [Thesis]. Indian Institute of Science; 2007. [cited 2020 Jan 23]. Available from: http://hdl.handle.net/2005/1078.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Gopinath T. Quantum Information Processing By NMR : Quantum State Discrimination, Hadamard Spectroscopy, Liouville Space Search, Use Of Geometric Phase For Gates And Algorithms. [Thesis]. Indian Institute of Science; 2007. Available from: http://hdl.handle.net/2005/1078

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of New Mexico

30. Denney, Aaron Jafar. Quantum algorithms, symmetry, and Fourier analysis.

Degree: Physics & Astronomy, 2012, University of New Mexico

 I describe the role of symmetry in two quantum algorithms, with a focus on how that symmetry is made manifest by the Fourier transform. The… (more)

Subjects/Keywords: Quantum computers; Computer algorithms; Symmetry (Mathematics); Fourier transformations; Representations of groups.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Denney, A. J. (2012). Quantum algorithms, symmetry, and Fourier analysis. (Doctoral Dissertation). University of New Mexico. Retrieved from http://hdl.handle.net/1928/21025

Chicago Manual of Style (16th Edition):

Denney, Aaron Jafar. “Quantum algorithms, symmetry, and Fourier analysis.” 2012. Doctoral Dissertation, University of New Mexico. Accessed January 23, 2020. http://hdl.handle.net/1928/21025.

MLA Handbook (7th Edition):

Denney, Aaron Jafar. “Quantum algorithms, symmetry, and Fourier analysis.” 2012. Web. 23 Jan 2020.

Vancouver:

Denney AJ. Quantum algorithms, symmetry, and Fourier analysis. [Internet] [Doctoral dissertation]. University of New Mexico; 2012. [cited 2020 Jan 23]. Available from: http://hdl.handle.net/1928/21025.

Council of Science Editors:

Denney AJ. Quantum algorithms, symmetry, and Fourier analysis. [Doctoral Dissertation]. University of New Mexico; 2012. Available from: http://hdl.handle.net/1928/21025

[1] [2] [3]

.