Source author record

Bibhas Adhikari

Bibhas Adhikari appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record

Catalog footprint

What is connected

19works
15topics
4close collaborators

Actions

Connect this record

Log in to claim

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

19 published item(s)

preprint2026arXiv

Qvine: Vine Structured Quantum Circuits for Loading High Dimensional Distributions

Loading high dimensional distributions is an important task for utilizing quantum computers on applications ranging from machine learning to finance. The high dimensionality leads to a curse of dimensionality, representing a d-dimensional distribution with k resolution requires dk qubits and an unstructured parameterized circuit would express a unitary in an exponential operator space in the number of qubits, leading to vanishing gradients and poor convergence guarantees even at high depth. Vine copula decompositions are widely used to represent high dimensional distributions classically, showing high quality approximation in many important applications, such as financial modeling. We present Qvine, a vine structured ansatz for quantum circuits, that mirrors the vine decomposition to construct scalable quantum circuits with efficient trainability while achieving similarly high quality approximation for amplitude encoding distributions. For regular vines (R-vines), we show that the circuit depth scales at most quadratic in the dimension of the distribution, while for D-vines, as well as many practical R-vines, the circuit depth scales linear in the dimension. For 3-dimensional and 4-dimensional Gaussians and empirical joint stock price return distributions for selected stocks, our experiments show Qvines achieve high quality loading.

preprint2022arXiv

Localization of two-dimensional quantum walks defined by generalized Grover coins

Localization phenomena of quantum walks makes the propagation dynamics of a walker strikingly different from that corresponding to classical random walks. In this paper, we study the localization phenomena of four-state discrete-time quantum walks on two-dimensional lattices with coin operators as one-parameter orthogonal matrices that are also permutative, a combinatorial structure of the Grover matrix. We show that the proposed walks localize at its initial position for canonical initial coin states when the coin belongs to classes which contain the Grover matrix that we consider in this paper, however, the localization phenomena depends on the coin parameter when the class of parametric coins does not contain the Grover matrix.

preprint2020arXiv

A model for the spread of an epidemic from local to global: A case study of COVID-19 in India

In this paper we propose an epidemiological model for the spread of COVID-19. The dynamics of the spread is based on four fundamental categories of people in a population: Tested and infected, Non-Tested but infected, Tested but not infected, and non-Tested and not infected. The model is based on two levels of dynamics of spread in the population: at local level and at the global level. The local level growth is described with data and parameters which include testing statistics for COVID-19, preventive measures such as nationwide lockdown, and the migration of people across neighboring locations. In the context of India, the local locations are considered as districts and migration or traffic flow across districts are defined by normalized edge weight of the metapopulation network of districts which are infected with COVID-19. Based on this local growth, state level predictions for number of people tested with COVID-19 positive are made. Further, considering the local locations as states, prediction is made for the country level. The values of the model parameters are determined using grid search and minimizing an error function while training the model with real data. The predictions are made based on the present statistics of testing, and certain linear and log-linear growth of testing at state and country level. Finally, it is shown that the spread can be contained if number of testing can be increased linearly or log-linearly by certain factors along with the preventive measures in near future. This is also necessary to prevent the sharp growth in the count of infected and to get rid of the second wave of pandemic.

preprint2020arXiv

On the eigenvalue region of permutative doubly stochastic matrices

This paper is devoted to the study of eigenvalue region of the doubly stochastic matrices which are also permutative, that is, each row of such a matrix is a permutation of any other row. We call these matrices as permutative doubly stochastic (PDS) matrices. A method is proposed to obtain symbolic representation of all PDS matrices of order $n$ by finding equivalence classes of permutationally similar symbolic PDS matrices. This is a hard problem in general as it boils down to finding all Latin squares of order $n.$ However, explicit symbolic representation of matrices in these classes are determined in this paper when $n=2, 3, 4.$ It is shown that eigenvalue regions are same for doubly stochastic matrices and PDS matrices when $n=2, 3.$ It is also established that this is no longer true for $n=4,$ and two line segments are determined which belong to the eigenvalue region of doubly stochastic matrices but not in the eigenvalue region of PDS matrices. Thus a conjecture is developed for the boundary of the eigenvalue region of PDS matrices of order $4.$ Finally, inclusion theorems for eigenvalue region of PDS matrices are proved when $n\geq 2.$

