1 citations · 2 across the 6 of their papers we have counts for
6 papers
Quantum simulation of perfect state transfer on weighted cubelike graphs
Jaideep Mulherkar, Rishikant Rajdeepak, V. Sunitha
A continuous-time quantum walk on a graph evolves according to the unitary operator , where is the adjacency matrix of the graph. Perfect state transfer (PST) in a qu…
Embedding perfectly balanced 2-caterpillar into its optimal hypercube
Rishikant Rajdeepak, V. Sunitha
A long-standing conjecture on spanning trees of a hypercube states that a balanced tree on vertices with maximum degree at most spans the hypercube of dimension \cite…
Perfect State Transfer in Weighted Cubelike Graphs
Jaideep Mulherkar, Rishikant Rajdeepak, V. Sunitha
A continuous-time quantum random walk describes the motion of a quantum mechanical particle on an underlying graph. The graph itself is associated with a Hilbert space of dimension…
Implementation of hitting times of discrete time quantum random walks on Cubelike graphs
Jaideep Mulherkar, Rishikant Rajdeepak, V Sunitha
We demonstrate an implementation of the hitting time of a discrete time quantum random walk on cubelike graphs using IBM's Qiskit platform. Our implementation is based on efficient…
Capacity of a quantum memory channel correlated by matrix product states
Jaideep Mulherkar, V. Sunitha
We study the capacity of a quantum channel where channel acts like controlled phase gate with the control being provided by a one-dimensional quantum spin chain environment. Due to…
Labelling vertices to ensure adjacency coincides with disjointness
Mahipal Jadeja, Rahul Muthu, Sunitha V
Given a set of nonempty subsets of some universal set, their intersection graph is defined as the graph with one vertex for each set and two vertices are adjacent precisely when th…