Advanced search options

Sorted by: relevance · author · university · date | New search

You searched for `subject:(Entanglement complexity)`

.
Showing records 1 – 12 of
12 total matches.

▼ Search Limiters

Texas A&M University

1.
Kamat, Angad Mohandas.
Improvements in communication *complexity* using quantum * entanglement*.

Degree: 2008, Texas A&M University

URL: http://hdl.handle.net/1969.1/86008

► Quantum computing resources have been known to provide speed-ups in computational *complexity* in many algorithms. The impact of these resources in communication, however, has not…
(more)

Subjects/Keywords: multi-party; communication complexity; quantum computing; entanglement

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kamat, A. M. (2008). Improvements in communication complexity using quantum entanglement. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/86008

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Kamat, Angad Mohandas. “Improvements in communication complexity using quantum entanglement.” 2008. Thesis, Texas A&M University. Accessed March 18, 2019. http://hdl.handle.net/1969.1/86008.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Kamat, Angad Mohandas. “Improvements in communication complexity using quantum entanglement.” 2008. Web. 18 Mar 2019.

Vancouver:

Kamat AM. Improvements in communication complexity using quantum entanglement. [Internet] [Thesis]. Texas A&M University; 2008. [cited 2019 Mar 18]. Available from: http://hdl.handle.net/1969.1/86008.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kamat AM. Improvements in communication complexity using quantum entanglement. [Thesis]. Texas A&M University; 2008. Available from: http://hdl.handle.net/1969.1/86008

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

2. Gutoski, Gustav. Quantum Strategies and Local Operations.

Degree: 2010, University of Waterloo

URL: http://hdl.handle.net/10012/4903

► This thesis is divided into two parts. In Part I we introduce a new formalism for quantum strategies, which specify the actions of one party…
(more)

Subjects/Keywords: quantum; quantum information; quantum computing; game theory; entanglement; complexity

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Gutoski, G. (2010). Quantum Strategies and Local Operations. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/4903

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Gutoski, Gustav. “Quantum Strategies and Local Operations.” 2010. Thesis, University of Waterloo. Accessed March 18, 2019. http://hdl.handle.net/10012/4903.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Gutoski, Gustav. “Quantum Strategies and Local Operations.” 2010. Web. 18 Mar 2019.

Vancouver:

Gutoski G. Quantum Strategies and Local Operations. [Internet] [Thesis]. University of Waterloo; 2010. [cited 2019 Mar 18]. Available from: http://hdl.handle.net/10012/4903.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Gutoski G. Quantum Strategies and Local Operations. [Thesis]. University of Waterloo; 2010. Available from: http://hdl.handle.net/10012/4903

Not specified: Masters Thesis or Doctoral Dissertation

3. Arrazola, Juan Miguel. Practical Quantum Communication.

Degree: 2015, University of Waterloo

URL: http://hdl.handle.net/10012/9850

► Current communication networks are based on classical physics and classical information-processing. However, for nearly a century, we have known that at its most fundamental level,…
(more)

Subjects/Keywords: quantum communication; quantum cryptography; communication complexity; entanglement verification; quantum optics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Arrazola, J. M. (2015). Practical Quantum Communication. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/9850

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Arrazola, Juan Miguel. “Practical Quantum Communication.” 2015. Thesis, University of Waterloo. Accessed March 18, 2019. http://hdl.handle.net/10012/9850.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Arrazola, Juan Miguel. “Practical Quantum Communication.” 2015. Web. 18 Mar 2019.

Vancouver:

Arrazola JM. Practical Quantum Communication. [Internet] [Thesis]. University of Waterloo; 2015. [cited 2019 Mar 18]. Available from: http://hdl.handle.net/10012/9850.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Arrazola JM. Practical Quantum Communication. [Thesis]. University of Waterloo; 2015. Available from: http://hdl.handle.net/10012/9850

Not specified: Masters Thesis or Doctoral Dissertation

