Search

We address various aspects of a widely used tool in quantum information theory: the Choi-Jamiolkowski isomorphism [A. Jamiolkowski, Rep. Math. Phys., 3, 275 (1972)]. We review different versions of the isomorphism, their properties and propose a unified description that combines them all. To this end, we identify the physical reason for the appearance of the (basis-dependent) operation of transposition in the isomorphism as used in Choi's theorem [M.-D. Choi, Lin. Alg. Appl., 10, 285 (1975)]. This requires a careful distinction between Jordan algebras and the different C*-algebras they arise from, which are distinguished by their order of composition. Physically, the latter encodes a choice of time orientation in the respective algebras, which relates to a number of recent results, including a characterisation of quantum from more general non-signalling bipartite correlations [M. Frembs and A. D\"oring, arXiv:2204.11471] and a classification of bipartite entanglement [M. Frembs, arXiv:2207.00024]., Comment: 12 pages, comments welcome

Exotic spinors arise in non-simply connected base manifolds due to the nonequivalent spinor structure. The dynamics of exotic spinors are endowed with an additional differential factor. In this work, we merge the exotic spinor scenario with Cartan's spinor viewpoint, according to which a given spacetime point is understood as a kind of composition of spinor entries. As a result, we arrive at a geometrical setup in which the Minkowski metric is perturbed by elements reflecting the nontrivial topology. Such corrections shall be felt by any physical system studied with the resulting bilinear form. Within the flat spacetime context, we investigate quasinormal modes arising from the interference of nontrivial topology in the scalar field dispersion relation., Comment: 17 pages, no figures. Version accepted for publication in JHEP

In this paper, we consider a weakly coupled system consisting of a viscoelastic Kirchhoff plate equation involving free boundary conditions and the viscoelastic wave equation with Dirichlet boundary conditions in a bounded domain. By assuming a more general type of relaxation functions, we establish explicit and general decay rate results, using the multiplier method and some properties of the convex functions., Comment: I would like to contact you to withdraw this version from arxiv for this reason: . As I did not contribute in this paper, I ask to delete this version and my colleagues will resubmit a new version without my name. I hope you will accept my request. Thank you in advance

We explicitly construct several Poisson structures with compact support. For example, we show that any Poisson structure on $\R^n$ with polynomial coefficients of degree at most two can be modified outside an open ball, such that it becomes compactly supported. We also show that a symplectic manifold with either contact or cosymplectic boundary admits a Poisson structure which vanishes to infinite order at the boundary and agrees with the original symplectic structure outside an arbitrarily small tubular neighbourhood of the boundary. As a consequence, we prove that any even-dimensional manifold admits a Poisson structure which is symplectic outside a codimension one subset., Comment: 15 pages; Revised references and results. Comments welcomed!

A recent paper by two of us and co-workers, based on an extended Wigner's friend scenario, demonstrated that certain empirical correlations predicted by quantum theory (QT) violate inequalities derived from a set of metaphysical assumptions we called "Local Friendliness" (LF). These assumptions are strictly weaker than those used for deriving Bell inequalities. Crucial to the theorem was the premise that a quantum system with reversible evolution could be an observer (colloquially, a "friend"). However, that paper was noncommittal on what would constitute an observer for the purpose of an experiment. Here, we present a new LF no-go theorem which takes seriously the idea that a system's having *thoughts* is a sufficient condition for it to be an observer. Our new derivation of the LF inequalities uses four metaphysical assumptions, three of which are thought-related, including one that is explicitly called "Friendliness". These four assumptions, in conjunction, allow one to derive LF inequalities for experiments involving the type of system that "Friendliness" refers to. In addition to these four metaphysical assumptions, this new no-go theorem requires two assumptions about what is *technologically* feasible: Human-Level Artificial Intelligence, and Universal Quantum Computing which is fast and large scale. The latter is often motivated by the belief that QT is universal, but this is *not* an assumption of the theorem. The intent of the new theorem is to give a clear goal for future experimentalists, and a clear motivation for trying to achieve that goal. We review various approaches to QT in light of our theorem. The popular stance that "quantum theory needs no interpretation" does not question any of our assumptions and so is ruled out. Finally, we quantitatively discuss how difficult the experiment we envisage would be, and briefly discuss milestones on the paths towards it., Comment: 44 pages, 3 figures. Accepted for publication in uantum

