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 +publisher:"Indian Institute of Science" +contributor:("Patel, Apoorva"). Showing records 1 – 4 of 4 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


Indian Institute of Science

1. Kumar, Parveen. Quantum dynamics of weak measurements: Understanding the Born rule and applying weak error correction.

Degree: PhD, Faculty of Science, 2019, Indian Institute of Science

 Projective measurement is used as a fundamental axiom in quantum mechanics, even though it is discontinuous and cannot predict which measured operator eigen state will… (more)

Subjects/Keywords: Quantum mechanics; Quantum computer; Quantum Error correction; Quantum trajectory framework; Research Subject Categories::NATURAL SCIENCES::Physics::Other physics::Computational physics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kumar, P. (2019). Quantum dynamics of weak measurements: Understanding the Born rule and applying weak error correction. (Doctoral Dissertation). Indian Institute of Science. Retrieved from http://etd.iisc.ac.in/handle/2005/4261

Chicago Manual of Style (16th Edition):

Kumar, Parveen. “Quantum dynamics of weak measurements: Understanding the Born rule and applying weak error correction.” 2019. Doctoral Dissertation, Indian Institute of Science. Accessed January 28, 2021. http://etd.iisc.ac.in/handle/2005/4261.

MLA Handbook (7th Edition):

Kumar, Parveen. “Quantum dynamics of weak measurements: Understanding the Born rule and applying weak error correction.” 2019. Web. 28 Jan 2021.

Vancouver:

Kumar P. Quantum dynamics of weak measurements: Understanding the Born rule and applying weak error correction. [Internet] [Doctoral dissertation]. Indian Institute of Science; 2019. [cited 2021 Jan 28]. Available from: http://etd.iisc.ac.in/handle/2005/4261.

Council of Science Editors:

Kumar P. Quantum dynamics of weak measurements: Understanding the Born rule and applying weak error correction. [Doctoral Dissertation]. Indian Institute of Science; 2019. Available from: http://etd.iisc.ac.in/handle/2005/4261


Indian Institute of Science

2. Sainadh, U Satya. An Efficient Quantum Algorithm and Circuit to Generate Eigenstates Of SU(2) and SU(3) Representations.

Degree: MS, Faculty of Science, 2018, Indian Institute of Science

 Many quantum computation algorithms, and processes like measurement based quantum computing, require the initial state of the quantum computer to be an eigenstate of a… (more)

Subjects/Keywords: Quantum Mechanics; Quantum Algorithms; Eigenstates - Special Unitary (SU) Group Representations; Quantum Circuits; Special Unitary (SU) Group Representations; Computational Complexity; Schur Transform; Eigenstate - SU(2); Eigenstate - SU(3); High Energy Physics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sainadh, U. S. (2018). An Efficient Quantum Algorithm and Circuit to Generate Eigenstates Of SU(2) and SU(3) Representations. (Masters Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ac.in/handle/2005/3425

Chicago Manual of Style (16th Edition):

Sainadh, U Satya. “An Efficient Quantum Algorithm and Circuit to Generate Eigenstates Of SU(2) and SU(3) Representations.” 2018. Masters Thesis, Indian Institute of Science. Accessed January 28, 2021. http://etd.iisc.ac.in/handle/2005/3425.

MLA Handbook (7th Edition):

Sainadh, U Satya. “An Efficient Quantum Algorithm and Circuit to Generate Eigenstates Of SU(2) and SU(3) Representations.” 2018. Web. 28 Jan 2021.

Vancouver:

Sainadh US. An Efficient Quantum Algorithm and Circuit to Generate Eigenstates Of SU(2) and SU(3) Representations. [Internet] [Masters thesis]. Indian Institute of Science; 2018. [cited 2021 Jan 28]. Available from: http://etd.iisc.ac.in/handle/2005/3425.

Council of Science Editors:

Sainadh US. An Efficient Quantum Algorithm and Circuit to Generate Eigenstates Of SU(2) and SU(3) Representations. [Masters Thesis]. Indian Institute of Science; 2018. Available from: http://etd.iisc.ac.in/handle/2005/3425


Indian Institute of Science

3. Rahaman, Md Aminoor. Search On A Hypercubic Lattice Using Quantum Random Walk.

Degree: MSc Engg, Faculty of Engineering, 2010, Indian Institute of Science

 Random walks describe diffusion processes, where movement at every time step is restricted only to neighbouring locations. Classical random walks are constructed using the non-relativistic… (more)

Subjects/Keywords: Lattice Theory - Data Processing; Quantum Random Walk; Grover's Algorithm; Dirac Operators; Quantum Computation; Dimensional Hypercubic Lattices; Random Walk Algorithm; Spatial Search; Quantum Physics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rahaman, M. A. (2010). Search On A Hypercubic Lattice Using Quantum Random Walk. (Masters Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ac.in/handle/2005/972

Chicago Manual of Style (16th Edition):

Rahaman, Md Aminoor. “Search On A Hypercubic Lattice Using Quantum Random Walk.” 2010. Masters Thesis, Indian Institute of Science. Accessed January 28, 2021. http://etd.iisc.ac.in/handle/2005/972.

MLA Handbook (7th Edition):

Rahaman, Md Aminoor. “Search On A Hypercubic Lattice Using Quantum Random Walk.” 2010. Web. 28 Jan 2021.

Vancouver:

Rahaman MA. Search On A Hypercubic Lattice Using Quantum Random Walk. [Internet] [Masters thesis]. Indian Institute of Science; 2010. [cited 2021 Jan 28]. Available from: http://etd.iisc.ac.in/handle/2005/972.

Council of Science Editors:

Rahaman MA. Search On A Hypercubic Lattice Using Quantum Random Walk. [Masters Thesis]. Indian Institute of Science; 2010. Available from: http://etd.iisc.ac.in/handle/2005/972


Indian Institute of Science

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

Degree: PhD, Faculty of Science, 2010, 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. (2010). Generalizations Of The Quantum Search Algorithm. (Doctoral Dissertation). Indian Institute of Science. Retrieved from http://etd.iisc.ac.in/handle/2005/951

Chicago Manual of Style (16th Edition):

Tulsi, Tathagat Avatar. “Generalizations Of The Quantum Search Algorithm.” 2010. Doctoral Dissertation, Indian Institute of Science. Accessed January 28, 2021. http://etd.iisc.ac.in/handle/2005/951.

MLA Handbook (7th Edition):

Tulsi, Tathagat Avatar. “Generalizations Of The Quantum Search Algorithm.” 2010. Web. 28 Jan 2021.

Vancouver:

Tulsi TA. Generalizations Of The Quantum Search Algorithm. [Internet] [Doctoral dissertation]. Indian Institute of Science; 2010. [cited 2021 Jan 28]. Available from: http://etd.iisc.ac.in/handle/2005/951.

Council of Science Editors:

Tulsi TA. Generalizations Of The Quantum Search Algorithm. [Doctoral Dissertation]. Indian Institute of Science; 2010. Available from: http://etd.iisc.ac.in/handle/2005/951

.