activity
20112022
most citedEfficient Quantum Network Communication using Optimized Entanglement-Swapping Trees

56 citations · 113 across the 8 of their papers we have counts for

collaborators

10 papers

cs.ET2022★ 1 cited

Distribution of Quantum Circuits Over General Quantum Networks

Ranjani G Sundaram, Himanshu Gupta, C. R. Ramakrishnan

Near-term quantum computers can hold only a small number of qubits. One way to facilitate large-scale quantum computations is through a distributed network of quantum computers. In…

quant-ph2022★ 21 cited

Pre-Distribution of Entanglements in Quantum Networks

Mohammad Ghaderibaneh, Himanshu Gupta, C. R. Ramakrishnan +1

Quantum network communication is challenging, as the No-Cloning theorem in quantum regime makes many classical techniques inapplicable. For long-distance communication, the only vi…

quant-ph2021★ 56 cited

Efficient Quantum Network Communication using Optimized Entanglement-Swapping Trees

Mohammad Ghaderibaneh, Caitao Zhan, Himanshu Gupta +1

Quantum network communication is challenging, as the No-cloning theorem in quantum regime makes many classical techniques inapplicable. For long-distance communication, the only vi…

cs.AI2019★ 1 cited

Value of Information in Probabilistic Logic Programs

Sarthak Ghosh, C. R. Ramakrishnan

In medical decision making, we have to choose among several expensive diagnostic tests such that the certainty about a patient's health is maximized while remaining within the boun…

cs.LO2018

Constraint-Based Inference in Probabilistic Logic Programs

Arun Nampally, Timothy Zhang, C. R. Ramakrishnan

Probabilistic Logic Programs (PLPs) generalize traditional logic programs and allow the encoding of models combining logical structure and uncertainty. In PLP, inference is perform…

cs.AI2016★ 2 cited

Inference in Probabilistic Logic Programs using Lifted Explanations

Arun Nampally, C. R. Ramakrishnan

In this paper, we consider the problem of lifted inference in the context of Prism-like probabilistic logic programming languages. Traditional inference in such languages involves…

cs.LO2016

XPL: An extended probabilistic logic for probabilistic transition systems

Andrey Gorlin, C. R. Ramakrishnan

Generalized Probabilistic Logic (GPL) is a temporal logic, based on the modal mu-calculus, for specifying properties of reactive probabilistic systems. We explore XPL, an extension…

cs.AI2014★ 6 cited

Adaptive MCMC-Based Inference in Probabilistic Logic Programs

Arun Nampally, C. R. Ramakrishnan

Probabilistic Logic Programming (PLP) languages enable programmers to specify systems that combine logical models with statistical knowledge. The inference problem, to determine th…

cs.AI2012★ 5 cited

Parameter Learning in PRISM Programs with Continuous Random Variables

Muhammad Asiful Islam, C. R. Ramakrishnan, I. V. Ramakrishnan

Probabilistic Logic Programming (PLP), exemplified by Sato and Kameya's PRISM, Poole's ICL, De Raedt et al's ProbLog and Vennekens et al's LPAD, combines statistical and logical kn…

cs.AI2011★ 21 cited

Inference in Probabilistic Logic Programs with Continuous Random Variables

Muhammad Asiful Islam, C. R. Ramakrishnan, I. V. Ramakrishnan

Probabilistic Logic Programming (PLP), exemplified by Sato and Kameya's PRISM, Poole's ICL, Raedt et al's ProbLog and Vennekens et al's LPAD, is aimed at combining statistical and…