total 195took 0.11s

On uniqueness of P-twistsNov 17 2017Jun 23 2018We prove that for any $\mathbb{P}^n$-functor $F$, split or non-split, all the convolutions (double cones) of the three-term complex $FHR \rightarrow FR \rightarrow$ Id defining its $\mathbb{P}$-twist are isomorphic.

Exotic t-structures for two-block Springer fibersFeb 02 2016We study the exotic t-structure on the derived category of coherent sheaves on two-block Springer fibre (i.e. for a nilpotent matrix of type (m+n,n) in type A). The exotic t-structure has been defined by Bezrukavnikov and Mirkovic for Springer theoretic ... More

$\mathbb{P}^n$-functorsMay 14 2019We propose a new theory of (non-split) P^n-functors. These are F: A -> B for which the adjunction monad RF is a repeated extension of Id_A by powers of an autoequivalence H and three conditions are satisfied: the monad condition, the adjoints condition, ... More

Stability conditions for Slodowy slices and real variations of stabilityAug 07 2011Dec 18 2014We provide examples of an explicit submanifold in Bridgeland stabilities space of a local Calabi-Yau, and propose a new variant of definition of stabilities on a triangulated category, which we call a "real variation of stability conditions". We discuss ... More

Multiplicative structure on the Hochschild cohomology of crossed product algebrasNov 15 2005Dec 08 2005Consider a smooth affine algebraic variety $X$ over an algebraically closed field, and let a finite group $G$ act on it. We assume that the characteristic of the field is greater than the dimension of $X$ and the order of $G$. An explicit formula for ... More

Spherical functorsNov 28 2007Sep 25 2013This paper has been withdrawn and replaced by arXiv:1309.5035. In this paper we describe some examples of so called spherical functors between triangulated categories, which generalize the notion of a spherical object. We also give sufficient conditions ... More

Affine tangles and irreducible exotic sheavesFeb 07 2008Feb 05 2016We construct a weak representation of the category of framed affine tangles on a disjoint union of triangulated categories ${\mathcal D}_{2n}$. The categories we use are that of coherent sheaves on Springer fibers over a nilpotent element of $sl_{2n}$ ... More

On adjunctions for Fourier-Mukai transformsApr 18 2010Aug 16 2012We show that the adjunction counits of a Fourier-Mukai transform $\Phi$ from $D(X_1)$ to $D(X_2)$ arise from maps of the kernels of the corresponding Fourier-Mukai transforms. In a very general setting of proper separable schemes of finite type over a ... More

Spherical DG-functorsSep 19 2013Oct 19 2015For two DG-categories A and B we define the notion of a spherical Morita quasi-functor A -> B. We construct its associated autoequivalences: the twist T of D(B) and the co-twist F of D(A). We give powerful sufficiency criteria for a quasi-functor to be ... More

Bar category of modules and homotopy adjunction for tensor functorsDec 30 2016Jul 31 2018Given a DG-category A we introduce the bar category of modules Modbar(A). It is a DG-enhancement of the derived category D(A) of A which is isomorphic to the category of DG A-modules with A-infinity morphisms between them. However, it is defined intrinsically ... More

Orthogonally spherical objects and spherical fibrationsNov 02 2010Oct 19 2015We introduce a relative version of the spherical objects of Seidel and Thomas. Define an object E in the derived category D(Z x X) to be spherical over Z if the corresponding functor from D(Z) to D(X) gives rise to autoequivalences of D(Z) and D(X) in ... More

Bucket Elimination: A Unifying Framework for Several Probabilistic InferenceFeb 13 2013Probabilistic inference algorithms for finding the most probable explanation, the maximum aposteriori hypothesis, and the maximum expected utility and for updating belief are reformulated as an elimination--type algorithm called bucket elimination. This ... More

A non-expert view on Turing machines, Proof Verifiers, and Mental reasoningOct 30 2010Mar 01 2012The paper explores known results related to the problem of identifying if a given program terminates on all inputs -- this is a simple generalization of the halting problem. We will see how this problem is related and the notion of proof verifiers. We ... More

Can Knowledge be preserved in the long run?Nov 09 2010Feb 06 2011Can (scientific) knowledge be reliably preserved over the long term? We have today very efficient and reliable methods to encode, store and retrieve data in a storage medium that is fault tolerant against many types of failures. But does this guarantee ... More

