Contribuições em teleportação de portas quânticas, algoritmos de busca quântica e processamento quântico de imagens

Paulo Sousa

Published Jun 29, 2018• 0 citations

Abstract

This thesis presents, initially, an analysis of the teleportation protocol of two qubits quantum gates, which uses an four qubits entangled state as a resource. It will be shown that the set of four qubits pure states is divided into two classes: Class 1 and Class 2, which determine, respectively, the realization of a deterministic gate teleportation, or a probabilistic remote preparation. It is still shown that when there is additional information on search problems that are not applicable to a standard quantum search algorithm, it is possible to obtain better performance using a quantum algorithm in conjunction with a classical search algorithm. Finally, a new model of image representation in quantum states is proposed, the new model has a less complex preparation and recovery compared to the other models currently proposed and allows the processing of images in both gray and colored scales.

Related papers

Teleportação de portas quânticas, entrelaçadores universais e conexões com a teoria dos números

F. V. Mendes

Feb 19, 20150 citations

Uma introdução à computação quântica, protocolos de complexidade de comunicação quânticos, não-localidade e parâmetros quânticos de grafos

Lucas Silva Arenstein

Dec 12, 20220 citations

A hybrid-qudit representation of digital RGB images

Sreetama Das, Filippo Caruso

arXiv:2207.12550Scientific ReportsAug 22, 202313 citations

Use of quantum teleport in fault tolerant quantum computing.

A. Santos Pereira

Nov 25, 20110 citations

Quantum Communication of Images with 3-State Protocols

Yifan Hang

Theoretical and Natural ScienceSep 15, 20260 citations

Efficient Algorithms for All Port-Based Teleportation Protocols

Adam Wills, Min-Hsiu Hsieh, Sergii Strelchuk

arXiv:2311.12012PRX QuantumSep 20, 20244 citations

Contribuições em teleportação de portas quânticas, algoritmos de busca quântica e processamento quântico de imagens

Paulo Sousa

Published Jun 29, 2018• 0 citations

OpenAlex

Abstract

Related papers

Teleportação de portas quânticas, entrelaçadores universais e conexões com a teoria dos números

F. V. Mendes

The present thesis can be divided in three parts: 1) Quantum gate teleportation; 2) Numerical search of universal entanglers; 3) Connections between quantum information and number theory. Regarding the quantum gate teleportation, a separability criterion of normal matrices is used to find the analytical conditions of the preservation of separability under conjugation. That analytical condition allowed to find the general formula of an element of $mathbb{C}^{4}$ Clifford group, as well to understand the role of the basis of measurement in the quantum gate teleportation protocol. Considering the searching for universal entanglers, the same separability criterion of normal matrices was used as fitness function in a computational heuristics, in prder to find good candidates for universal entanglers in $mathbb{C}^{3} otimes mathbb{C}^{4}$ and $mathbb{C}^{4} otimes mathbb{C}^{4}$ Hilbert spaces. At last, in the connection of quantum information with the number theory, it is presented the study of the preparation and entanglement of several multi-qubit quantum states based in integer sequences, and the Riemannian quantum circuit, a quantum circuit whose eigenvalues are related to the zeros of the Riemann zeta function. The existence of such circuit proves that is always possible to construct a physical system related to a finite amount of zeros.The present thesis can be divided in three parts: 1) Quantum gate teleportation; 2) Numerical search of universal entanglers; 3) Connections between quantum information and number theory. Regarding the quantum gate teleportation, a separability criterion of normal matrices is used to find the analytical conditions of the preservation of separability under conjugation. That analytical condition allowed to find the general formula of an element of $mathbb{C}^{4}$ Clifford group, as well to understand the role of the basis of measurement in the quantum gate teleportation protocol. Considering the searching for universal entanglers, the same separability criterion of normal matrices was used as fitness function in a computational heuristics, in prder to find good candidates for universal entanglers in $mathbb{C}^{3} otimes mathbb{C}^{4}$ and $mathbb{C}^{4} otimes mathbb{C}^{4}$ Hilbert spaces. At last, in the connection of quantum information with the number theory, it is presented the study of the preparation and entanglement of several multi-qubit quantum states based in integer sequences, and the Riemannian quantum circuit, a quantum circuit whose eigenvalues are related to the zeros of the Riemann zeta function. The existence of such circuit proves that is always possible to construct a physical system related to a finite amount of zeros.

Feb 19, 20150 citations

Uma introdução à computação quântica, protocolos de complexidade de comunicação quânticos, não-localidade e parâmetros quânticos de grafos

Lucas Silva Arenstein

