1 resultado para Quantum computational complexity
em Institutional Repository of Leibniz University Hannover
Filtro por publicador
- Academic Archive On-line (Stockholm University; Sweden) (1)
- Acceda, el repositorio institucional de la Universidad de Las Palmas de Gran Canaria. España (1)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (12)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (1)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (2)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (7)
- Aston University Research Archive (32)
- Biblioteca de Teses e Dissertações da USP (2)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (14)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (7)
- Biblioteca Digital de Teses e Dissertações Eletrônicas da UERJ (1)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (9)
- Boston University Digital Common (8)
- Brock University, Canada (4)
- Bucknell University Digital Commons - Pensilvania - USA (4)
- Bulgarian Digital Mathematics Library at IMI-BAS (6)
- CaltechTHESIS (6)
- Cambridge University Engineering Department Publications Database (18)
- CentAUR: Central Archive University of Reading - UK (27)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (23)
- Cochin University of Science & Technology (CUSAT), India (8)
- Dalarna University College Electronic Archive (1)
- Department of Computer Science E-Repository - King's College London, Strand, London (3)
- DI-fusion - The institutional repository of Université Libre de Bruxelles (2)
- Digital Commons - Michigan Tech (8)
- Digital Commons at Florida International University (2)
- DigitalCommons@The Texas Medical Center (1)
- DigitalCommons@University of Nebraska - Lincoln (4)
- DRUM (Digital Repository at the University of Maryland) (3)
- Duke University (8)
- Düsseldorfer Dokumenten- und Publikationsservice (1)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (4)
- FUNDAJ - Fundação Joaquim Nabuco (1)
- Glasgow Theses Service (2)
- Greenwich Academic Literature Archive - UK (7)
- Helda - Digital Repository of University of Helsinki (41)
- Indian Institute of Science - Bangalore - Índia (128)
- Institutional Repository of Leibniz University Hannover (1)
- Instituto Politécnico do Porto, Portugal (1)
- Massachusetts Institute of Technology (9)
- Memorial University Research Repository (1)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (54)
- Queensland University of Technology - ePrints Archive (316)
- Repositório Científico da Universidade de Évora - Portugal (1)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (3)
- Repositório digital da Fundação Getúlio Vargas - FGV (1)
- Repositório Institucional da Universidade de Aveiro - Portugal (1)
- Repositório Institucional da Universidade de Brasília (1)
- Repositório Institucional da Universidade Estadual de São Paulo - UNESP (1)
- Repositório Institucional da Universidade Federal do Rio Grande do Norte (1)
- Repositorio Institucional de la Universidad de La Laguna (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (22)
- Repositorio Institucional Universidad EAFIT - Medelin - Colombia (1)
- Universidad de Alicante (3)
- Universidad Politécnica de Madrid (29)
- Universidade Federal do Rio Grande do Norte (UFRN) (3)
- Universita di Parma (2)
- Universitat de Girona, Spain (4)
- Université de Montréal (1)
- Université de Montréal, Canada (11)
- University of Michigan (7)
- University of Queensland eSpace - Australia (18)
- University of Southampton, United Kingdom (1)
- University of Washington (1)
- WestminsterResearch - UK (1)
Resumo:
We investigate protocols for generating a state t-design by using a fixed separable initial state and a diagonal-unitary t-design in the computational basis, which is a t-design of an ensemble of diagonal unitary matrices with random phases as their eigenvalues. We first show that a diagonal-unitary t-design generates a O (1/2(N))-approximate state t-design, where N is the number of qubits. We then discuss a way of improving the degree of approximation by exploiting non-diagonal gates after applying a diagonal-unitary t-design. We also show that it is necessary and sufficient to use O (log(2)(t)) -qubit gates with random phases to generate a diagonal-unitary t-design by diagonal quantum circuits, and that each multi-qubit diagonal gate can be replaced by a sequence of multi-qubit controlled-phase-type gates with discrete-valued random phases. Finally, we analyze the number of gates for implementing a diagonal-unitary t-design by non-diagonal two- and one-qubit gates. Our results provide a concrete application of diagonal quantum circuits in quantum informational tasks.