preprint2020arXiv

Perfect state transfer on hypercubes and its implementation using superconducting qubits

We propose a protocol for perfect state transfer between any pair of vertices in a hypercube. Given a pair of distinct vertices in the hypercube we determine a sub-hypercube that contains the pair of vertices as antipodal vertices. Then a switching process is introduced for determining the sub-hypercube of a memory enhanced hypercube that facilitates perfect state transfer between the desired pair of vertices. Furthermore, we propose a physical architecture for the pretty good state transfer implementation of our switching protocol with fidelity arbitrary close to unity, using superconducting transmon qubits with tunable couplings. The switching is realised by the control over the effective coupling between the qubits resulting from the effect of ancilla qubit couplers for the graph edges. We also report an error bound on the fidelity of state transfer due to faulty implementation of our protocol.

preprint2020arXiv

Periodicity of lively quantum walks on cycles with generalized Grover coin

In this paper we extend the study of three state lively quantum walks on cycles by considering the coin operator as a linear sum of permutation matrices, which is a generalization of the Grover matrix. First we provide a complete characterization of orthogonal matrices of order $3\times 3$ which are linear sum of permutation matrices. Consequently, we determine several groups of complex, real and rational orthogonal matrices. We establish that an orthogonal matrix of order $3\times 3$ is a linear sum of permutation matrices if and only if it is permutative. Finally we determine period of lively quantum walk on cycles when the coin operator belongs to the group of orthogonal (real) linear sum of permutation matrices.

preprint2020arXiv

Preserving spectral properties of structured matrices under structured perturbations

This paper is devoted to the study of preservation of eigenvalues, Jordan structure and complementary invariant subspaces of structured matrices under structured perturbations. Perturbations and structure-preserving perturbations are determined such that a perturbed matrix reproduces a given subspace as an invariant subspace and preserves a pair of complementary invariant subspaces of the unperturbed matrix. These results are further utilized to obtain structure-preserving perturbations which modify certain eigenvalues of a given structured matrix and reproduce a set of desired eigenvalues while keeping the Jordan chains unchanged. Moreover, a no spillover structured perturbation of a structured matrix is obtained whose rank is equal to the number of eigenvalues (including multiplicities) which are modified, and in addition, preserves the rest of the eigenvalues and the corresponding Jordan chains which need not be known. The specific structured matrices considered in this paper form Jordan and Lie algebra corresponding to an orthosymmetric scalar product.

preprint2020arXiv

Updating structured matrix pencils with no spillover effect on unmeasured spectral data and deflating pair

This paper is devoted to the study of perturbations of a matrix pencil, structured or unstructured, such that a perturbed pencil will reproduce a given deflating pair while maintaining the invariance of the complementary deflating pair. If the latter is unknown, it is referred to as no spillover updating. The specific structures considered in this paper include symmetric, Hermitian, $\star$-even, $\star$-odd and $\star$-skew-Hamiltonian/Hamiltonian pencils. This study is motivated by the well-known Finite Element Model Updating Problem in structural dynamics, where the given deflating pair represents a set of given eigenpairs and the complementary deflating pair represents the remaining larger set of eigenpairs. Analytical expressions of structure preserving no spillover updating are determined for deflating pairs of structured matrix pencils. Besides, parametric representations of all possible unstructured perturbations are obtained when the complementary deflating pair of a given unstructured pencil is known. In addition, parametric expressions are obtained for structured updating with certain desirable structures which relate to existing results on structure preservation of a symmetric positive definite or semi definite matrix pencil.

preprint2020arXiv

Why lockdown : On the spread of SARS-CoV-2 in India, a network approach

