Search Talks

Abstract: TBD

Zoom Link: https://pitp.zoom.us/j/95212522185?pwd=eWx4R3o3cmZISmtPY0xwMmdxc2EzZz09

Bell's theorem proves that quantum theory is inconsistent with local physical models and, from the perspective of causal inference, it can be seen as the impossibility of providing a classical causal explanation to quantum correlations. Bell's theorem has propelled research in the foundations of quantum theory and quantum information science. In the last decade, the investigation of nonlocality has moved beyond Bell's theorem to consider more complicated causal structures allowing for communication between the parts and involving several independent sources which distribute shares of physical systems in a network. For the case of three observable variables, it is known that there are three non-trivial causal networks. Two of those, are known to give rise to quantum non-classicality: the instrumental and the triangle scenarios. In this talk, we introduce new tools to tackle the compatibility problem in the general framework of Bayesian networks and explore the remaining non-trivial network, which we call the Evans scenario. We do not solve its main open problem –whether quantum non-classical correlations can arise from it – but give a significant step in this direction by proving that post-quantum correlations, analogous to the Popescu-Rohrlich box, do violate the constraints imposed by a classical description of Evans causal structure.

Zoom Link: https://pitp.zoom.us/j/98549320714?pwd=QVllZXNpZTFqekI1ZVUrK3ZLdnRjZz09

We present an efficient machine learning (ML) algorithm for predicting any unknown quantum process over n qubits. For a wide range of distributions D on arbitrary n-qubit states, we show that this ML algorithm can learn to predict any local property of the output from the unknown process, with a small average error over input states drawn from D. The ML algorithm is computationally efficient even when the unknown process is a quantum circuit with exponentially many gates. Our algorithm combines efficient procedures for learning properties of an unknown state and for learning a low-degree approximation to an unknown observable. The analysis hinges on proving new norm inequalities, including a quantum analogue of the classical Bohnenblust-Hille inequality, which we derive by giving an improved algorithm for optimizing local Hamiltonians. Overall, our results highlight the potential for ML models to predict the output of complex quantum dynamics much faster than the time needed to run the process itself.

Zoom link:  https://pitp.zoom.us/j/93857777354?pwd=c044blZuQVhLS200ME4vN25uaGJudz09

No-go theorems (Bell, Kochen-Specker, …) formally show the departure of quantum theory from classical theory. These are formulated in the framework of ontological models and, if one accepts such framework, entail that quantum theory involves problematic (“fine-tuned”) properties. I will argue that the lesson to take from the no-go theorems is to abandon the framework of ontological models as the way to model reality. I will analyze what I believe to be the unnatural assumptions of such framework and I will propose a way to change it. The basic principle of the new notion of reality I propose is that for something to exist is for something to be recorded. I will motivate the principle and explore its consequences. In order to implement such proposal into a precise theory-independent mathematical framework I will make use of point-free topological spaces (locales). I will discuss why this new proposal should be promising for understanding quantum theory and I will present several open questions.

Zoom link:  https://pitp.zoom.us/j/91292006884?pwd=V2EzaEw5Z3NRUGd4cVdSRnlOOWFVZz09

