Zobrazeno 1 - 10
of 7 559
pro vyhledávání: '"Pradhan, S."'
Quantum machine learning through variational quantum algorithms (VQAs) has gained substantial attention in recent years. VQAs employ parameterized quantum circuits, which are typically optimized using gradient-based methods. However, these methods of
Externí odkaz:
http://arxiv.org/abs/2407.13858
Autor:
DAS, A., PRADHAN, S. N.
Publikováno v:
Advances in Electrical and Computer Engineering, Vol 20, Iss 1, Pp 99-104 (2020)
Proposed work addresses the existing thermal problem of OR-XNOR based circuit by introducing design time thermal management technique at the logic level. The approach is used to reduce the peak temperature by eliminating local hotspots. In proposed
Externí odkaz:
https://doaj.org/article/2a42145d456249f9b97d03da6ea41ae5
We propose quantum soft covering problems for fully quantum channels and classical-quantum (CQ) channels using relative entropy as a criterion of operator closeness. We prove covering lemmas by deriving one-shot bounds on the rates in terms of smooth
Externí odkaz:
http://arxiv.org/abs/2402.11112
This work considers the non-interactive source simulation problem (NISS). In the standard NISS scenario, a pair of distributed agents, Alice and Bob, observe a distributed binary memoryless source $(X^d,Y^d)$ generated based on joint distribution $P_
Externí odkaz:
http://arxiv.org/abs/2402.00242
Publikováno v:
Gravitation and Cosmology, 29, 468-478, 2023
We have constructed a dark energy cosmological model in the framework of generalized Brans Dicke theory (GBD) with a self-interacting potential. The source of dark energy is considered through a unified dark fluid (UDF) characterized by a linear equa
Externí odkaz:
http://arxiv.org/abs/2308.11682
We propose a quantum soft-covering problem for a given general quantum channel and one of its output states, which consists in finding the minimum rank of an input state needed to approximate the given channel output. We then prove a one-shot quantum
Externí odkaz:
http://arxiv.org/abs/2306.12416
The reliability function of a channel is the maximum achievable exponential rate of decay of the error probability as a function of the transmission rate. In this work, we derive bounds on the reliability function of discrete memoryless multiple-acce
Externí odkaz:
http://arxiv.org/abs/2306.06796
We establish a coding theorem for rate-limited quantum-classical optimal transport systems with limited classical common randomness. This theorem characterizes the rate region of measurement protocols on a product source state for faithful constructi
Externí odkaz:
http://arxiv.org/abs/2305.10004