University of Michigan

4.
Chitambar, Eric A.
Computational *Complexity* in *Entanglement* Transformations.

Degree: PhD, Physics, 2010, University of Michigan

URL: http://hdl.handle.net/2027.42/77737

► In physics, systems having three parts are typically much more difficult to analyze than those having just two. Even in classical mechanics, predicting the motion…
(more)

Subjects/Keywords: Entanglement Theory; Computational Complexity; Quantum Information; Physics; Science

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Chitambar, E. A. (2010). Computational Complexity in Entanglement Transformations. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/77737

Chicago Manual of Style (16^{th} Edition):

Chitambar, Eric A. “Computational Complexity in Entanglement Transformations.” 2010. Doctoral Dissertation, University of Michigan. Accessed March 18, 2019. http://hdl.handle.net/2027.42/77737.

MLA Handbook (7^{th} Edition):

Chitambar, Eric A. “Computational Complexity in Entanglement Transformations.” 2010. Web. 18 Mar 2019.

Vancouver:

Chitambar EA. Computational Complexity in Entanglement Transformations. [Internet] [Doctoral dissertation]. University of Michigan; 2010. [cited 2019 Mar 18]. Available from: http://hdl.handle.net/2027.42/77737.

Council of Science Editors:

Chitambar EA. Computational Complexity in Entanglement Transformations. [Doctoral Dissertation]. University of Michigan; 2010. Available from: http://hdl.handle.net/2027.42/77737

Colorado School of Mines

5.
Hillberry, Logan E.
* Entanglement* and

Degree: MS(M.S.), Physics, 2016, Colorado School of Mines

URL: http://hdl.handle.net/11124/170336

► *Complexity* is an intuitively recognized feature of nature, but where does it come from? Is *complexity* only apparent at the classical level, or can it…
(more)

Subjects/Keywords: Cellular automata; Complexity; Entanglement; Quantum dynamics; Quantum physics; Spin lattice

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Hillberry, L. E. (2016). Entanglement and complexity in quantum elementary cellular automata. (Masters Thesis). Colorado School of Mines. Retrieved from http://hdl.handle.net/11124/170336

Chicago Manual of Style (16^{th} Edition):

Hillberry, Logan E. “Entanglement and complexity in quantum elementary cellular automata.” 2016. Masters Thesis, Colorado School of Mines. Accessed March 18, 2019. http://hdl.handle.net/11124/170336.

MLA Handbook (7^{th} Edition):

Hillberry, Logan E. “Entanglement and complexity in quantum elementary cellular automata.” 2016. Web. 18 Mar 2019.

Vancouver:

Hillberry LE. Entanglement and complexity in quantum elementary cellular automata. [Internet] [Masters thesis]. Colorado School of Mines; 2016. [cited 2019 Mar 18]. Available from: http://hdl.handle.net/11124/170336.

Council of Science Editors:

Hillberry LE. Entanglement and complexity in quantum elementary cellular automata. [Masters Thesis]. Colorado School of Mines; 2016. Available from: http://hdl.handle.net/11124/170336

University of Waikato

6.
Nicholson, Shaun.
Parsing Technology-*entanglement* for Thick-things: The Complication or *Complexity* of Media and Technologies
.

Degree: 2016, University of Waikato

URL: http://hdl.handle.net/10289/9976

► Can an interpretive framework untangle distributed forms of technology-enabled media? The thesis develops an interpretive framework to provide an antidote to reckless imaginations that privilege…
(more)

Subjects/Keywords: Digital media; Digital Ethnography; Entanglement; Complication; Complexity; Augmented Reality; Digital Photography; Technology-entanglement; Thick-things; Nonhuman; Automagical

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Nicholson, S. (2016). Parsing Technology-entanglement for Thick-things: The Complication or Complexity of Media and Technologies . (Doctoral Dissertation). University of Waikato. Retrieved from http://hdl.handle.net/10289/9976

