A New Relation between post and pre-optimal measurement states

When an optimal measurement is made on a qubit and what we call an Unbiased Mixture of the resulting ensembles is taken, then the post measurement density matrix is shown to be related to the pre-measurement density matrix through a simple and linear relation. It is shown that such a relation holds only when the measurements are made in Mutually Unbiased Bases- MUB. For Spin-1/2 it is also shown explicitly that non-orthogonal measurements fail to give such a linear relation no matter how the ensembles are mixed. The result has been proved to be true for arbitrary quantum mechanical systems of finite dimensional Hilbert spaces. The result is true irrespective of whether the initial state is pure or mixed.Comment: 4 pages in REVTE

The generalized Kochen-Specker theorem

A proof of the generalized Kochen-Specker theorem in two dimensions due to Cabello and Nakamura is extended to all higher dimensions. A set of 18 states in four dimensions is used to give closely related proofs of the generalized Kochen-Specker, Kochen-Specker and Bell theorems that shed some light on the relationship between these three theorems.Comment: 5 pages, 1 Table. A new third paragraph and an additional reference have been adde

Hardness of Games and Graph Sampling

The work presented in this document is divided into two parts. The �rst part presents the hardness of games and the second part presents Graph sampling. Non-deterministic constraint logic[1] is used to prove the hardness of games. The games which are considered in this work is Reversi (2 player bounded game), Peg Solitaire (single player bounded game), Badland (single player bounded game). It also contains a theoretical study of peg solitaire on special graph classes. Reversi is proved to be PSPACE-Complete using Bounded 2CL, Peg Solitaire is proved to be NP-Complete using Bounded NCL. Badland is proved to be NP-Complete by a reduction from 3-SAT. The objective of study of peg solitaire of special graph classes is to �nd the maximum number of marbles we can remove from a fully �lled board, if the player is given the privilege to remove a marble from any cell initially, then following the rules after the initial move. The second part of the work is dedicated to graph sampling. Given a graph G, we try to sample a represen- tative subgraph Gs which is similar to the original graph G. The properties that are being studied are Degree Distribution, Clustering Coefficient, Average Shortest Path Length, Largest Connected Component Size. To measure the similarity between the original graph and sample we use the metrics Kolmogorov - Smirnov test and Kullback - Leibler divergence test. Tightly Induced Edge Sampling performs well on general graphs but it's performance decreases when the graph is a tree. Overall TIBFS and KARGER produces a sample which closely matches the distribution of original graphs.

An FPT algorithm for Matching Cut and d-cut

Given a positive integer $d$, the $d$-CUT problem is to decide if an undirected graph $G=(V,E)$ has a non trivial bipartition $(A,B)$ of $V$ such that every vertex in $A$ (resp. $B$) has at most $d$ neighbors in $B$ (resp. $A$). When $d=1$, this is the MATCHING CUT problem. Gomes and Sau, in IPEC 2019, gave the first fixed parameter tractable algorithm for $d$-CUT, when parameterized by maximum number of the crossing edges in the cut (i.e. the size of edge cut). However, their paper doesn't provide an explicit bound on the running time, as it indirectly relies on a MSOL formulation and Courcelle's Theorem. Motivated by this, we design and present an FPT algorithm for the MATCHING CUT (and more generally for $d$-CUT) for general graphs with running time $2^{O(k\log k)}n^{O(1)}$ where $k$ is the maximum size of the edge cut. This is the first FPT algorithm for the MATCHING CUT (and $d$-CUT) with an explicit dependence on this parameter. We also observe a lower bound of $2^{\Omega(k)}n^{O(1)}$ with same parameter for MATCHING CUT assuming ETH

Parameterized Complexity of Path Set Packing

In PATH SET PACKING, the input is an undirected graph $G$, a collection $\cal P$ of simple paths in $G$, and a positive integer $k$. The problem is to decide whether there exist $k$ edge-disjoint paths in $\cal P$. We study the parameterized complexity of PATH SET PACKING with respect to both natural and structural parameters. We show that the problem is $W[1]$-hard with respect to vertex cover plus the maximum length of a path in $\cal P$, and $W[1]$-hard respect to pathwidth plus maximum degree plus solution size. These results answer an open question raised in COCOON 2018. On the positive side, we show an FPT algorithm parameterized by feedback vertex set plus maximum degree, and also show an FPT algorithm parameterized by treewidth plus maximum degree plus maximum length of a path in $\cal P$. Both the positive results complement the hardness of PATH SET PACKING with respect to any subset of the parameters used in the FPT algorithms

On Polynomial Kernelization of H-free Edge Deletion

For a set H of graphs, the H-free Edge Deletion problem is to decide whether there exist at most k edges in the input graph, for some k∈N, whose deletion results in a graph without an induced copy of any of the graphs in H . The problem is known to be fixed-parameter tractable if H is of finite cardinality. In this paper, we present a polynomial kernel for this problem for any fixed finite set H of connected graphs for the case where the input graphs are of bounded degree. We use a single kernelization rule which deletes vertices ‘far away’ from the induced copies of every H∈H in the input graph. With a slightly modified kernelization rule, we obtain polynomial kernels for H-free Edge Deletion under the following three settings

Ultra-thin graphene–polymer heterostructure membranes

The fabrication of arrays of ultra-thin conductive membranes remains a major challenge in realising large-scale micro/nano-electromechanical systems (MEMS/NEMS), since processing-stress and stiction issues limit the precision and yield in assembling suspended structures. We present the fabrication and mechanical characterisation of a suspended graphene–polymer heterostructure membrane that aims to tackle the prevailing challenge of constructing high yield membranes with minimal compromise to the mechanical properties of graphene. The fabrication method enables suspended membrane structures that can be multiplexed over wafer-scales with 100% yield. We apply a micro-blister inflation technique to measure the in-plane elastic modulus of pure graphene and of heterostructure membranes with a thickness of 18 nm to 235 nm, which ranges from the 2-dimensional (2d) modulus of bare graphene at 173 ± 55 N m$^{-1}$ to the bulk elastic modulus of the polymer (Parylene-C) as 3.6 ± 0.5 GPa as a function of film thickness. Different ratios of graphene to polymer thickness yield different deflection mechanisms and adhesion and delamination effects which are consistent with the transition from a membrane to a plate model. This system reveals the ability to precisely tune the mechanical properties of ultra-thin conductive membranes according to their applications