Using the Wei-Norman theory we obtain a time-dependent complex Riccati equation (TDCRE) as the solution of the time evolution operator (TEO) of quantum systems described by time-dependent (TD) Hamiltonians that are linear combinations of the generators of the $\mathfrak{su}(1,1)$, $\mathfrak{su}(2)$ and $\mathfrak{so}(2,1)$ Lie algebras. Using a recently developed solution for the time evolution of these quantum systems we solve the TDCRE recursively as generalized continued fractions, which are optimal for numerical implementations, and establish the necessary and sufficient conditions for the unitarity of the TEO in the factorized representation. The inherited symmetries of quantum systems can be recognized by a simple inspection of the TDCRE, allowing effective quantum Hamiltonians to be associated with it, as we show for the Bloch-Riccati equation whose Hamiltonian corresponds to that of a generic TD system of the Lie algebra $\mathfrak{su}(2)$. As an application, but also as a consistency test, we compare our solution with the analytic one for the Bloch-Riccati equation considering the Rabi frequency driven by a complex hyperbolic secant pulse generating spin inversion, showing an excellent agreement., Comment: 10 Pages, 1 Figure

The horizon structure and thermodynamics of hairy spherically symmetric black holes generated by the gravitational decoupling method are carefully investigated. The temperature and heat capacity of the black hole is determined, as well as how the hairy parameters affect the thermodynamics. It allows the analysis of the thermal stability and the possible existence of a remanent black hole. We also calculate the Hawking radiation corrected by the generalized uncertainty principle. For such we consider the emission of fermions and apply the tunneling method to the generalized Dirac equation. It shows that, despite the horizon location being the same of the Schwarzschild one for a suitable choice of parameters, the physical phenomena happening near the horizon of both black holes are qualitatively different., Comment: 11 pages, 8 figures

The rapid progress in quantum computing witnessed in recent years has sparked widespread interest in developing scalable quantum information theoretic methods to work with large quantum systems. For instance, several approaches have been proposed to bypass tomographic state reconstruction, and yet retain to a certain extent the capability to estimate multiple physical properties of a given state previously measured. In this paper, we introduce the Virtual Linear Map Algorithm (VILMA), a new method that enables not only to estimate multiple operator averages using classical post-processing of informationally complete measurement outcomes, but also to do so for the image of the measured reference state under low-depth circuits of arbitrary, not necessarily physical, $k$-local maps. We also show that VILMA allows for the variational optimisation of the virtual circuit through sequences of efficient linear programs. Finally, we explore the purely classical version of the algorithm, in which the input state is a state with a classically efficient representation, and show that the method can prepare ground states of many-body Hamiltonians., Comment: 10 pages, 5 figs. Comments welcome

In this article we exploite the uniform decay for damped linear wave equation with Zaremba boundary condition, obtained in a previous work, to treat the same problem in nonlinear context. We need a uniqueness assumption, usual for this type of nonlinear problem. The result is deduced from an observation estimate for nonlinear problem proved by a contradiction argument., Comment: arXiv admin note: substantial text overlap with arXiv:1909.10044

We present an alternative route to investigate quantum forces in a cavity, for both a free scalar field and a free fermionic field. Considering a generalized Matsubara procedure, we compute the quantum pressure on the boundaries of a compactified space in a thermal bath. Also, considering both periodic and antiperiodic boundary conditions in the cavity, we discuss the attractive or repulsive character of the quantum forces. Our results highlight the relevance and interdisciplinarity of the generalized Matsubara procedure as a theoretical platform to manage quantum phenomena in nontrivial topologies., Comment: 11 pages, 7 figures. arXiv admin note: substantial text overlap with arXiv:1608.01367

Scientific and technological advances in medicine and systems biology have unequivocally shown that health and disease must be viewed in the context of the interplay among multiple molecular and environmental factors. Understanding the effects of cellular interconnection on disease progression may lead to the identification of novel disease genes and pathways, and hence influence precision diagnostics and therapeutics. To accomplish this goal, the emerging field of network medicine applies network science approaches to investigate disease pathogenesis, integrating information from relevant Omics databases, including protein-protein interaction, correlation-based, gene regulatory, and Bayesian networks. However, this requires analysing and computing large amounts of data. Moreover, if we are to efficiently search for new drugs and new drug combinations, there is a pressing need for computational methods that could allow us to access the immense chemical compound space until now largely unexplored. Finally, at the microscopic level, drug-target chemistry simulation is ultimately a quantum problem, and hence it requires a quantum solution. As we will discuss, quantum computing may be a key ingredient in enabling the full potential of network medicine. We propose to combine network medicine and quantum algorithms in a novel research field, quantum network medicine, to lay the foundations of a new era of disease prevention and drug design.