Chicago Manual of Style (16^{th} Edition):

Nicholson, Shaun. “Parsing Technology-entanglement for Thick-things: The Complication or Complexity of Media and Technologies .” 2016. Doctoral Dissertation, University of Waikato. Accessed March 18, 2019. http://hdl.handle.net/10289/9976.

MLA Handbook (7^{th} Edition):

Nicholson, Shaun. “Parsing Technology-entanglement for Thick-things: The Complication or Complexity of Media and Technologies .” 2016. Web. 18 Mar 2019.

Vancouver:

Nicholson S. Parsing Technology-entanglement for Thick-things: The Complication or Complexity of Media and Technologies . [Internet] [Doctoral dissertation]. University of Waikato; 2016. [cited 2019 Mar 18]. Available from: http://hdl.handle.net/10289/9976.

Council of Science Editors:

Nicholson S. Parsing Technology-entanglement for Thick-things: The Complication or Complexity of Media and Technologies . [Doctoral Dissertation]. University of Waikato; 2016. Available from: http://hdl.handle.net/10289/9976

University of Saskatchewan

7.
Atapour, Mahshid.
Topological *entanglement* *complexity* of systems of polygons and walks in tubes.

Degree: 2008, University of Saskatchewan

URL: http://hdl.handle.net/10388/etd-09082008-102610

► In this thesis, motivated by modelling polymers, the topological *entanglement* *complexity* of systems of two self-avoiding polygons (2SAPs), stretched polygons and systems of self-avoiding walks…
(more)

Subjects/Keywords: Tube; Polygon; Polymer; Self-avoiding walk; Entanglement complexity

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Atapour, M. (2008). Topological entanglement complexity of systems of polygons and walks in tubes. (Thesis). University of Saskatchewan. Retrieved from http://hdl.handle.net/10388/etd-09082008-102610

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Atapour, Mahshid. “Topological entanglement complexity of systems of polygons and walks in tubes.” 2008. Thesis, University of Saskatchewan. Accessed March 18, 2019. http://hdl.handle.net/10388/etd-09082008-102610.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Atapour, Mahshid. “Topological entanglement complexity of systems of polygons and walks in tubes.” 2008. Web. 18 Mar 2019.

Vancouver:

Atapour M. Topological entanglement complexity of systems of polygons and walks in tubes. [Internet] [Thesis]. University of Saskatchewan; 2008. [cited 2019 Mar 18]. Available from: http://hdl.handle.net/10388/etd-09082008-102610.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Atapour M. Topological entanglement complexity of systems of polygons and walks in tubes. [Thesis]. University of Saskatchewan; 2008. Available from: http://hdl.handle.net/10388/etd-09082008-102610

Not specified: Masters Thesis or Doctoral Dissertation

Laurentian University

8. Harrison, Jessica Elena. Computer simulation of molecular shape transitions in adsorbed polymers under confinement conditions .

Degree: 2017, Laurentian University

URL: https://zone.biblio.laurentian.ca/handle/10219/2821

► The structural and dynamical properties of polymer-covered surfaces under confinement and crowding effects are key to many applications. Earlier work showed the occurrence of “escape…
(more)

Subjects/Keywords: Polymer islands; Monte Carlo simulations; self-avoiding walks; radius of excluded volume; escape transition; chain avoidance; entanglement complexity; coarse-grained; hard-sphere potential; Marsaglia algorithm; Metropolis-Hasting algorithm

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Harrison, J. E. (2017). Computer simulation of molecular shape transitions in adsorbed polymers under confinement conditions . (Thesis). Laurentian University. Retrieved from https://zone.biblio.laurentian.ca/handle/10219/2821

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Harrison, Jessica Elena. “Computer simulation of molecular shape transitions in adsorbed polymers under confinement conditions .” 2017. Thesis, Laurentian University. Accessed March 18, 2019. https://zone.biblio.laurentian.ca/handle/10219/2821.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Harrison, Jessica Elena. “Computer simulation of molecular shape transitions in adsorbed polymers under confinement conditions .” 2017. Web. 18 Mar 2019.