What are the advantages quantum computing can provide when compared to classical computing? In this thesis, we aim to answer this question from different perspectives. To achieve this goal we divided this work into three parts. In Part I we start by studying the basic principles of quantum computing. Next, we introduce two quantum algorithms: the Deutsch-Jozsa and Grovers algorithms. The first algorithm has a lower query complexity and the second has a lower time complexity when compared with the best classical algorithm for the same problems. The final topic of this initial part is a detailed explanation and example of how to use Grovers algorithm to solve a Boolean formula in conjunctive normal form. In the second part, we focus on communication complexity problems. These problems are usually stated as follows: two spatially separated parties Alice and Bob receive an input from a referee. Their goal is to compute the value of a function that depends on both of their inputs with the least amount of communication between them. In Part II we will introduce protocols in which the transmission of quantum bits (qubits), instead of bits, can reduce the amount of communication necessary to solve these problems. We also study how Alice and Bob can use quantum entanglement to solve two communication complexity problems without communicating something that can not be done classically. In Part III we study nonlocal games inspired by standard graph theory parameters. A nonlocal game is usually defined as a game in which players that can share and do computations in an entangled state have some sort of advantage over classical players. We begin this final part by introducing the quantum chromatic number of a graph, which is the minimal number of colors necessary in a nonlocal game in which Alice and Bob can convince a referee with certainty that they have a proper coloring of the graph. We end this thesis by introducing other two quantum graph parameters, one related to graph homomorphism and the other to the independence number of a graph.What are the advantages quantum computing can provide when compared to classical computing? In this thesis, we aim to answer this question from different perspectives. To achieve this goal we divided this work into three parts. In Part I we start by studying the basic principles of quantum computing. Next, we introduce two quantum algorithms: the Deutsch-Jozsa and Grovers algorithms. The first algorithm has a lower query complexity and the second has a lower time complexity when compared with the best classical algorithm for the same problems. The final topic of this initial part is a detailed explanation and example of how to use Grovers algorithm to solve a Boolean formula in conjunctive normal form. In the second part, we focus on communication complexity problems. These problems are usually stated as follows: two spatially separated parties Alice and Bob receive an input from a referee. Their goal is to compute the value of a function that depends on both of their inputs with the least amount of communication between them. In Part II we will introduce protocols in which the transmission of quantum bits (qubits), instead of bits, can reduce the amount of communication necessary to solve these problems. We also study how Alice and Bob can use quantum entanglement to solve two communication complexity problems without communicating something that can not be done classically. In Part III we study nonlocal games inspired by standard graph theory parameters. A nonlocal game is usually defined as a game in which players that can share and do computations in an entangled state have some sort of advantage over classical players. We begin this final part by introducing the quantum chromatic number of a graph, which is the minimal number of colors necessary in a nonlocal game in which Alice and Bob can convince a referee with certainty that they have a proper coloring of the graph. We end this thesis by introducing other two quantum graph parameters, one related to graph homomorphism and the other to the independence number of a graph.

Dec 12, 20220 citations

A hybrid-qudit representation of digital RGB images

Sreetama Das, Filippo Caruso

Quantum image processing is an emerging topic in the field of quantum information and technology. In this paper, we propose a new quantum image representation of RGB images with deterministic image retrieval, which is an improvement over all the similar existing representations in terms of using minimum resource. We use two entangled quantum registers constituting of total 7 qutrits to encode the color channels and their intensities. Additionally, we generalize the existing encoding methods by using both qubits and qutrits to encode the pixel positions of a rectangular image. This hybrid-qudit approach aligns well with the current progress of NISQ devices in incorporating higher dimensional quantum systems than qubits. We then describe the image encoding method using higher-order qubit-qutrit gates, and demonstrate the decomposition of these gates in terms of simpler elementary gates. We use the Google Cirq's quantum simulator to verify the image preparation in both the ideal noise-free scenario and in presence of realistic noise modelling. We show that the complexity of the image encoding process is linear in the number of pixels. Lastly, we discuss the image compression and some basic RGB image processing protocols using our representation.Quantum image processing is an emerging topic in the field of quantum information and technology. In this paper, we propose a new quantum image representation of RGB images with deterministic image retrieval, which is an improvement over all the similar existing representations in terms of using minimum resource. We use two entangled quantum registers constituting of total 7 qutrits to encode the color channels and their intensities. Additionally, we generalize the existing encoding methods by using both qubits and qutrits to encode the pixel positions of a rectangular image. This hybrid-qudit approach aligns well with the current progress of NISQ devices in incorporating higher dimensional quantum systems than qubits. We then describe the image encoding method using higher-order qubit-qutrit gates, and demonstrate the decomposition of these gates in terms of simpler elementary gates. We use the Google Cirq's quantum simulator to verify the image preparation in both the ideal noise-free scenario and in presence of realistic noise modelling. We show that the complexity of the image encoding process is linear in the number of pixels. Lastly, we discuss the image compression and some basic RGB image processing protocols using our representation.