Class imbalance is a characteristic known for making learning more challenging for classification models as they may end up biased towards the majority class. A promising approach among the ensemble-based methods in the context of imbalance learning is Dynamic Selection (DS). DS techniques single out a subset of the classifiers in the ensemble to label each given unknown sample according to their estimated competence in the area surrounding the query. Because only a small region is taken into account in the selection scheme, the global class disproportion may have less impact over the system's performance. However, the presence of local class overlap may severely hinder the DS techniques' performance over imbalanced distributions as it not only exacerbates the effects of the under-representation but also introduces ambiguous and possibly unreliable samples to the competence estimation process. Thus, in this work, we propose a DS technique which attempts to minimize the effects of the local class overlap during the classifier selection procedure. The proposed method iteratively removes from the target region the instance perceived as the hardest to classify until a classifier is deemed competent to label the query sample. The known samples are characterized using instance hardness measures that quantify the local class overlap. Experimental results show that the proposed technique can significantly outperform the baseline as well as several other DS techniques, suggesting its suitability for dealing with class under-representation and overlap. Furthermore, the proposed technique still yielded competitive results when using an under-sampled, less overlapped version of the labelled sets, specially over the problems with a high proportion of minority class samples in overlap areas. Code available at https://github.com/marianaasouza/lords., Comment: Paper accepted to the 2022 International Joint Conference on Neural Networks

In a recent work, Bong et al. [Nature Physics 16, 1199 (2020)] proved a no-go theorem demonstrating a contradiction between a set of assumptions called "Local Friendliness" (LF) and certain quantum phenomena on an extended version of the "Wigner's friend" paradox. The LF assumptions can be understood as the conjunction of two independent assumptions: Absoluteness of Observed Events (AOE) requires that events observed by any observer have absolute, rather than relative, values; Local Agency (LA) encodes the assumption that an intervention cannot influence events outside its future light cone. The proof of the LF no-go theorem, however, implicitly assumes the validity of standard probability theory. Here we present a probability-free version of the Local Friendliness theorem, building upon Hardy's no-go theorem for local hidden variables. The argument is phrased in the language of possibilities, which we make formal by using a modal logical approach. It relies on a weaker version of Local Agency, which we call "Possibilistic Local Agency": the assumption that an intervention cannot influence the possibilities of events outside its future light cone., Comment: 7 pages, 3 figures. V2: Main results unchanged. Changed overall appearance. Added discussion on the Wigner's friend scenario and expanded on the motivation underlying the assumptions. Added a figure. Updated reference list and acknowledgements section. Minor notational changes

We propose a non-Hermitian deformation of the Mathieu equation that preserves $\mathcal{PT}$ symmetry and study its spectrum and the transition from $\mathcal{PT}$-unbroken to $\mathcal{PT}$-broken phases. We show that our model not only reproduces behaviors expected by the literature but also indicates the existence of a richer structure for the spectrum. We also discuss the influence of the boundary condition and the model parameters in the exceptional line that marks the $\mathcal{PT}$ breaking.

Non-signalling quantum channels -- relevant in, e.g., the study of Bell and Einstein-Podolsky-Rosen scenarios -- may be simulated via affine combinations of local operations in bipartite scenarios. Moreover, when these channels correspond to stochastic maps between classical variables, such simulation is possible even in multipartite scenarios. These two results have proven useful when studying the properties of these channels, such as their communication and information processing power, and even when defining measures of the non-classicality of physical phenomena (such as Bell non-classicality and steering). In this paper we show that such useful quasi-stochastic characterizations of channels may be unified and applied to the broader class of multipartite non-signalling channels. Moreover, we show that this holds for non-signalling channels in quantum theory, as well as in a larger family of generalised probabilistic theories. More precisely, we prove that non-signalling channels can always be simulated by affine combinations of corresponding local operations, provided that the underlying physical theory is locally tomographic -- a property that quantum theory satisfies. Our results then can be viewed as a generalisation of Refs.~[Phys. Rev. Lett. 111, 170403] and [Phys. Rev. A 88, 022318 (2013)] to the multipartite scenario for arbitrary tomographically local generalised probabilistic theories (including quantum theory). Our proof technique leverages Hardy's duotensor formalism, highlighting its utility in this line of research., Comment: 26 pages, 4 figures, many diagrams, comments welcome!