We analyze the time series data of number of districts or cities in India that are affected by COVID-19 from March 01, 2020 to April 17, 2020. We study the data in the framework of time series network data. The networks are defined by using the geodesic distances of the districts or cities specified by the latitude and longitude coordinates. We particularly restrict our analysis to all but districts in the north-eastern part of India. Unlike recent studies on the projection of the number of people infected with SARS-CoV-2 in the near future, in this note, the emphasis is on understanding the dynamics of the spread of the virus across the districts of India. We perform spectral and structural analysis of the model networks by considering several measures, notably the spectral radius, the algebraic connectivity, the average clustering coefficient, the average path length and the structure of the communities. Furthermore, we study the overall expansion properties given by the number of districts or cities before and after lockdown. These studies show that lockdown has a significant impact on the spread of SARS-CoV-2 in districts or cities over long distances. However, this impact is only observed after approximately two weeks of lockdown. We speculate that this happened due to the insufficient number of tests for COVID-19 before the lockdown which could not stop the movement of people infected with the virus but not detected, over long distances.

preprint2016arXiv

A graph theoretical approach to states and unitary operations

Building upon our previous work, on graphical representation of a quantum state by signless Laplacian matrix, we pose the following question. If a local unitary operation is applied to a quantum state, represented by a signless Laplacian matrix, what would be the corresponding graph and how does one implement local unitary transformations graphically? We answer this question by developing the notion of local unitary equivalent graphs. We illustrate our method by a few, well known, local unitary transformations implemented by single-qubit Pauli and Hadamard gates. We also show how graph switching can be used to implement the action of the CNOT gate, resulting in a graphical description of Bell state generation.

preprint2016arXiv

Bipartite separability and non-local quantum operations on graphs

In this paper we consider the separability problem for bipartite quantum states arising from graphs. Earlier it was proved that the degree criterion is the graph-theoretic counterpart of the familiar positive partial transpose criterion for separability, although there are entangled states with positive partial transpose for which the degree criterion fails. Here we introduce the concept of partially symmetric graphs and degree symmetric graphs by using the well-known concept of partial transposition of a graph and degree criteria, respectively. Thus, we provide classes of bipartite separable states of dimension $m \times n$ arising from partially symmetric graphs. We identify partially asymmetric graphs that lack the property of partial symmetry. We develop a combinatorial procedure to create a partially asymmetric graph from a given partially symmetric graph. We show that this combinatorial operation can act as an entanglement generator for mixed states arising from partially symmetric graphs.

preprint2016arXiv

Seidel switching for weighted multi-digraphs and its quantum perspective

Construction of graphs with equal eigenvalues (co-spectral graphs) is an interesting problem in spectral graph theory. Seidel switching is a well-known method for generating co-spectral graphs. From a matrix theoretic point of view, Seidel switching is a combined action of a number of unitary operations on graphs. Recent works [1] and [2] have shown significant connections between graph and quantum information theories. Corresponding to Laplacian matrices of any graph there are quantum states useful in quantum computing. From this point of view, graph theoretical problems are meaningful in the context of quantum information. This work describes Seidel switching from a quantum perspective. Here, we generalize Seidel switching to weighted directed graphs. We use it to construct graphs with equal Laplacian and signless Laplacian spectra and consider density matrices corresponding to them. Hence Seidel switching is a technique to generate cospectral density matrices. Next, we show that all the unitary operators used in Seidel switching are global unitary operators. Global unitary operators can be used to generate entanglement, a benchmark phenomena in quantum information processing.

preprint2015arXiv

A Complex Network Approach for Collaborative Recommendation

Collaborative filtering (CF) is the most widely used and successful approach for personalized service recommendations. Among the collaborative recommendation approaches, neighborhood based approaches enjoy a huge amount of popularity, due to their simplicity, justifiability, efficiency and stability. Neighborhood based collaborative filtering approach finds K nearest neighbors to an active user or K most similar rated items to the target item for recommendation. Traditional similarity measures use ratings of co-rated items to find similarity between a pair of users. Therefore, traditional similarity measures cannot compute effective neighbors in sparse dataset. In this paper, we propose a two-phase approach, which generates user-user and item-item networks using traditional similarity measures in the first phase. In the second phase, two hybrid approaches HB1, HB2, which utilize structural similarity of both the network for finding K nearest neighbors and K most similar items to a target items are introduced. To show effectiveness of the measures, we compared performances of neighborhood based CFs using state-of-the-art similarity measures with our proposed structural similarity measures based CFs. Recommendation results on a set of real data show that proposed measures based CFs outperform existing measures based CFs in various evaluation metrics.