Tom Leinster recently introduced a curious notion of entropy modulo p (https://arxiv.org/abs/1903.06961). While entropy has a certain meaning in information theory and physics, mathematically it is simply a function with certain properties. Stating these as axioms, the function is unique. Surprisingly, Leinster shows that a function obeying the same axioms can also be found for "probability distributions" over a finite field, and this function is unique too.

In quantum information, mutually unbiased bases is an important set of measurements and an example of a quantum design. While in odd prime power dimensions their construction is based on a finite field, in dimension 2^n it relies on an unpleasant Galois ring. I will replace this ring by length-2 Witt vectors whose arithmetic involves only finite field operations and Leinster's entropy mod 2. This expresses qubit mutually unbiased bases entirely in terms of a finite field and allows deriving an explicit unitary correspondence between them and the affine plane over this field.

Zoom link:  https://pitp.zoom.us/j/94032116379?pwd=TTI1RnByQnFuVHp1MytFUlJxckM4Zz09

Kronecker coefficients appear in representation of the symmetric group in the decomposition of tensor products of irreducible representations. They are notoriously difficult to compute and it is a long standing problem to find a combinatorial expression for them. 

We study the problem of computing Kronecker coefficients from quantum computational perspective. First, we show that the coefficients can be expressed as a dimension of a subspace given by intersection of two commuting, efficiently implementable projectors and relate their computation to the recently introduced quantum approximate counting class (QAPC). Using similar construction, we show that deciding positivity of Kronecker coefficients is contained in QMA. We give similar results for a related problem of approximating row sums in a character table of the symmetric group and show that its decision variant is in QMA. We then discuss two quantum algorithms - one that samples a distribution over squared characters and another one that approximates normalized Kronecker coefficients to inverse-polynomial additive error. We show that under a conjecture about average-case hardness of computing Kronecker coefficients, the resulting distribution is hard to sample from classically. 

Our work explores new structures for quantum algorithms and improved characterization of the quantum approximate counting.

Joint work with David Gossett, Sergey Bravyi, Anirban Chowdhury and Guanyu Zhu 

Zoom link:  https://pitp.zoom.us/j/95976938016?pwd=eDV3TXZReHo5UHdvZ0hIbkhXOFcxQT09

Understanding gravity in the framework of quantum mechanics is one of the great challenges in modern physics. Along this line, a prime question is to find whether gravity is a quantum entity subject to the rules of quantum mechanics. It is fair to say that there are no feasible ideas yet to test the quantum coherent behaviour of gravity directly in a laboratory experiment. I will introduce an idea for such a test based on the principle that two objects cannot be entangled without a quantum mediator.  I will show that despite the weakness of gravity, the phase evolution induced by the gravitational interaction of two micron size test masses in adjacent matter-wave interferometers can detectably entangle them even when they are placed far apart enough to keep Casimir-Polder forces at bay. I will provide a prescription for witnessing this entanglement, which certifies gravity as a quantum coherent mediator, through simple correlation measurements between two spins: one embedded in each test mass. Fundamentally, the above entanglement is shown to certify the presence of non-zero off-diagonal terms in the coherent state basis of the gravitational field modes.

Zoom link:  https://pitp.zoom.us/j/99584743899?pwd=aHl1cVlpK29ZVDkrdFZyM01GemJJdz09

Nonclassicality, as witnessed by the incapacity of Classical Causal Theory (CCT) of explaining a system's behavior given its causal structure, come to be one of the hottest topics in Quantum Foundations over the last decades, a movement that was motivated both by its vast range of practical applications and by the powerful insights it provides about the rules of the quantum world. Among the many attempts at understanding/quantifying this phenomenon, we highlight the idea of inquiring how further would it be necessary to relax the causal structure associated with a given system in order to have its nonclassical behavior explained by CCT. More recently, we showed that the relaxation demanded to explain the behavior of a subset of variables in a given experiment may not be allowed by the embedding causal structure when considering the behavior of the remaining variables, which led to a new way of witnessing nonclassicality. In this seminar, we discuss a new way of quantifying this incompatibility and possible generalizations of this approach to different scenarios.

Zoom link:  https://pitp.zoom.us/j/96051313203?pwd=bFNhOEhkSVhXWk8yd1hVZWVVa0U4UT09

In this talk, I present the latest works on anyonic information theory and how it is linked to aspects of quantum foundations. First, the theory of 2+1 D non-abelian anyons will be introduced. The newly discovered notion of anyonic creation operators will be presented, as well as their use as local elements of reality within the Deutsch-Hayden interpretation of quantum mechanics. Lastly, I will show strange properties of anyonic entanglement that appear due to the lack of a tensor product structure, such as the different spectra of marginals in bipartite systems. This property makes the Von Neumann entropy a bad entanglement measure. I will explain the challenges of defining entanglement measures for anyonic systems and current approaches. 

Zoom link:  https://pitp.zoom.us/j/99863263804?pwd=MUhkYTBzcUlwTmJ0Z3F4aFo3Rkt6QT09

In spite of its immense importance in the present-day information technology, the foundational aspects of quantum theory (QT) remain still elusive. In particular, there is no such set of physically motivated axioms which can answer why Hilbert space formalism is the only natural choice to describe the microscopic world. Hence, to shed light on the unique formalism of QT, two different operational frameworks will be described in the primitive of various convex operational theories. The first one refers to a kinematical symmetry principle which would be proposed from the perspective of single copy state discrimination and it would be shown that this symmetry holds for both classical and QT – two successful descriptions of the physical world. On the other hand, studying a wide range of convex operational theories, namely the General Probabilistic Theories (GPTs) with polygonal state spaces, we observe the absence of such symmetry. Thus, the principle deserves its own importance to mark a sharp distinction between the physical and unphysical theories. Thereafter, a distributed computing scenario will be introduced for which the other convex theories except the QT turn out to be equivalent to the classical one even though the theories possess more exotic state and effect spaces. We have coined this particular operational framework as ‘Distributed computation with limited communication’ (DCLC). Furthermore, it will be shown that the distributed computational strength of quantum communication will be justified in terms of a stronger version of this task, namely the ‘Delayed choice distributed computation with limited communication’ (DC2LC). The proposed task thus provides a new approach to operationally single out quantum theory in the theory-space and hence promises a novel perspective towards the axiomatic derivation of Hilbert space quantum mechanics.

References:
Phys. Rev. A (Rapid)100, 060101 (2019)
Ann. Phys.(Berlin)2020,532, 2000334 (2020)
arXiv:2012.05781 [quant-ph](2020)

Zoom link:  https://pitp.zoom.us/j/92924188227?pwd=ODJYQXVoaUtzZmZIdFlmcUNIV3Rmdz09

Classical simulation algorithms provide a rigorous ground for investigating quantum resources responsible for quantum speedup. In my talk, I will consider one such algorithm provided by Lambda polytopes. These polytopes are defined to be the polar dual of the stabilizer polytopes and can be used to provide a hidden variable model for finite-dimensional quantum theory. This hidden variable model can be turned into a  classical algorithm that can simulate any quantum computation. The efficiency of this algorithm depends on the combinatorial structure of the polytope. In general, which subset of the vertices gives rise to efficient simulation is an open problem. I will describe some of the known classes of vertices and available methods for studying this polytope.

Zoom link:  https://pitp.zoom.us/j/95216680309?pwd=aGlIN2NtZVRtczdHcXl5RzgzQTlOdz09

In the context of irreversible dynamics, the meaning of the reverse of a physical evolution can be quite ambiguous. It is a standard choice to define the reverse process using Bayes' theorem, but, in general, this is not optimal with respect to the relative entropy of recovery. In this work we explore whether it is possible to characterise an optimal reverse map building from the concept of state retrieval maps. In doing so, we propose a set of  principles that state retrieval maps should satisfy. We find out that the Bayes inspired reverse is just one case in a whole class of possible choices, which can be optimised to give a map retrieving the initial state more precisely than the Bayes rule. Our analysis has the advantage of naturally extending to the quantum regime. In fact, we find a class of reverse transformations containing the Petz recovery map as a particular case, corroborating its interpretation as a quantum analogue of the Bayes retrieval.

Finally, we present numerical evidence showing that by adding a single extra axiom one can isolate for classical dynamics the usual reverse process derived from Bayes' theorem.

Zoom link:  https://pitp.zoom.us/j/93589286500?pwd=dkZuRzR0SlhVd1lPdGNOZWFYQWtRZz09