arXiv:2207.12550Scientific ReportsAug 22, 202313 citations

Use of quantum teleport in fault tolerant quantum computing.

A. Santos Pereira

A Computação e a Criptografia Quântica tem sido campo de intenso estudo nas ultimas décadas. Contribuíram para isso o surgimento de esquemas para correção de erros através de códigos quânticos e procedimentos para construção de portas quânticas tolerantes a falhas. Também a utilização de espaços de estados quânticos arbitrários maiores que dois (qubit), tem recentemente se mostrado relevante para diminuição do custo na implementação em sistemas físicos de portas quânticas universais [1]. O teleporte quântico e uma técnica usada para deslocar estados quânticos de um lugar para outro, sem a necessidade de transmitir o sistema quântico que armazena a informação. Pode-se mostrar que esse procedimento constitui um ingrediente básico na construção de esquemas para proteção de erros. Assim o teleporte quântico surge como um recurso fundamental na área da comunicação quântica segura, e sua aplicabilidade, tem destaque na Teoria da Informação Quântica, nas áreas da Criptografia, Comunicação e Computação. O objetivo principal desse trabalho foi apresentar um esquema utilizando o teleporte quântico de dois qudits na construção de uma lógica clássica capaz de proteger portas quânticas generalizadas (dGxor) contra falhas, ou seja, contra eventuais erros de operações. Para esse fim, utilizam-se estados quânticos arbitrários (qudits) pertencentes ao espaço de Hilbert d-dimensional. O estudo teórico do espaço d-dimensional (d>2) tem se mostrado útil na construção de esquemas de codificação quântica de correção de erros. O esquema proposto aqui e uma generalização daquele apresentado por [2], o qual utiliza o teleporte quântico de dois qubits para construir uma porta quântica (C-NOT) tolerante a falhas operacionais.A Computação e a Criptografia Quântica tem sido campo de intenso estudo nas ultimas décadas. Contribuíram para isso o surgimento de esquemas para correção de erros através de códigos quânticos e procedimentos para construção de portas quânticas tolerantes a falhas. Também a utilização de espaços de estados quânticos arbitrários maiores que dois (qubit), tem recentemente se mostrado relevante para diminuição do custo na implementação em sistemas físicos de portas quânticas universais [1]. O teleporte quântico e uma técnica usada para deslocar estados quânticos de um lugar para outro, sem a necessidade de transmitir o sistema quântico que armazena a informação. Pode-se mostrar que esse procedimento constitui um ingrediente básico na construção de esquemas para proteção de erros. Assim o teleporte quântico surge como um recurso fundamental na área da comunicação quântica segura, e sua aplicabilidade, tem destaque na Teoria da Informação Quântica, nas áreas da Criptografia, Comunicação e Computação. O objetivo principal desse trabalho foi apresentar um esquema utilizando o teleporte quântico de dois qudits na construção de uma lógica clássica capaz de proteger portas quânticas generalizadas (dGxor) contra falhas, ou seja, contra eventuais erros de operações. Para esse fim, utilizam-se estados quânticos arbitrários (qudits) pertencentes ao espaço de Hilbert d-dimensional. O estudo teórico do espaço d-dimensional (d>2) tem se mostrado útil na construção de esquemas de codificação quântica de correção de erros. O esquema proposto aqui e uma generalização daquele apresentado por [2], o qual utiliza o teleporte quântico de dois qubits para construir uma porta quântica (C-NOT) tolerante a falhas operacionais.

Nov 25, 20110 citations

Quantum Communication of Images with 3-State Protocols

Yifan Hang