preprint2015arXiv

Context dependent preferential attachment model for complex networks

In this paper, we propose a growing random complex network model, which we call context dependent preferential attachment model (CDPAM), when the preference of a new node to get attached to old nodes is determined by the local and global property of the old nodes. We consider that local and global properties of a node as the degree and relative average degree of the node respectively. We prove that the degree distribution of complex networks generated by CDPAM follow power law with exponent lies in the interval [2, 3] and the expected diameter grows logarithmically with the size of new nodes added in the initial small network. Numerical results show that the expected diameter stabilizes when alike weights to the local and global properties are assigned by the new nodes. Computing various measures including clustering coefficient, assortativity, number of triangles, algebraic connectivity, spectral radius, we show that the proposed model replicates properties of real networks better than BA model for all these measures when alike weights are given to local and global property. Finally, we observe that the BA model is a limiting case of CDPAM when new nodes tend to give large weight to the local property compared to the weight given to the global property during link formation.

preprint2015arXiv

Self-Coordinated Corona Graphs: a model for complex networks

Recently, real world networks having constant/shrinking diameter along with power-law degree distribution are observed and investigated in literature. Taking an inspiration from these findings, we propose a deterministic complex network model, which we call Self-Coordinated Corona Graphs (SCCG), based on the corona product of graphs. As it has also been established that self coordination/organization of nodes gives rise to emergence of power law in degree distributions of several real networks, the networks in the proposed model are generated by the virtue of self coordination of nodes in corona graphs. Alike real networks, the SCCG inherit motifs which act as the seed graphs for the generation of SCCG. We also analytically prove that the power law exponent of SCCG is approximately $2$ and the diameter of SCCG produced by a class of motifs is constant. Finally, we compare different properties of the proposed model with that of the BA and Pseudofractal scale-free models for complex networks.

preprint2015arXiv

Structural and Spectral properties of Corona Graphs

Product graphs have been gainfully used in literature to generate mathematical models of complex networks which inherit properties of real networks. Realizing the duplication phenomena imbibed in the definition of corona product of two graphs, we define Corona graphs. Given a small simple connected graph which we call seed graph, Corona graphs are defined by taking corona product of a seed graph iteratively. We show that the cumulative degree distribution of Corona graphs decay exponentially when the seed graph is regular and cumulative betweenness distribution follows power law when seed graph is a clique. We determine explicit formulae of eigenvalues, Laplacian eigenvalues and signless Laplacian eigenvalues of Corona graphs when the seed graph is regular. Computable expressions of eigenvalues and signless Laplacian eigenvalues of Corona graphs are also obtained when the seed graph is a star graph.

preprint2015arXiv

Structured inverse least-squares problem for structured matrices

Given a pair of matrices X and B and an appropriate class of structured matrices S, we provide a complete solution of the structured inverse least-squares problem $min_{A\in_S} \|AX-B\|_F$. Indeed, we determine all solutions of the structured inverse least squares problem as well as those solutions which have the smallest norm. We show that there are infinitely many smallest norm solutions of the least squares problem for the spectral norm whereas the smallest norm solution is unique for the Frobenius norm.

preprint2013arXiv

Structured mapping problems for linearly structured matrices

Given an appropriate class of structured matrices S; we characterize matrices X and B for which there exists a matrix A \in S such that AX = B and determine all matrices in S mapping X to B. We also determine all matrices in S mapping X to B and having the smallest norm. We use these results to investigate structured backward errors of approximate eigenpairs and approximate invariant subspaces, and structured pseudospectra of structured matrices.