Zobrazeno 1 - 10
of 517
pro vyhledávání: '"P., Soorya"'
Autor:
Pradeep, Soorya, Imran, Alishba, Liu, Ziwen, Theodoro, Taylla Milena, Hirata-Miyasaki, Eduardo, Ivanov, Ivan, Bhave, Madhura, Khadka, Sudip, Woosley, Hunter, Arias, Carolina, Mehta, Shalin B.
We introduce DynaCLR, a self-supervised framework for modeling cell dynamics via contrastive learning of representations of time-lapse datasets. Live cell imaging of cells and organelles is widely used to analyze cellular responses to perturbations.
Externí odkaz:
http://arxiv.org/abs/2410.11281
Autor:
R., Soorya Narayan, Adhikari, Susmita
We use a dimension reduction algorithm, Uniform Manifold Approximation and Projection (UMAP), to study dynamical structures inside a dark matter halo. We use a zoom-in simulation of a Milky Way mass dark matter halo, and apply UMAP on the 6 dimension
Externí odkaz:
http://arxiv.org/abs/2408.01220
In quantum computing, knowing the symmetries a given system or state obeys or disobeys is often useful. For example, Hamiltonian symmetries may limit allowed state transitions or simplify learning parameters in machine learning applications, and cert
Externí odkaz:
http://arxiv.org/abs/2407.17563
Publikováno v:
Phys. Rev. A 110, 052401 (2024)
A pure state of fixed Hamming weight is a superposition of computational basis states such that each bitstring in the superposition has the same number of ones. Given a Hilbert space of the form $\mathcal{H} = (\mathbb{C}_2)^{\otimes n}$, or an $n$-q
Externí odkaz:
http://arxiv.org/abs/2404.07151
With a view toward addressing the explosive growth in the computational demands of nuclear structure and reactions modeling, we develop a novel quantum algorithm for neutron-nucleus simulations with general potentials, which provides acceptable bound
Externí odkaz:
http://arxiv.org/abs/2402.14680
Autor:
Chen, Jingxuan, Westerheim, Hanna, Holmes, Zoë, Luo, Ivy, Nuradha, Theshani, Patel, Dhrumil, Rethinasamy, Soorya, Wang, Kathie, Wilde, Mark M.
Solving optimization problems is a key task for which quantum computers could possibly provide a speedup over the best known classical algorithms. Particular classes of optimization problems including semi-definite programming (SDP) and linear progra
Externí odkaz:
http://arxiv.org/abs/2312.03830
Autor:
Westerheim, Hanna, Chen, Jingxuan, Holmes, Zoë, Luo, Ivy, Nuradha, Theshani, Patel, Dhrumil, Rethinasamy, Soorya, Wang, Kathie, Wilde, Mark M.
The variational quantum eigensolver (VQE) is a hybrid quantum--classical variational algorithm that produces an upper-bound estimate of the ground-state energy of a Hamiltonian. As quantum computers become more powerful and go beyond the reach of cla
Externí odkaz:
http://arxiv.org/abs/2312.03083
Autor:
Tirtha Mandal, Soorya Gnanasegaran, Golding Rodrigues, Shalini Kashipathi, Anurag Tiwari, Ashvini Kumar Dubey, Sanghamitra Bhattacharjee, Yogendra Manjunath, Subith Krishna, M. S. Madhusudhan, Maloy Ghosh
Publikováno v:
BMC Cancer, Vol 24, Iss 1, Pp 1-22 (2024)
Abstract Background High levels of LLT1 expression have been found in several cancers, where it interacts with CD161 on NK cells to facilitate tumor immune escape. Targeting LLT1 could potentially relieve this inhibitory signal and enhance anti-tumor
Externí odkaz:
https://doaj.org/article/2711c1481c15447aa9107618730b296c
Testing the symmetries of quantum states and channels provides a way to assess their usefulness for different physical, computational, and communication tasks. Here, we establish several complexity-theoretic results that classify the difficulty of sy
Externí odkaz:
http://arxiv.org/abs/2309.10081
Publikováno v:
Quantum 8, 1366 (2024)
Quantifying entanglement is an important task by which the resourcefulness of a quantum state can be measured. Here, we develop a quantum algorithm that tests for and quantifies the separability of a general bipartite state by using the quantum steer
Externí odkaz:
http://arxiv.org/abs/2303.07911