Entropy based Nearest Neighbor Search in High DimensionsOct 07 2005Nov 04 2005In this paper we study the problem of finding the approximate nearest neighbor of a query point in the high dimensional space, focusing on the Euclidean space. The earlier approaches use locality-preserving hash functions (that tend to map nearby points ... More

A Differential Equations Approach to Optimizing Regret Trade-offsMay 07 2013We consider the classical question of predicting binary sequences and study the {\em optimal} algorithms for obtaining the best possible regret and payoff functions for this problem. The question turns out to be also equivalent to the problem of optimal ... More

Hexadecapole fluctuation mechanism for s-wave heavy fermion superconductor CeCu2Si2: Interplay between intra- and inter-orbital Cooper pairsFeb 28 2019In heavy-fermion superconductors, it is widely believed that the superconducting gap function has sign-reversal due to the strong electron correlation. However, recently discovered fully-gapped s-wave superconductivity in CeCu2Si2 has clarified that strong ... More

Bounding Search Space Size via (Hyper)tree DecompositionsJun 13 2012This paper develops a measure for bounding the performance of AND/OR search algorithms for solving a variety of queries over graphical models. We show how drawing a connection to the recent notion of hypertree decompositions allows to exploit determinism ... More

Fast-rate and optimistic-rate error bounds for L1-regularized regressionAug 01 2011We consider the prediction error of linear regression with L1 regularization when the number of covariates p is large relative to the sample size n. When the model is k-sparse and well-specified, and restricted isometry or similar conditions hold, the ... More

Supercurrent-induced Skyrmion dynamics and Tunable Weyl points in Chiral Magnet with SuperconductivityJul 08 2016Aug 25 2016Recent studies show superconductivity provides new perspectives on spintronics. We study a heterostructure composed of an s-wave superconductor and a cubic chiral-magnet that can stabilize a topological spin texture, a skyrmion. We propose a supercurrent-induced ... More

Shape recognition of volcanic ash by simple convolutional neural networkJun 22 2017Shape analyses of tephra grains result in understanding eruption mechanism of volcanoes. However, we have to define and select parameter set such as convexity for the precise discrimination of tephra grains. Selection of the best parameter set for the ... More

Sparse Matrix FactorizationNov 13 2013May 13 2014We investigate the problem of factorizing a matrix into several sparse matrices and propose an algorithm for this under randomness and sparsity assumptions. This problem can be viewed as a simplification of the deep learning problem where finding a factorization ... More

Self-rotation and synchronization in exciton-polariton condensatesJun 24 2016Self-rotation occurs in an exciton-polariton condensate in a two-dimensional semiconductor microcavity pumped by a nonresonant Gaussian laser beam. A wave packet of the condensate spontaneously rotates around the center of the pumped region at a constant ... More

On finding minimal w-cutsetJul 11 2012The complexity of a reasoning task over a graphical model is tied to the induced width of the underlying graph. It is well-known that the conditioning (assigning values) on a subset of variables yields a subproblem of the reduced complexity where instantiated ... More

Cutset Sampling with Likelihood WeightingJun 27 2012The paper analyzes theoretically and empirically the performance of likelihood weighting (LW) on a subset of nodes in Bayesian networks. The proposed scheme requires fewer samples to converge due to reduction in sampling variance. The method exploits ... More

AND/OR Importance SamplingJun 13 2012The paper introduces AND/OR importance sampling for probabilistic graphical models. In contrast to importance sampling, AND/OR importance sampling caches samples in the AND/OR space and then extracts a new sample mean from the stored samples. We prove ... More

A Scheme for Approximating Probabilistic InferenceFeb 06 2013This paper describes a class of probabilistic approximation algorithms based on bucket elimination which offer adjustable levels of accuracy and efficiency. We analyze the approximation for several tasks: finding the most probable explanation, belief ... More

A Complete Anytime Algorithm for TreewidthJul 11 2012In this paper, we present a Branch and Bound algorithm called QuickBB for computing the treewidth of an undirected graph. This algorithm performs a search in the space of perfect elimination ordering of vertices of the graph. The algorithm uses novel ... More

AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Weighted Graphical ModelsJun 20 2012Compiling graphical models has recently been under intense investigation, especially for probabilistic modeling and processing. We present here a novel data structure for compiling weighted graphical models (in particular, probabilistic models), called ... More

Revisiting the Examination Hypothesis with Query Specific Position BiasMar 12 2010Click through rates (CTR) offer useful user feedback that can be used to infer the relevance of search results for queries. However it is not very meaningful to look at the raw click through rate of a search result because the likelihood of a result being ... More

Criticality in the Quantum Kicked Rotor with a Smooth PotentialAug 13 2008We investigate the possibility of an Anderson type transition in the quantum kicked rotor with a smooth potential due to dynamical localization of the wavefunctions. Our results show the typical characteristics of a critical behavior i.e multifractal ... More

Prediction strategies without lossAug 22 2010Oct 10 2012Consider a sequence of bits where we are trying to predict the next bit from the previous bits. Assume we are allowed to say 'predict 0' or 'predict 1', and our payoff is +1 if the prediction is correct and -1 otherwise. We will say that at each point ... More

Learning Two layer Networks with Multinomial Activation and High ThresholdsMar 21 2019Giving provable guarantees for learning neural networks is a core challenge of machine learning theory. Most prior work gives parameter recovery guarantees for one hidden layer networks. In this work we study a two layer network where the top node instead ... More

A Simple Insight into Iterative Belief Propagation's SuccessOct 19 2012In Non - ergodic belief networks the posterior belief OF many queries given evidence may become zero.The paper shows that WHEN belief propagation IS applied iteratively OVER arbitrary networks(the so called, iterative OR loopy belief propagation(IBP)) ... More

An Empirical Study of w-Cutset Sampling for Bayesian NetworksOct 19 2012The paper studies empirically the time-space trade-off between sampling and inference in a sl cutset sampling algorithm. The algorithm samples over a subset of nodes in a Bayesian network and applies exact inference over the rest. Consequently, while ... More

The Relationship Between AND/OR Search and Variable EliminationJul 04 2012In this paper we compare search and inference in graphical models through the new framework of AND/OR search. Specifically, we compare Variable Elimination (VE) and memoryintensive AND/OR Search (AO) and place algorithms such as graph-based backjumping ... More

Identifying Independencies in Causal Graphs with FeedbackFeb 13 2013We show that the d -separation criterion constitutes a valid test for conditional independence relationships that are induced by feedback systems involving discrete variables.

Mini-Bucket Heuristics for Improved SearchJan 23 2013The paper is a second in a series of two papers evaluating the power of a new scheme that generates search heuristics mechanically. The heuristics are extracted from an approximation scheme called mini-bucket elimination that was recently introduced. ... More

The Mind Grows CircuitsMar 01 2012Mar 17 2012There is a vast supply of prior art that study models for mental processes. Some studies in psychology and philosophy approach it from an inner perspective in terms of experiences and percepts. Others such as neurobiology or connectionist-machines approach ... More

Extended Bayesian Information Criteria for Gaussian Graphical ModelsNov 30 2010Gaussian graphical models with sparsity in the inverse covariance matrix are of significant interest in many modern applications. For the problem of recovering the graphical structure, information criteria provide useful optimization objectives for algorithms ... More

Bayesian model choice and information criteria in sparse generalized linear modelsDec 23 2011We consider Bayesian model selection in generalized linear models that are high-dimensional, with the number of covariates p being large relative to the sample size n, but sparse in that the number of active covariates is small compared to p. Treating ... More

Exact block-wise optimization in group lasso and sparse group lasso for linear regressionOct 16 2010Nov 11 2010The group lasso is a penalized regression method, used in regression problems where the covariates are partitioned into groups to promote sparsity at the group level. Existing methods for finding the group lasso estimator either use gradient projection ... More

Escher degree of non-periodic L-tilings by 2 prototilesFeb 21 2012For a given tiling of the euclidean plane ${\bf E}^2$, we call the degree of freedom of perturbed edges of prototiles {\it escher degree}. In this paper we consider non-periodic L-tilings by 2 prototiles and obtain the escher degree of them.

Accumulation tests for FDR control in ordered hypothesis testingMay 27 2015Jun 25 2016Multiple testing problems arising in modern scientific applications can involve simultaneously testing thousands or even millions of hypotheses, with relatively few true signals. In this paper, we consider the multiple testing problem where prior information ... More

High-dimensional Ising model selection with Bayesian information criteriaMar 13 2014Mar 05 2015We consider the use of Bayesian information criteria for selection of the graph underlying an Ising model. In an Ising model, the full conditional distributions of each variable form logistic regression models, and variable selection techniques for regression ... More

Multiphoton Quantum Optics and Quantum State EngineeringJan 09 2007We present a review of theoretical and experimental aspects of multiphoton quantum optics. Multiphoton processes occur and are important for many aspects of matter-radiation interactions that include the efficient ionization of atoms and molecules, and, ... More

Multiple testing with the structure adaptive Benjamini-Hochberg algorithmJun 25 2016In multiple testing problems, where a large number of hypotheses are tested simultaneously, false discovery rate (FDR) control can be achieved with the well-known Benjamini-Hochberg procedure, which adapts to the amount of signal present in the data. ... More

ROCKET: Robust Confidence Intervals via Kendall's Tau for Transelliptical Graphical ModelsFeb 26 2015Mar 23 2015Undirected graphical models are used extensively in the biological and social sciences to encode a pattern of conditional independences between variables, where the absence of an edge between two nodes $a$ and $b$ indicates that the corresponding two ... More

Between hard and soft thresholding: optimal iterative thresholding algorithmsApr 24 2018Jun 08 2018Iterative thresholding algorithms seek to optimize a differentiable objective function over a sparsity or rank constraint by alternating between gradient steps that reduce the objective, and thresholding steps that enforce the constraint. This work examines ... More

The log-shift penalty for adaptive estimation of multiple Gaussian graphical modelsJun 06 2014Sparse Gaussian graphical models characterize sparse dependence relationships between random variables in a network. To estimate multiple related Gaussian graphical models on the same set of variables, we formulate a hierarchical model, which leads to ... More

An Evaluation of Structural Parameters for Probabilistic Reasoning: Results on Benchmark CircuitsFeb 13 2013Many algorithms for processing probabilistic networks are dependent on the topological properties of the problem's structure. Such algorithms (e.g., clustering, conditioning) are effective only if the problem has a sparse graph captured by parameters ... More

Multiple testing with the structure adaptive Benjamini-Hochberg algorithmJun 25 2016Sep 13 2017In multiple testing problems, where a large number of hypotheses are tested simultaneously, false discovery rate (FDR) control can be achieved with the well-known Benjamini-Hochberg procedure, which adapts to the amount of signal present in the data. ... More

Contraction and uniform convergence of isotonic regressionJun 06 2017Oct 31 2018We consider the problem of isotonic regression, where the underlying signal $x$ is assumed to satisfy a monotonicity constraint, that is, $x$ lies in the cone $\{ x\in\mathbb{R}^n : x_1 \leq \dots \leq x_n\}$. We study the isotonic projection operator ... More

Realistic continuous-variable quantum teleportation with non-Gaussian resourcesOct 14 2009Dec 10 2009We present a comprehensive investigation of nonideal continuous-variable quantum teleportation implemented with entangled non-Gaussian resources. We discuss in a unified framework the main decoherence mechanisms, including imperfect Bell measurements ... More

Hierarchies of Geometric EntanglementDec 25 2007May 28 2008We introduce a class of generalized geometric measures of entanglement. For pure quantum states of $N$ elementary subsystems, they are defined as the distances from the sets of $K$-separable states ($K=2,...,N$). The entire set of generalized geometric ... More

Flavor entanglement in neutrino oscillations in the wave packet descriptionOct 22 2015Dec 17 2015The wave packet approach to neutrino oscillations provides an enlightening description of quantum decoherence induced, during propagation, by localization effects. Within this approach, we show that a deeper insight into the dynamical aspects of particle ... More

Gradient descent with nonconvex constraints: local concavity determines convergenceMar 22 2017Oct 19 2017Many problems in high-dimensional statistics and optimization involve minimization over nonconvex constraints-for instance, a rank constraint for a matrix estimation problem-but little is known about the theoretical properties of such optimization problems ... More

Alternating minimization and alternating descent over nonconvex setsSep 13 2017Feb 25 2019We analyze the performance of alternating minimization for loss functions optimized over two variables, where each variable may be restricted to lie in some potentially nonconvex constraint set. This type of setting arises naturally in high-dimensional ... More

Hybrid Processing of Beliefs and ConstraintsJan 10 2013This paper explores algorithms for processing probabilistic and deterministic information when the former is represented as a belief network and the latter as a set of boolean clauses. The motivating tasks are 1. evaluating beliefs networks having a large ... More

Proceedings of the Twenty-Second Conference on Uncertainty in Artificial Intelligence (2006)Aug 25 2012Aug 28 2014This is the Proceedings of the Twenty-Second Conference on Uncertainty in Artificial Intelligence, which was held in Cambridge, MA, July 13 - 16 2006.

On the Construction of Knockoffs in Case-Control StudiesDec 29 2018Consider a case-control study in which we have a random sample, constructed in such a way that the proportion of cases in our sample is different from that in the general population---for instance, the sample is constructed to achieve a fixed ratio of ... More

On entanglement in neutrino mixing and oscillationsMar 29 2010We report on recent results about entanglement in the context of particle mixing and oscillations. We study in detail single-particle entanglement arising in two-flavor neutrino mixing. The analysis is performed first in the context of Quantum Mechanics, ... More

Entanglement in neutrino oscillationsJul 30 2007Apr 17 2009Flavor oscillations in elementary particle physics are related to multi-mode entanglement of single-particle states. We show that mode entanglement can be expressed in terms of flavor transition probabilities, and therefore that single-particle entangled ... More

Structure of multiphoton quantum optics. II. Bipartite systems, physical processes, and heterodyne squeezed statesAug 18 2003Extending the scheme developed for a single mode of the electromagnetic field in the preceding paper ``Structure of multiphoton quantum optics. I. Canonical formalism and homodyne squeezed states'', we introduce two-mode nonlinear canonical transformations ... More

Structure of multiphoton quantum optics. I. Canonical formalism and homodyne squeezed statesAug 14 2003Aug 19 2003We introduce a formalism of nonlinear canonical transformations for general systems of multiphoton quantum optics. For single-mode systems the transformations depend on a tunable free parameter, the homodyne local oscillator angle; for n-mode systems ... More

Teleportation of squeezing: Optimization using non-Gaussian resourcesSep 30 2010Nov 24 2010We study the continuous-variable quantum teleportation of states, statistical moments of observables, and scale parameters such as squeezing. We investigate the problem both in ideal and imperfect Vaidman-Braunstein-Kimble protocol setups. We show how ... More

Discovering Multiple Truths with a Hybrid ModelMay 14 2017Many data management applications require integrating information from multiple sources. The sources may not be accurate and provide erroneous values. We thus have to identify the true values from conflicting observations made by the sources. The problem ... More

A field-theoretical approach to entanglement in neutrino mixing and oscillationsJan 30 2014Jun 04 2014The phenomena of particle mixing and flavor oscillations in elementary particle physics can be addressed by the point of view of quantum information theory, and described in terms of multi-mode entanglement of single-particle states. In this paper we ... More

A knockoff filter for high-dimensional selective inferenceFeb 10 2016This paper develops a framework for testing for associations in a possibly high-dimensional linear model where the number of features/variables may far exceed the number of observational units. In this framework, the observations are split into two groups, ... More

Privacy and Statistical Risk: Formalisms and Minimax BoundsDec 15 2014We explore and compare a variety of definitions for privacy and disclosure limitation in statistical estimation and data analysis, including (approximate) differential privacy, testing-based definitions of privacy, and posterior guarantees on disclosure ... More

Empirical Evaluation of Approximation Algorithms for Probabilistic DecodingJan 30 2013It was recently shown that the problem of decoding messages transmitted through a noisy channel can be formulated as a belief updating task over a probabilistic network [McEliece]. Moreover, it was observed that iterative application of the (linear time) ... More

Differential forms and k-Minkowski spacetime from extended twistNov 28 2012Jul 05 2013We analyze bicovariant differential calculus on $\kappa$-Minkowski spacetime. It is shown that corresponding Lorentz generators and noncommutative coordinates compatible with bicovariant calculus cannot be realized in terms of commutative coordinates ... More

Half-trek criterion for generic identifiability of linear structural equation modelsJul 27 2011Oct 03 2012A linear structural equation model relates random variables of interest and corresponding Gaussian noise terms via a linear equation system. Each such model can be represented by a mixed graph in which directed edges encode the linear equations and bidirected ... More

Convergence Results for Neural Networks via ElectrodynamicsFeb 01 2017Dec 04 2018We study whether a depth two neural network can learn another depth two network using gradient descent. Assuming a linear output node, we show that the question of whether gradient descent converges to the target function is equivalent to the following ... More

A Power and Prediction Analysis for Knockoffs with Lasso StatisticsDec 18 2017Knockoffs is a new framework for controlling the false discovery rate (FDR) in multiple hypothesis testing problems involving complex statistical models. While there has been great emphasis on Type-I error control, Type-II errors have been far less studied. ... More

The Function-on-Scalar LASSO with Applications to Longitudinal GWASOct 24 2016We present a new methodology for simultaneous variable selection and parameter estimation in function-on-scalar regression with an ultra-high dimensional predictor vector. We extend the LASSO to functional data in both the $\textit{dense}$ functional ... More

Upper limit on the amplitude of gravitational waves around 0.1Hz from the Global Positioning SystemFeb 18 2014The global positioning system (GPS) is composed of thirty one satellites having atomic clocks with $10^{-15}$ accuracy on board and enables one to calibrate the primary standard for frequency on the ground. Using the fact that oscillators on the ground ... More

Universal $κ$-Poincaré covariant differential calculus over $κ$-Minkowski spaceDec 10 2013Apr 02 2014Unified graded differential algebra, generated by $\kappa$-Minkowski noncommutative (NC) coordinates, Lorentz generators and anticommuting one-forms, is constructed. It is compatible with $\kappa$-Poincar\'e-Hopf algebra. For time- and space-like deformations, ... More

Matrix reconstruction with the local max normOct 18 2012We introduce a new family of matrix norms, the "local max" norms, generalizing existing methods such as the max norm, the trace norm (nuclear norm), and the weighted or smoothed weighted trace norms, which have been extensively used in the literature ... More

Differential algebras on kappa-Minkowski space and action of the Lorentz algebraMar 13 2012We propose two families of differential algebras of classical dimension on kappa-Minkowski space. The algebras are constructed using realizations of the generators as formal power series in a Weyl super-algebra. We also propose a novel realization of ... More

BEEM : Bucket Elimination with External MemoryMar 15 2012A major limitation of exact inference algorithms for probabilistic graphical models is their extensive memory usage, which often puts real-world problems out of their reach. In this paper we show how we can extend inference algorithms, particularly Bucket ... More

Stability of the quantized circulation of an attractive Bose-Einstein condensate in a rotating torusMay 14 2003We investigate rotational properties of a system of bosons with attractive interactions confined in a one-dimensional torus. Two kinds of ground states, uniform-density and bright-soliton states, are obtained analytically as functions of the strength ... More

Lower bounds on Locality Sensitive HashingOct 29 2005Nov 26 2005Given a metric space $(X,d_X)$, $c\ge 1$, $r>0$, and $p,q\in [0,1]$, a distribution over mappings $\h:X\to \mathbb N$ is called a $(r,cr,p,q)$-sensitive hash family if any two points in $X$ at distance at most $r$ are mapped by $\h$ to the same value ... More

A knockoff filter for high-dimensional selective inferenceFeb 10 2016May 03 2018This paper develops a framework for testing for associations in a possibly high-dimensional linear model where the number of features/variables may far exceed the number of observational units. In this framework, the observations are split into two groups, ... More

EigenPrism: Inference for High-Dimensional Signal-to-Noise RatiosMay 08 2015Jun 28 2016Consider the following three important problems in statistical inference, namely, constructing confidence intervals for (1) the error of a high-dimensional ($p>n$) regression estimator, (2) the linear regression noise level, and (3) the genetic signal-to-noise ... More

Quantum Skyrmions in Two-Dimensional Chiral MagnetsApr 28 2016May 15 2016We study the quantum mechanics of magnetic skyrmions in the vicinity of the skyrmion-crystal to ferromagnet phase boundary in two-dimensional magnets. We show that the skyrmion excitation has an energy dispersion that splits into multiple bands due to ... More

Nonreciprocal spin Seebeck effect in antiferromagnetsApr 11 2018Jul 13 2018We theoretically propose a nonreciprocal spin Seebeck effect, i.e., nonreciprocal spin transport generated by a temperature gradient, in antiferromagnetic insulators with broken inversion symmetry. We find that nonreciprocity in antiferromagnets has rich ... More

Studies in Lower Bounding Probabilities of Evidence using the Markov InequalityJun 20 2012Computing the probability of evidence even with known error bounds is NP-hard. In this paper we address this hard problem by settling on an easier problem. We propose an approximation which provides high confidence lower bounds on probability of evidence ... More

Kappa-deformation of phase space; generalized Poincare algebras and R-matrixApr 19 2012Sep 20 2012We deform Heisenberg algebra and corresponding coalgebra by twist. We present undeformed and deformed tensor identities. Coalgebras for the generalized Poincar\'{e} algebras have been constructed. The exact universal $R$-matrix for the deformed Heisenberg ... More

Systematic vs. Non-systematic Algorithms for Solving the MPE TaskOct 19 2012The paper continues the study of partitioning based inference of heuristics for search in the context of solving the Most Probable Explanation task in Bayesian Networks. We compare two systematic Branch and Bound search algorithms, BBBT (for which the ... More

Lower Bounds on Near Neighbor Search via Metric ExpansionMay 03 2010In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we look at the graph obtained by connecting every pair of points within a certain ... More

Active Tuples-based Scheme for Bounding Posterior BeliefsJan 16 2014The paper presents a scheme for computing lower and upper bounds on the posterior marginals in Bayesian networks with discrete variables. Its power lies in its ability to use any available scheme that bounds the probability of evidence or posterior marginals ... More

Tunable non-Gaussian resources for continuous-variable quantum technologiesAug 11 2013We introduce and discuss a set of tunable two-mode states of continuous-variable systems, as well as an efficient scheme for their experimental generation. This novel class of tunable entangled resources is defined by a general ansatz depending on two ... More

Scaling of the Rényi entropies in gapped quantum spin systems: Entanglement-driven order beyond symmetry breakingAug 03 2012We investigate the scaling of the R\'enyi $\alpha$-entropies in one-dimensional gapped quantum spin models. We show that the block entropies with $\alpha > 2$ violate the area law monotonicity and exhibit damped oscillations. Depending on the existence ... More

Non-Gaussian entanglement swappingJun 09 2016We investigate the continuous-variable entanglement swapping protocol in a non-Gaussian setting, with non- Gaussian states employed either as entangled inputs and/or as swapping resources. The quality of the swapping protocol is assessed in terms of the ... More

Universal aspects in the behavior of the entanglement spectrum in one dimension: scaling transition at the factorization point and ordered entangled structuresJul 29 2013Sep 30 2013We investigate the scaling of the entanglement spectrum and of the R\'enyi block entropies and determine its universal aspects in the ground state of critical and noncritical one-dimensional quantum spin models. In all cases, the scaling exhibits an oscillatory ... More

Multipartite entangled states in particle mixingNov 14 2007Mar 18 2008In the physics of flavor mixing, the flavor states are given by superpositions of mass eigenstates. By using the occupation number to define a multiqubit space, the flavor states can be interpreted as multipartite mode-entangled states. By exploiting ... More

Optimal estimation of losses at the ultimate quantum limit with non-Gaussian statesJul 24 2008Apr 23 2009We address the estimation of the loss parameter of a bosonic channel probed by arbitrary signals. Unlike the optimal Gaussian probes, which can attain the ultimate bound on precision asymptotically either for very small or very large losses, we prove ... More

Continuous variable quantum teleportation with sculptured and noisy non-Gaussian resourcesOct 17 2007Feb 27 2008We investigate continuous variable (CV) quantum teleportation using relevant classes of non-Gaussian states of the radiation field as entangled resources. First, we introduce the class two-mode squeezed symmetric superposition of Fock states, including ... More

Resonance control of graphene drum resonator in nonlinear regime by standing wave of lightMay 15 2017We demonstrate the control of resonance characteristics of a drum type graphene mechanical resonator in nonlinear oscillation regime by the photothermal effect, which is induced by a standing wave of light between a graphene and a substrate. Unlike the ... More