Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

CRC Press eBooks

Chapter 6 Photonics in Transform Domain Information Processing

Published Nov 25, 2016• 0 citations
Publisher
DOI
10.1201/9781315373072-7

Related papers

Photonics in Transform Domain Information Processing

Asit Kumar Datta, Soumika Munshi

CRC Press eBooks•Nov 25, 2016•0 citations

Photonics in Information Processing

M.r. Chalasinska-Macukow, Jerzy A. Dobrowolski, Hugo Thienpont A

•Jan 1, 2000•0 citations

Fast Transforms in Quantum Computation

Artyom M. Grigoryan, Sos S. Agaian

This chapter discusses quantum fast transforms that play a key role in the development of image processing techniques. It describes concepts of the discrete paired, Hadamard, and Fourier transforms and their circuits in quantum computation. The chapter focuses on the discrete paired transform, which is a core of the N-point discrete Hadamard and Fourier transforms. It also describes the simple quantum schemes for calculation of the paired transform and presents the method of implementation of the classical diagram for the circular convolution in the frequency domain. The chapter explains the analytical and matrix representations of the discrete Hadamard transform. It details the circuits for calculating quantum Fourier transform, which are based on the paired transform-based splitting. The N-point discrete Fourier transform is considered in the traditional form which is used in signal and image processing.

Wiley eBooks•Feb 10, 2025•0 citations

Mathematical Foundations of Adaptive Quantum Processing

Daniel Bonior

Quantum information has the potential to revolutionize the way we store, process, transfer and acquire information [1,14,15,21,37]. In particular, quantum information offers exciting new approaches to secure communication, computation and sensing. However, in order to realize such technologies, we must first understand the effect that environmental noise has on a quantum system. This dissertation builds upon recent studies that have explored the underlying structure of quantum information and the effects of qubit channels in quantum communication protocols. This work is divided into five main chapters, with Chapter 1 being a brief introduction to quantum information. We then begin Chapter 2 by defining the error function for our qubit communication protocols. From there we explore the properties of our error functions and the topological space that they form. In Chapter 3 we consider the newly patented process Adaptive Quantum Information Processing, patent number US9838141 B2; originally outlined by Martin in [23]. We restate the adaptive scheme and exemplify its application through the Prepare and Send Protocol and Quantum Key Distribution. Applying our results from Chapter 2, we obtain an expression for the adaptability of unital channels in these two protocols and classify the channels that admit the most improvement. We dedicate Chapter 4 to the derivation of gravitational noise, and show that in certain circumstances gravity results in a channel that can be maximally improved in Adaptive QKD [3,14,16]. Lastly, we study the set of error functions through the lens of domain theory. Domain theory is a subset of mathematics that was developed in order to rigorously formalize computations. The first four chapters are all consequences of past discoveries in the mathematical structure of quantum channels. In Chapter 5 we characterize the set of error functions through domain theory, extending the mathematical foundations of quantum information. [12,18,20, 22, 23,25].

Journal of International Crisis and Risk Communication Research•Jan 1, 2018•0 citations

Information Encoding and Retrieval in Photonic Systems

Yechi Ma

•Jan 1, 2020•1 citation

Delving into the Basics of QC

M M Anishin Raj, Varghese S. Chooralil, Sebastian Terance +2 more

Data is the most essential component of information systems which is represented by classical bit of data such as 0 and 1 in conventional computing machines. These machines execute binary operations to implement classical algorithms for providing solutions for the tasks in a specific domain. Data manipulation techniques are mostly utilized; their main operators are arithmetic, boolean, logical, and relational operators. At this modern juncture, there is a huge transformation on data bit processing using quantum computing (QC) techniques. QC is the most powerful technique which utilizes the principles of quantum mechanics to solve complex problems. There is a global stakes and conceivable progress in the domain of quantum technology effectively for data collection and communication, algorithm execution, and numerous levels of application domains with use cases. The computation speed of quantum machines is increasing enormously when compared to traditional machines. This chapter presents various fundamental concepts of QC, the structure of qubit and its representation, and core operations such as superposition and entanglement. In addition to quantum gates and circuits, the chapter examines various quantum operations that manipulate qubits to perform sophisticated computations beyond what classical computers are capable of. Upon completion of this chapter, the readers will have a solid understanding of quantum computation's foundational mechanics and an appreciation for its revolutionary potential for various domains such as information security, optimization, and artificial intelligence.