Vancouver:

Harrison JE. Computer simulation of molecular shape transitions in adsorbed polymers under confinement conditions . [Internet] [Thesis]. Laurentian University; 2017. [cited 2019 Mar 18]. Available from: https://zone.biblio.laurentian.ca/handle/10219/2821.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Harrison JE. Computer simulation of molecular shape transitions in adsorbed polymers under confinement conditions . [Thesis]. Laurentian University; 2017. Available from: https://zone.biblio.laurentian.ca/handle/10219/2821

Not specified: Masters Thesis or Doctoral Dissertation

Université de Montréal

9. Payette, Tommy. Multi-Prover and parallel repetition in non-classical interactive games .

Degree: 2010, Université de Montréal

URL: http://hdl.handle.net/1866/3547

► Depuis l’introduction de la mécanique quantique, plusieurs mystères de la nature ont trouvé leurs explications. De plus en plus, les concepts de la mécanique quantique…
(more)

Subjects/Keywords: Preuves intéractives à plusieurs prouveurs; Multi-prover interactive proofs; Jeux du cycle impair; Odd Cycle Games; Nonlocalité; Nonlocality; Complexité du calcul quantique; Quantum computational complexity; Intrication; Entanglement

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Payette, T. (2010). Multi-Prover and parallel repetition in non-classical interactive games . (Thesis). Université de Montréal. Retrieved from http://hdl.handle.net/1866/3547

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Payette, Tommy. “Multi-Prover and parallel repetition in non-classical interactive games .” 2010. Thesis, Université de Montréal. Accessed March 18, 2019. http://hdl.handle.net/1866/3547.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Payette, Tommy. “Multi-Prover and parallel repetition in non-classical interactive games .” 2010. Web. 18 Mar 2019.

Vancouver:

Payette T. Multi-Prover and parallel repetition in non-classical interactive games . [Internet] [Thesis]. Université de Montréal; 2010. [cited 2019 Mar 18]. Available from: http://hdl.handle.net/1866/3547.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Payette T. Multi-Prover and parallel repetition in non-classical interactive games . [Thesis]. Université de Montréal; 2010. Available from: http://hdl.handle.net/1866/3547

Not specified: Masters Thesis or Doctoral Dissertation

10. Almeida, Clarissa Ribeiro Pereira de. Instantes de metamorfose: o coletivo como processo; o processo como sistema.

Degree: PhD, Poéticas Visuais, 2011, University of São Paulo

URL: http://www.teses.usp.br/teses/disponiveis/27/27159/tde-22082011-143952/ ;

►

O trabalho coletivo em artes digitais define uma pratica que implica a interacao de diversos atores em processos de criacao que podem ter caracteristicas generativas.… (more)

Subjects/Keywords: Antenarrativas; Antenarratives; Arte digital; Artes visuais; Auto-organização; Collective creative processes in digital arts; Complex adaptive systems; Complexidade; Complexity; Criacao artistica; Emergence; Emergência; Entrelaçamento quântico; Espaços estoricizados; Processo criativo; Quantum Entanglement; Self-organization; Sistemas complexos adaptativos; Storied spaces

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Almeida, C. R. P. d. (2011). Instantes de metamorfose: o coletivo como processo; o processo como sistema. (Doctoral Dissertation). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/27/27159/tde-22082011-143952/ ;

Chicago Manual of Style (16^{th} Edition):

Almeida, Clarissa Ribeiro Pereira de. “Instantes de metamorfose: o coletivo como processo; o processo como sistema.” 2011. Doctoral Dissertation, University of São Paulo. Accessed March 18, 2019. http://www.teses.usp.br/teses/disponiveis/27/27159/tde-22082011-143952/ ;.

MLA Handbook (7^{th} Edition):