This paper investigates two distinct protocols and one combined protocol for image teleportation based on three quantum states. It begins by reviewing key linear algebraic concepts and formalized quantum states in Hilbert space. Building on this, it analyzes a variation of dense coding using non-maximally entangled (polluted) states. It demonstrates that while full distinguishability of four Bell-like states is lost under entanglement degradation, it is possible to design a restricted set of operations that maximizes distinguishability; it designs a new protocol of superdense coding based on three Bell states. In the next section of the article, it introduces a three-level energy system and designs a quantum teleportation protocol based on the three states. It also introduces the HSV color model, which features three parameters that are used to represent a color. With such a protocol, it can teleport a color with high confidence and security. Both of these protocols can be used for image teleportation technologies. Finally, it integrates the superdense coding protocol and the quantum teleportation protocol to create a highly theoretical image teleportation protocol that can perform filtering, encoding and decoding, and emergency destruction on colored images with enhanced security. An additional participant is added, so that the quantum state will be modified during the teleportation process by this new participant. All of these protocols can be applied in future image teleportation techniques.This paper investigates two distinct protocols and one combined protocol for image teleportation based on three quantum states. It begins by reviewing key linear algebraic concepts and formalized quantum states in Hilbert space. Building on this, it analyzes a variation of dense coding using non-maximally entangled (polluted) states. It demonstrates that while full distinguishability of four Bell-like states is lost under entanglement degradation, it is possible to design a restricted set of operations that maximizes distinguishability; it designs a new protocol of superdense coding based on three Bell states. In the next section of the article, it introduces a three-level energy system and designs a quantum teleportation protocol based on the three states. It also introduces the HSV color model, which features three parameters that are used to represent a color. With such a protocol, it can teleport a color with high confidence and security. Both of these protocols can be used for image teleportation technologies. Finally, it integrates the superdense coding protocol and the quantum teleportation protocol to create a highly theoretical image teleportation protocol that can perform filtering, encoding and decoding, and emergency destruction on colored images with enhanced security. An additional participant is added, so that the quantum state will be modified during the teleportation process by this new participant. All of these protocols can be applied in future image teleportation techniques.

Theoretical and Natural ScienceSep 15, 20260 citations

Efficient Algorithms for All Port-Based Teleportation Protocols

Adam Wills, Min-Hsiu Hsieh, Sergii Strelchuk

Port-based teleportation (PBT) is a form of quantum teleportation in which no corrective unitary is required on the part of the receiver. Two primary regimes exist—deterministic PBT in which teleportation is always successful, but is imperfect, and probabilistic PBT, in which teleportation succeeds with probability less than one, but teleportation is perfect upon a success. Two further regimes exist within each of these, in which the resource state used for the teleportation is fixed to a maximally entangled state or free to be optimized. Recent works have resolved the long-standing problem of efficiently implementing port-based teleportation, tackling the two deterministic cases for qudits. Here, we provide algorithms in all four regimes for qubits. Emphasis is placed on the practicality of these algorithms, where we give polynomial improvements in the known gate complexity for PBT, as well as an exponential improvement in the required number of ancillas (albeit in separate protocols). Our approach to the implementation of the square-root measurement in PBT can be directly generalized to other highly symmetric state ensembles. For certain families of states, such a framework yields efficient algorithms in the case in which the Petz-recovery algorithm for the square-root measurement runs in exponential time. Published by the American Physical Society 2024Port-based teleportation (PBT) is a form of quantum teleportation in which no corrective unitary is required on the part of the receiver. Two primary regimes exist—deterministic PBT in which teleportation is always successful, but is imperfect, and probabilistic PBT, in which teleportation succeeds with probability less than one, but teleportation is perfect upon a success. Two further regimes exist within each of these, in which the resource state used for the teleportation is fixed to a maximally entangled state or free to be optimized. Recent works have resolved the long-standing problem of efficiently implementing port-based teleportation, tackling the two deterministic cases for qudits. Here, we provide algorithms in all four regimes for qubits. Emphasis is placed on the practicality of these algorithms, where we give polynomial improvements in the known gate complexity for PBT, as well as an exponential improvement in the required number of ancillas (albeit in separate protocols). Our approach to the implementation of the square-root measurement in PBT can be directly generalized to other highly symmetric state ensembles. For certain families of states, such a framework yields efficient algorithms in the case in which the Petz-recovery algorithm for the square-root measurement runs in exponential time. Published by the American Physical Society 2024

arXiv:2311.12012PRX QuantumSep 20, 20244 citations

mathbb{C}^{4}

Clifford group, as well to understand the role of the basis of measurement in the quantum gate teleportation protocol. Considering the searching for universal entanglers, the same separability criterion of normal matrices was used as fitness function in a computational heuristics, in prder to find good candidates for universal entanglers in

mathbb{C}^{3} otimes mathbb{C}^{4}

and

mathbb{C}^{4} otimes mathbb{C}^{4}

Hilbert spaces. At last, in the connection of quantum information with the number theory, it is presented the study of the preparation and entanglement of several multi-qubit quantum states based in integer sequences, and the Riemannian quantum circuit, a quantum circuit whose eigenvalues are related to the zeros of the Riemann zeta function. The existence of such circuit proves that is always possible to construct a physical system related to a finite amount of zeros.