Knowledge about programming is part of the knowledge matrix that will be required of the professionals of the future. Based on this, this work aims to report the development of a teaching tool developed during the monitoring program of the Algorithm and Computer Programming discipline of the University of Fortaleza. The tool combines the knowledge acquired in the books, with a language closer to the students, using video lessons and exercises proposed, with all the content available on the internet. The preliminary results were positive, with the students approving this new approach and believing that it could contribute to a better performance in the discipline., Comment: in Portuguese language

The behavior of hairy black hole solutions, obtained by the gravitational decoupling (GD) method, is investigated under scalar perturbations. The quasinormal mode frequencies of such solutions are regulated by GD hair. The numerically generated wave solutions are derived for a range of values for the GD hairy black hole parameters, with higher-frequency modes very sensitive to them. The results are confronted with the corresponding ones for the Schwarzschild solution, whose deviations from it demonstrate a unique physical identification of GD hairy black holes. The method here presented comprises the first steps towards the obtainment of the observable signature of GD hairy black holes at ground-based detectors, emitted from coalescing binary systems of GD hairy black hole mergers in the ringdown phase., Comment: 15 pages, 6 figures

Relational Keyword Search (R-KwS) systems enable naive/informal users to explore and retrieve information from relational databases without knowing schema details or query languages. These systems take the keywords from the input query, locate the elements of the target database that correspond to these keywords, and look for ways to "connect" these elements using information on referential integrity constraints, i.e., key/foreign key pairs. Although several such systems have been proposed in the literature, most of them only support queries whose keywords refer to the contents of the target database and just very few support queries in which keywords refer to elements of the database schema. This paper proposes LATHE, a novel R-KwS designed to support such queries. To this end, in our work, we first generalize the well-known concepts of Query Matches (QMs) and Candidate Joining Networks (CJNs) to handle keywords referring to schema elements and propose new algorithms to generate them. Then, we introduce an approach to automatically select the CJNs that are more likely to represent the user intent when issuing a keyword query. This approach includes two major innovations: a ranking algorithm for selecting better QMs, yielding the generation of fewer but better CJNs, and an eager evaluation strategy for pruning void useless CJNs. We present a comprehensive set of experiments performed with query sets and datasets previously used in experiments with state-of-the-art R-KwS systems and methods. Our results indicate that LATHE can handle a wider variety of keyword queries while remaining highly effective, even for large databases with intricate schemas.

We consider the problem of controlling a series of industrial systems, such as industrial robotics, in a factory environment over a shared wireless channel leveraging edge computing capabilities. The wireless control system model supports the offloading of computational intensive functions, such as perception workloads, to an edge server. However, wireless communications is prone to packet loss and latency and can lead to instability or task failure if the link is not kept sufficiently reliable. Because maintaining high reliability and low latency at all times prohibits scalability due to resource limitations, we propose a communication-control co-design paradigm that varies the network quality of service (QoS) and resulting control actions to the dynamic needs of each plant. We further propose a modular learning framework to solve the complex learning task without knowledge of plant or communication models in a series of learning steps and demonstrate its effectiveness in learning resource-efficient co-design policies in a robotic conveyor belt task.

Hate speech is a major issue in social networks due to the high volume of data generated daily. Recent works demonstrate the usefulness of machine learning (ML) in dealing with the nuances required to distinguish between hateful posts from just sarcasm or offensive language. Many ML solutions for hate speech detection have been proposed by either changing how features are extracted from the text or the classification algorithm employed. However, most works consider only one type of feature extraction and classification algorithm. This work argues that a combination of multiple feature extraction techniques and different classification models is needed. We propose a framework to analyze the relationship between multiple feature extraction and classification techniques to understand how they complement each other. The framework is used to select a subset of complementary techniques to compose a robust multiple classifiers system (MCS) for hate speech detection. The experimental study considering four hate speech classification datasets demonstrates that the proposed framework is a promising methodology for analyzing and designing high-performing MCS for this task. MCS system obtained using the proposed framework significantly outperforms the combination of all models and the homogeneous and heterogeneous selection heuristics, demonstrating the importance of having a proper selection scheme. Source code, figures, and dataset splits can be found in the GitHub repository: https://github.com/Menelau/Hate-Speech-MCS., Comment: acceped for publication on the Online Social Networks and Media (OSNEM) journal