Almeida, Clarissa Ribeiro Pereira de. “Instantes de metamorfose: o coletivo como processo; o processo como sistema.” 2011. Web. 18 Mar 2019.

Vancouver:

Almeida CRPd. Instantes de metamorfose: o coletivo como processo; o processo como sistema. [Internet] [Doctoral dissertation]. University of São Paulo; 2011. [cited 2019 Mar 18]. Available from: http://www.teses.usp.br/teses/disponiveis/27/27159/tde-22082011-143952/ ;.

Council of Science Editors:

Almeida CRPd. Instantes de metamorfose: o coletivo como processo; o processo como sistema. [Doctoral Dissertation]. University of São Paulo; 2011. Available from: http://www.teses.usp.br/teses/disponiveis/27/27159/tde-22082011-143952/ ;

University of Michigan

11.
Zhu, Yufan.
Quantum Communication *Complexity* and Nonlocality of Bipartite Quantum Operations.

Degree: PhD, Computer Science & Engineering, 2008, University of Michigan

URL: http://hdl.handle.net/2027.42/58538

► This dissertation is motivated by the following fundamental questions: (a) are there any exponential gaps between quantum and classical communication complexities? (b) what is the…
(more)

Subjects/Keywords: Quantum Computation; Communication Complexity; Quantum Entanglement; Bipartite Quantum Operations; Nonlocality of Quantum Operations; Computer Science; Engineering

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Zhu, Y. (2008). Quantum Communication Complexity and Nonlocality of Bipartite Quantum Operations. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/58538

Chicago Manual of Style (16^{th} Edition):

Zhu, Yufan. “Quantum Communication Complexity and Nonlocality of Bipartite Quantum Operations.” 2008. Doctoral Dissertation, University of Michigan. Accessed March 18, 2019. http://hdl.handle.net/2027.42/58538.

MLA Handbook (7^{th} Edition):

Zhu, Yufan. “Quantum Communication Complexity and Nonlocality of Bipartite Quantum Operations.” 2008. Web. 18 Mar 2019.

Vancouver:

Zhu Y. Quantum Communication Complexity and Nonlocality of Bipartite Quantum Operations. [Internet] [Doctoral dissertation]. University of Michigan; 2008. [cited 2019 Mar 18]. Available from: http://hdl.handle.net/2027.42/58538.

Council of Science Editors:

Zhu Y. Quantum Communication Complexity and Nonlocality of Bipartite Quantum Operations. [Doctoral Dissertation]. University of Michigan; 2008. Available from: http://hdl.handle.net/2027.42/58538

Kyoto University

12.
Watanabe, Kento.
Scrambling and *Complexity* in AdS/CFT and Black Holes
.

Degree: 2018, Kyoto University

URL: http://hdl.handle.net/2433/232251

Subjects/Keywords: Quantum Entanglement; AdS/CFT Correspondence; Black Hole Information Problem; Scrambling of Quantum Information; Complexity of States

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Watanabe, K. (2018). Scrambling and Complexity in AdS/CFT and Black Holes . (Thesis). Kyoto University. Retrieved from http://hdl.handle.net/2433/232251

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Watanabe, Kento. “Scrambling and Complexity in AdS/CFT and Black Holes .” 2018. Thesis, Kyoto University. Accessed March 18, 2019. http://hdl.handle.net/2433/232251.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Watanabe, Kento. “Scrambling and Complexity in AdS/CFT and Black Holes .” 2018. Web. 18 Mar 2019.

Vancouver:

Watanabe K. Scrambling and Complexity in AdS/CFT and Black Holes . [Internet] [Thesis]. Kyoto University; 2018. [cited 2019 Mar 18]. Available from: http://hdl.handle.net/2433/232251.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Watanabe K. Scrambling and Complexity in AdS/CFT and Black Holes . [Thesis]. Kyoto University; 2018. Available from: http://hdl.handle.net/2433/232251

Not specified: Masters Thesis or Doctoral Dissertation