This article explores the performance of quantum communication systems in the presence of noise and focuses on finding the optimal encoding for maximizing the classical communication rate, approaching the classical capacity in some scenarios. Instead of theoretically bounding the ultimate capacity of the channel, we adopt a signal processing perspective to estimate the achievable performance […]
We implement a simulation of a quantum field theory in 1+1 space–time dimensions on a gate-based quantum computer using the light-front formulation of the theory. The nonperturbative simulation of the Yukawa model field theory is verified on IBM’s simulator and is also demonstrated on a small-scale IBM circuit-based quantum processor, on the cloud, using IBM […]
Quantum walks play an important role for developing quantum algorithms and quantum simulations. Here, we introduce a first of its kind one-dimensional lazy quantum walk in the ternary quantum domain and show its equivalence for circuit realization in ternary quantum logic. Using an appropriate logical mapping of the position space on which a walker evolves […]
Algorithms for triangle finding, the smallest nontrivial instance of the k -clique problem, have been proposed for quantum computers. Still, those algorithms assume the use of fixed access time quantum RAM. In this article, we present a practical gate-based approach to both the triangle-finding problem and its NP-hard k -clique generalization. We examine both constant factors for near-term implementation […]