Quantum Physics

For n≥3, we demonstrate the existence of quantum codes which are local in dimension n with V qubits, distance V^{(n−1)/n}, and dimension V^{(n−2)/n}, up to a polylog(V) factor. The distance is optimal up to the polylog factor. The dimension is also optimal for this distance up to the polylog factor. The proof combines the existence of asymptotically good quantum codes, a procedure to build a manifold from a code by Freedman-Hastings, and a quantitative embedding theorem by Gromov-Guth.

Zoom link:  https://pitp.zoom.us/j/96227350980?pwd=TEFtamRmTXg3dnBMNEhKUkpHbmVoZz09

Quantum error mitigation has been proposed as a means to combat unwanted and unavoidable errors in near-term quantum computing using no or few additional quantum resources, in contrast to fault-tolerant schemes that come along with heavy overheads. Error mitigation has been successfully applied to reduce noise in near-term applications. 

In this work, however, we identify strong limitations to the degree to which quantum noise can be effectively `undone' for larger system sizes. We set up a framework that rigorously captures large classes of error mitigation schemes in use today. The core of our argument combines fundamental limits of statistical inference with a construction of families of random circuits that are highly sensitive to noise.

We show that even at poly loglog depth, a super-polynomial number of samples is needed in the worst case to estimate the expectation values of noiseless observables, the principal task of error mitigation. Notably, our construction implies that scrambling due to noise can kick in at exponentially smaller depths than previously thought. They also impact other near-term applications, constraining kernel estimation in quantum machine learning, causing an earlier emergence of noise-induced barren plateaus in variational quantum algorithms and ruling out exponential quantum speed-ups in estimating expectation values in the presence of noise or preparing the ground state of a Hamiltonian.

Zoom link:  https://pitp.zoom.us/j/95736148335?pwd=akZLaHE5aStNQVZOeVFETlltNzVwdz09

Recent progress in the development of quantum technologies has enabled the direct investigation of dynamics of increasingly complex quantum many-body systems. This motivates the study of the complexity of classical algorithms for this problem in order to benchmark quantum simulators and to delineate the regime of quantum advantage. Here we present classical algorithms for approximating the dynamics of local observables and nonlocal quantities such as the Loschmidt echo, where the evolution is governed by a local Hamiltonian. For short times, their computational cost scales polynomially with the system size and the inverse of the approximation error. In the case of local observables, the proposed algorithm has a better dependence on the approximation error than algorithms based on the Lieb–Robinson bound. Our results use cluster expansion techniques adapted to the dynamical setting, for which we give a novel proof of their convergence. This has important physical consequences besides our efficient algorithms. In particular, we establish a novel quantum speed limit, a bound on dynamical phase transitions, and a concentration bound for product states evolved for short times.

Joint work with Dominik S. Wild (arXiv:2210.11490)

Zoom link:  https://pitp.zoom.us/j/97166113711?pwd=UEg4NnJlQkkxQXFnN2xXYTBxS001Zz09

The theory of polynomial optimisation considers a polynomial objective function subject to countable many polynomial constraints. In a seminal contribution Navascués, Pironio and Acín (NPA) generalised a previous result from Lassere, allowing for its application in quantum information theory by considering its non-commutative variant. Non-commutative variables are represented as bounded operators on potentially infinite dimensional Hilbert spaces. These infinite-dimensional non-commutative polynomials optimisation (NPO) problems are recast as a complete hierarchy of semidefinite programming (SDP) relaxations by a suitable partitioning of the underlying spaces.

The reformulation into convex optimisation problems allows for numerical analysis. We focus on an operator theoretical approach to the NPA hierarchy and show its equiv-
alence to the original NPA hierarchy. To do so, we introduce the necessary mathematical preliminaries from operator algebra theory and semidefinite programming. We conclude by showing how certain relations on operators translate to SDP relaxations yielding drastically reduced problem sizes.

Zoom Link: https://pitp.zoom.us/j/98583295694?pwd=SlcvNG90RzFrODBKSHNaUi84bG9DZz09

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