Wiley eBooks•May 22, 2026•0 citations
This chapter discusses quantum fast transforms that play a key role in the development of image processing techniques. It describes concepts of the discrete paired, Hadamard, and Fourier transforms and their circuits in quantum computation. The chapter focuses on the discrete paired transform, which is a core of the N-point discrete Hadamard and Fourier transforms. It also describes the simple quantum schemes for calculation of the paired transform and presents the method of implementation of the classical diagram for the circular convolution in the frequency domain. The chapter explains the analytical and matrix representations of the discrete Hadamard transform. It details the circuits for calculating quantum Fourier transform, which are based on the paired transform-based splitting. The N-point discrete Fourier transform is considered in the traditional form which is used in signal and image processing.
Quantum information has the potential to revolutionize the way we store, process, transfer and acquire information [1,14,15,21,37]. In particular, quantum information offers exciting new approaches to secure communication, computation and sensing. However, in order to realize such technologies, we must first understand the effect that environmental noise has on a quantum system. This dissertation builds upon recent studies that have explored the underlying structure of quantum information and the effects of qubit channels in quantum communication protocols. This work is divided into five main chapters, with Chapter 1 being a brief introduction to quantum information. We then begin Chapter 2 by defining the error function for our qubit communication protocols. From there we explore the properties of our error functions and the topological space that they form. In Chapter 3 we consider the newly patented process Adaptive Quantum Information Processing, patent number US9838141 B2; originally outlined by Martin in [23]. We restate the adaptive scheme and exemplify its application through the Prepare and Send Protocol and Quantum Key Distribution. Applying our results from Chapter 2, we obtain an expression for the adaptability of unital channels in these two protocols and classify the channels that admit the most improvement. We dedicate Chapter 4 to the derivation of gravitational noise, and show that in certain circumstances gravity results in a channel that can be maximally improved in Adaptive QKD [3,14,16]. Lastly, we study the set of error functions through the lens of domain theory. Domain theory is a subset of mathematics that was developed in order to rigorously formalize computations. The first four chapters are all consequences of past discoveries in the mathematical structure of quantum channels. In Chapter 5 we characterize the set of error functions through domain theory, extending the mathematical foundations of quantum information. [12,18,20, 22, 23,25].
Data is the most essential component of information systems which is represented by classical bit of data such as 0 and 1 in conventional computing machines. These machines execute binary operations to implement classical algorithms for providing solutions for the tasks in a specific domain. Data manipulation techniques are mostly utilized; their main operators are arithmetic, boolean, logical, and relational operators. At this modern juncture, there is a huge transformation on data bit processing using quantum computing (QC) techniques. QC is the most powerful technique which utilizes the principles of quantum mechanics to solve complex problems. There is a global stakes and conceivable progress in the domain of quantum technology effectively for data collection and communication, algorithm execution, and numerous levels of application domains with use cases. The computation speed of quantum machines is increasing enormously when compared to traditional machines. This chapter presents various fundamental concepts of QC, the structure of qubit and its representation, and core operations such as superposition and entanglement. In addition to quantum gates and circuits, the chapter examines various quantum operations that manipulate qubits to perform sophisticated computations beyond what classical computers are capable of. Upon completion of this chapter, the readers will have a solid understanding of quantum computation's foundational mechanics and an appreciation for its revolutionary potential for various domains such as information security, optimization, and artificial intelligence.