ComputingNotes

Learning Joint Detection, Equalization and Decoding for Short-Packet Communications – Paper Notes

by ComputingNotes
S. Dörner, J. Clausius, S. Cammerer, and S. ten Brink, “Learning Joint Detection, Equalization and Decoding for Short-Packet Communications,” IEEE Transactions on Communications, vol. 71, no. 2, pp. 837–850, Feb. 2023, doi: 10.1109/TCOMM.2022.3228648. A machine learning-based approach for joint detection, synchronization, equalization, and decoding in short-packet wireless communications, where messages must first be detected before ... Read More

Quantum Computing Fundamentals – Multiple Qubits

by ComputingNotes
Book source: Quantum Computation and Quantum Information by Michael A. Nielsen and Isaac L. Chuang Similar to classical qubits, 2 qubit systems have 4 computational basis states. One of the important state is Bell State. Correlation in measurements of qubits in bell state.

Quantum Computing Fundamentals – Qubits

by ComputingNotes
Source book: Quantum Computation and Quantum Information, Michael A. Neilsen and Isaac L. Chuang Analogy between classical bit and quantum bit (qubit).Classical bit has 0 or 1 value whereas qubit can have state $|0\rangle$ or $|1\rangle$ along with linear combination ot those states (superposition). While classical bit can be measured deterministically with value either 0 ... Read More

Quantum Computing – Fundamental Concepts

by ComputingNotes
Nielsen, M. A., & Chuang, I. L. (2010). Quantum computation and quantum information. Cambridge university press. Key events in the field of quantum computation are, occurance of various crises in physics such as “ultraviolet catastrophe” in twentieth century with modern theory of quantum quantum mechanics starting in 1920s. Various other crucial algorithms are no-cloning theorem, Turing ... Read More

Quantum Computing – Notations and Terms

by ComputingNotes
Nielsen, M. A., & Chuang, I. L. (2010). Quantum computation and quantum information. Cambridge university press. Linear Algebra plays crucial part in understanding and representing quantum computing concepts. Some of the most frequent used quantum gates are hadamard, pauli X, Y, Z, etc.

Calculus – Rate of Change and Limit

by ComputingNotes
Finney, R. L., Giordano, F. R., Weir, M. D., Thomas, G. B., Jr., & Calculus and analytic geometry. (2001). Thomas’ calculus (Tenth edition / based on the original work by George B. Thomas, Jr.,as revised by Ross L. Finney, Maurice D. Weir, and Frank R. Giordano.). Addison-Wesley. Average rate of change of function $y=f(x)$ is given by ... Read More

Calculus – Functions

by ComputingNotes
Finney, R. L., Giordano, F. R., Weir, M. D., Thomas, G. B., Jr., & Calculus and analytic geometry. (2001). Thomas’ calculus (Tenth edition / based on the original work by George B. Thomas, Jr.,as revised by Ross L. Finney, Maurice D. Weir, and Frank R. Giordano.). Addison-Wesley. y is called the function of x if, $y = ... Read More

News – Google’s Quantum Advantage Oct 23 2025

by ComputingNotes
A verifiable quantum advantage https://research.google/blog/a-verifiable-quantum-a dvantagehttps://www.theguardian.com/technology/2025/oct/22/google-hails-breakthrough-as-quantum-computer-surpasses-ability-of-supercomputersGoogle unveils quantum computing breakthrough on Willow chiphttps://www.afr.com/technology/google-unveils-quantum-computing-breakthrough-on-willow-chip-20251023-p5n4m8Google claims ‘quantum advantage’ again — but researchers are scepticalhttps://www.nature.com/articles/d41586-025-03300-4Observation of constructive interference at the edge of quantum ergodicityhttps://www.nature.com/articles/s41586-025-09526-6 Key Claims: D. A. Abanin, “Observation of constructive interference at the edge of quantum ergodicity”.

Quantum Computing – Gates Basics

by ComputingNotes
C. P. Williams, Explorations in Quantum Computing. in Texts in Computer Science. London: Springer, 2011. doi: 10.1007/978-1-84628-887-6. Defining a unitary matrix, where $U^{-1} = U^\dagger $ (inverse equals its conjugate transpose). Pauli matrices: $1 = \begin{pmatrix} 1 & 0 \\ 0 & 1 \end{pmatrix}$ $X = \begin{pmatrix} 0 & 1 \\ 1 & 0 \end{pmatrix}$ ... Read More
error: