-
10/6/25, 9:00 AMOpening/Closing Remarks
-
Christian Bauer (Lawrence Berkeley National Laboratory)10/6/25, 9:15 AMPlenary Talk
After motivating the need for quantum simulation in High Energy Physics, I will explain one of the main tools for such simulations, namely a Hamiltonian formulation of lattice gauge theory. I will explain several general concepts, before focusing on the development of an efficient representation of the lattice Hamiltonian for QCD, the theory of the strong interaction. Time permitting, I will...
Go to contribution page -
Matthew Fisher (UC Santa Barbara)10/6/25, 10:00 AMPlenary Talk
Traditionally, quantum condensed matter theory has focussed on ground states and equilibrium properties of spatially extended systems, such as electrons and spins in crystalline solids. In recent years ``noisy intermediate scale quantum computers" have emerged, providing new opportunities for controllable non-equilibrium many-body dynamics. In such dynamical quantum systems the inexorable...
Go to contribution page -
Carlo Maria Scandolo (University of Calgary)10/6/25, 11:15 AMContributed Talk
Many resource theories share an interesting property: An operation is free if and only if its renormalized Choi matrix is a free state. In this article, we refer to resource theories exhibiting this property as Choi-defined resource theories. We demonstrate how and under what conditions one can construct a Choi-defined resource theory, and we prove that when such a construction is possible,...
Go to contribution page -
Archishna Bhattacharyya (University of Ottawa)10/6/25, 11:30 AMContributed Talk
We show for the first time that uncloneable encryption exists with no computational assumptions, with security inverse-polynomial in the security parameter. We use properties of a monogamy-of-entanglement game associated with the Haar measure encryption to guarantee that any state that succeeds with high probability cannot be close to maximally-entangled between the referee and either of the...
Go to contribution page -
Murtaza Jafry (University of Chicago)10/6/25, 11:45 AMContributed Talk
Quantum pseudoentanglement is a property of certain quantum systems where specific ensembles of quantum states are indistinguishable from maximally entangled states. The construction of quantum pseudoentanglement requires pseudorandom quantum states that can be efficiently generated but are indistinguishable from Haar-random states. Specifically, we construct pseudoentangled states whose...
Go to contribution page -
Alexandre Blais (Institut quantique, Université de Sherbrooke)10/6/25, 1:30 PMShort Talk
Circuit quantum electrodynamics (cQED) has emerged as a powerful platform for quantum computation and for the investigation of quantum optics at microwave frequencies. A critical part of all cQED experiments is qubit readout, which relies on microwave drives. In principle, higher drive amplitudes should lead to faster and more accurate readout. However, experiments have consistently shown that...
Go to contribution page -
Zohreh Davoudi (University of Maryland, College Park)10/6/25, 2:00 PMShort Talk
The universe has evolved from a far-from-equilibrium state at the Big Bang. High-energy particle colliders aim to recreate such nonequilibrium conditions in experiment, to reach densities and temperatures necessary for generating some of the most short-lived states of matter, and to unravel equilibration and hadronization mechanisms. Theoretical studies of matter out of equilibrium, rooted in...
Go to contribution page -
Alexandre Blais (Institut quantique, Université de Sherbrooke), David Gosset (University of Waterloo - Institute for Quantum Computing (IQC)), Graeme Smith (Institute for Quantum Computing (AMATH)), John Preskill (California Institute of Technology (Caltech) - Division of Physics Mathematics & Astronomy)10/6/25, 3:15 PMPanel Discussion
-
10/6/25, 4:15 PMDiscussion
-
Laura Mančinska (University of Copenhagen)10/7/25, 9:00 AMPlenary Talk
Gap-preserving reductions are central to classical complexity theory, but their quantum counterparts, especially in the setting of multiprover interactive proofs with entangled provers, present new challenges. In this talk I will introduce a framework for such reductions in the MIP setting and use it to show that the gapped promise problem for independent set games is MIP-complete. These...
Go to contribution page -
Brian Swingle (Brandeis University)10/7/25, 9:45 AMShort Talk
Quantum information has proven extremely useful for understanding how spacetime emerges from microphysics in some quantum theories of gravity. Conversely, quantum gravity has inspired a number of ideas and tools of broader relevance for quantum information science. I will describe one recent example of this exchange in which we used ideas of quantum randomness and tensor networks to shed light...
Go to contribution page -
Oscar Lautsch (University of Waterloo, Department of Pure Mathematics & Institute for Quantum Computing)10/7/25, 10:15 AMContributed Talk
The Clifford hierarchy is a nested sequence of sets of quantum gates that can be fault-tolerantly performed using gate teleportation within standard quantum error correction schemes. Non-Clifford gates from the third level or higher, e.g. the $T$ gate, are necessary for achieving fault-tolerant universal quantum computation. Since it was defined twenty-six years ago by Gottesman-Chuang [4],...
Go to contribution page -
Avantika Agarwal (Institute for Quantum Computing)10/7/25, 10:30 AMContributed Talk
In recent years, the quantum oracle model introduced by Aaronson and Kuperberg (2007) has found a lot of use in showing oracle separations between complexity classes and cryptographic primitives. It is generally assumed that proof techniques that do not relativize with respect to quantum oracles will also not relativize with respect to classical oracles. In this note, we show that this is not...
Go to contribution page -
Xingyu Zhou (The University of British Columbia)10/7/25, 11:15 AMContributed Talk
The edge list model is arguably the simplest input model for graphs, where the graph is specified by a list of its edges. In this model, we study the quantum query complexity of three variants of the triangle finding problem. The first asks whether there exists a triangle containing a target edge and raises general questions about the hiding of a problem's input among irrelevant data. The...
Go to contribution page -
Amirreza Negari (Perimeter Institute for Theoretical Physics)10/7/25, 11:30 AMContributed Talk
We investigate $(k_1,k_2)$-extendibility of fermionic Gaussian states, a property central to quantum correlations and approximations of separability. We show that these states are $(k_1,k_2)$-extendible if and only if they admit a fermionic Gaussian extension, yielding a complete covariance-matrix characterization and a simple semidefinite program (SDP) whose size scales linearly with the...
Go to contribution page -
Yuxuan Zhang (University of Toronto)10/7/25, 11:45 AMContributed Talk
Quantum magic is a necessary resource for quantum computers to be not efficiently simulable by classical computers. Previous results have linked the amount of quantum magic, characterized by the number of 𝑇 gates or the stabilizer rank, to classical simulability. However, the effect of the distribution of quantum magic on the hardness of simulating a quantum circuit remains open. In this work,...
Go to contribution page -
Martin Savage (University of Washington)10/7/25, 3:15 PMShort Talk
-
Yuxiang Yang (University of Hong Kong (HKU))10/7/25, 3:45 PMShort Talk
Quantum metrology promises enhanced precision in parameter estimation by exploiting quantum effects. The traditional framework of metrology commonly assumes unlimited access to resources, overlooking resource constraints in realistic scenarios. As such, the optimal strategies therein are often infeasible in practice. In this talk, I will introduce our recent result on optimal quantum metrology...
Go to contribution page -
10/7/25, 4:15 PMDiscussion
-
Roger Melko (University of Waterloo - Department of Physics and Astronomy), Antonio Mezzacapo (IBM Research - Thomas J. Watson Research Center), Christine Muschik (University of Waterloo), Martin Savage (University of Washington), Brian Swingle (Brandeis University)10/7/25, 7:00 PMPublic Event
Moderator
Roger MelkoPanelists
Antionio Mezzacapo
Christine Muschik
Martin Savage
Brian SwinglePlease RSVP in advance here: https://uwaterloo.ca/institute-for-quantum-computing/events/impact-quantum-information-science-how-will-it-change-how-we
Go to contribution page -
Soonwon Choi (MIT)10/8/25, 9:00 AMPlenary Talk
Quantum computing and sensing represent two distinct frontiers of quantum information science. Here, we harness quantum computing to solve a fundamental and practically important sensing problem: the detection of weak oscillating fields with unknown strength and frequency. We present a quantum computing enhanced sensing protocol, that we dub quantum search sensing, outperforming all existing...
Go to contribution page -
Nikolas Breukmann (University of Bristol)10/8/25, 9:45 AMShort Talk
Ordered phases of matter have close connections to computation. Two prominent examples are spin glass order, with wide-ranging applications in machine learning and optimization, and topological order, closely related to quantum error correction. Here, we introduce the concept of topological quantum spin glass (TQSG) order which marries these two notions, exhibiting both the complex energy...
Go to contribution page -
Christine Muschik (University of Waterloo - Institute for Quantum Computing (IQC))10/8/25, 10:15 AMShort Talk
Particle physics underpins our understanding of the world at a fundamental level by describing the interplay of matter and forces through gauge theories. Yet, despite their unmatched success, the intrinsic quantum mechanical nature of gauge theories makes important problem classes notoriously difficult to address with classical computational techniques. A promising way to overcome these...
Go to contribution page -
Dongjin Lee (Perimeter Institute for Theoretical Physics)10/8/25, 11:15 AMContributed Talk
We present a family of simple three-dimensional stabilizer codes, called the chiral color codes, that realize fermionic and chiral topological orders. In the qubit case, the code realizes the topological phase of a single copy of the fermionic toric code. For qudit systems with local dimension d, the model features a chiral parameter α and realizes 3D topological phases characterized by...
Go to contribution page -
Shayan Majidy (Princeton University)10/8/25, 11:30 AMContributed Talk
Quantum error correction (QEC) is believed to be essential for the realization of large-scale quantum computers. However, due to the complexity of operating on the encoded `logical' qubits, understanding the physical principles for building fault-tolerant quantum devices and combining them into efficient architectures is an outstanding scientific challenge. Here we utilize reconfigurable...
Go to contribution page -
Marc-Antoine Roy (Université de Sherbrooke)10/8/25, 11:45 AMContributed Talk
In order to achieve fault-tolerant quantum computing, we make use of quantum error correction schemes designed to protect the logical information of the system from decoherence. A promising way to preserve such information is using the multimode Gottesman-Kitaev-Preskill (GKP) encoding, which encodes a single logical qubit into harmonic oscillators. This type of encoding adds redundancy in the...
Go to contribution page -
John Preskill (Caltech)10/8/25, 3:15 PMKeynote
-
10/8/25, 4:15 PMDiscussion
-
Aleksander Kubica (Yale University)10/9/25, 9:00 AMPlenary Talk
-
Nathan Wiebe (University of Toronto)10/9/25, 9:45 AMShort Talk
-
Antonio Mezzacapo (IBM Research - Thomas J. Watson Research Center)10/9/25, 10:15 AMShort Talk
In this talk, I will discuss quantum diagonalization methods, based on subspaces obtained from quantum computers, which overcome the scaling limitations of variational algorithms and enabled realistic chemistry computations of up to 77 qubits on a quantum centric supercomputing architecture, using a Heron quantum processor and the RIKEN supercomputer Fugaku. Merging these ideas with Krylov...
Go to contribution page -
Eric Chitambar (University of Illinois Urbana-Champaign)10/9/25, 11:15 AMPlenary Talk
In distributed quantum information processing, the parties are often limited to performing local operations and classical communication (LOCC). The class of LOCC is notoriously difficult to analyze, and typically one considers the larger class of so-called separable (SEP) operations, which has a nicer mathematical structure. Finding separable but non-LOCC maps is a challenging endeavor, with...
Go to contribution page -
Dakshita Khurana (University of Illinois Urbana-Champaign)10/9/25, 1:30 PMShort Talk
In this talk, I will explore the fascinating landscape of minimal assumptions in quantum cryptography—how little we need to assume to build secure quantum protocols. We will cover key cryptographic primitives including quantum encryption, signatures, and money, and show how these primitives imply the existence of one-way puzzles, a quantum analogue of classical one-way functions. I will also...
Go to contribution page -
Sergey Bravyi (IBM Quantum, IBM T.J. Watson Research Center)10/9/25, 2:00 PMShort Talk
We consider the problem of simulating dynamics of classical nonlinear dissipative systems with N>>1 degrees of freedom. To make the problem tractable for quantum computers, we add a weak Gaussian noise to the equation of motion and the initial state. Our main result is an end-to-end quantum algorithm for simulating the noisy dynamics of nonlinear systems satisfying certain sparsity and...
Go to contribution page -
Martin Laforest (Quantacet), Anne Broadbent (University of Ottawa), Barry Sanders (University of Calgary - The Institute for Quantum Science and Technology), Vlad Gheorgiu (University of Waterloo), John Watrous (IBM (Canada))10/9/25, 3:15 PMPanel Discussion
Moderator
Martin LaforestPanelists
Go to contribution page
Barry Sanders
Anne Broadbent
Vlad Gheorghiu
John Watrous -
10/9/25, 4:15 PMDiscussion
-
10/9/25, 4:45 PM
-
Rain Zimin Yang (University of British Columbia)Poster
The degree $\deg(f)$ of a Boolean function $f\colon \{0,1\}^n \to \{0,1\}$ is the minimum value of $\deg(p)$ such that $p$ is a real polynomial and $f = p$ on $\{0,1\}^n$. The rational degree $(f)$ of $f$ is the minimum value of $\max(\deg(p),\deg(q))$ such that $p,q$ are real polynomials and $f=p/q$ on $\{0,1\}^n$. Degree is polynomially related to almost all Boolean complexity measures,...
Go to contribution page -
Einar Gabbassov (UW, PI, IQC)Poster
Extended Abstract.
Quantum entanglement is widely regarded as the essential ingredient for quantum advantage. If a quantum computation does not exploit entanglement, it can typically be simulated classically, and thus cannot yield a genuine speedup. Yet the converse is not true: even algorithms that generate large amounts of entanglement may not provide an advantage. This is one of the...
Go to contribution page -
Yinchen Liu (Institute for Quantum Computing (IQC))Poster
An $n$-qubit quantum circuit is said to be peaked if it has an output probability
Go to contribution page
that is at least inverse-polynomially large as a function of $n$. We describe a classical
algorithm with quasipolynomial runtime $n^{O(\log n)}$ that approximately samples from the
output distribution of a peaked constant-depth circuit. We give even faster algorithms
for circuits composed of... -
Michael Zurel (Simon Fraser University)Poster
The Lambda polytopes provide a geometric framework for describing and reasoning about quantum computations. Every quantum computation can be described as a probabilistic update of a probability distribution over the vertices of the polytopes. This provides a classical simulation algorithm for universal quantum computation via sampling from these distributions. More recently, the Lambda...
Go to contribution page -
María Rosa Preciado-Rivas (University of Waterloo)Poster
We investigate the harvesting of contextuality from the vacuum of a quantum field using Unruh-DeWitt detectors. We show that interactions with the field can endow initially non-contextual detectors with contextuality with respect to Heisenberg-Weyl measurements, as quantified by contextual fraction. The harvested contextuality correlates with the emergence of Wigner function negativity, in...
Go to contribution page -
Sanchit Srivastava (Institute for Quantum Computing & Department of Physics and Astronomy, University of Waterloo.)Poster
We investigate the role of logical Bell inequalities in identifying quantum states useful for magic state distillation. Our approach provides an alternative route to characterizing contextuality as a resource, entirely within the logical framework. In particular, we derive logical Bell inequalities that delineate the faces of the simulable polytope of a single qudit: the set of states...
Go to contribution page -
Stanley Miao (Perimeter Institute for Theoretical Physics)Poster
We present entanglement sharing schemes (ESS), which are methods to store and recover entanglement among disjoint parties in a controlled manner. We adopt a similar setting to quantum secret sharing (QSS), where we encode and distribute shares of an entangled state instead of a quantum secret. Two parties aim to recover a maximally entangled pair by locally processing a subset of the shares....
Go to contribution page -
Lana Bozanic (Perimeter Institute for Theoretical Physics)Poster
In an entanglement summoning task, a set of distributed, cooperating parties attempt to respond to requests to prepare entanglement between distant locations. The parties share limited communication resources: timing constraints may require the entangled state to be prepared before some pairs of distant parties can communicate, and a restricted set of links in a quantum network may further...
Go to contribution page -
Eric Culf (University of Waterloo - Institute for Quantum Computing (IQC))Poster
Commutativity gadgets allow NP-hardness proofs for classical constraint satisfaction problems (CSPs) to be carried over to undecidability proofs for the corresponding entangled CSPs. This has been done, for instance, for NP-complete boolean CSPs and 3-colouring in the work of Culf and Mastel. For many CSPs over larger alphabets, including $k$-colouring when $k \geq 4$, it is not known whether...
Go to contribution page -
Meenu Kumari (National Research Council Canada)Poster
The efficient preparation of scalable multipartite entanglement is crucial for advancing next-generation quantum devices. We explore twist-and-turn (TaT) dynamics in XY models with ferromagnetic, dipolar interactions and a Rabi field. Our study reveals their capacity to achieve scalable spin squeezing at short times and quantum Fisher information with Heisenberg scaling at later times,...
Go to contribution page -
Mandana Bidarvand (University of Saskatchewan)Poster
We present a study of the Sachdev–Ye–Kitaev (SYK) Hamiltonian, a model of broad relevance ranging from the physics of rotating black holes to the characterization of quantum materials. A central challenge is to characterize the spectral distribution in the large-$N$ limit. We employ efficient algorithms derived from a concrete representation of fermionic creation and annihilation operators...
Go to contribution page -
Rodolfo Reis Soldati (University of Waterloo - Institute for Quantum Computing (IQC))Poster
The Generalized Quantum Stein's Lemma is a statement in hypothesis testing that provides an operational meaning to the relative entropy within the context of quantum resource theories. Its original proof was found to have a gap, which led to a search for a correction. We formalize the proof presented in [Hayashi and Yamasaki (2024)] on the Lean interactive theorem proving language. This is the...
Go to contribution page -
Peixue Wu (University of Waterloo)Poster
We introduce a framework for quantifying the minimal resources required for quantum simulations based on the Lipschitz dual picture of non-commutative Wasserstein metric. This approach naturally leads to rigorous lower bounds on the circuit depth and volume necessary to implement quantum operations and prepare quantum states. In particular, we show that simulating a quantum channel whose...
Go to contribution page -
Negar SeifPoster
Thermalization in isolated quantum many-body systems has been the subject of extensive research, with quantum chaos playing a central role in the emergence of statistical mechanics and thermodynamic behavior. A natural way to distinguish between different dynamical regimes is through their spectral properties. Chaotic (non-integrable) systems exhibit energy-level repulsion characterized by...
Go to contribution page -
Raz Firanko (Postdoctoral fellow)Poster
In this poster, we will present a broad family of local Kraus operators over general interaction graphs. The family consists of mixtures of ergodic 1-local (non-interacting) terms and general 2-local (interacting) terms. Physically, a repeated application of these channels can be seen as a simple model for the thermalization process of a many-body system. We show that these systems steady...
Go to contribution page -
Po-Yao Chang (National Tsing Hua University)Poster
We introduce entropic measures to quantify non-classical resource in hybrid spin-boson systems. We discuss the stabilizer Rényi entropy in the framework of phase space quantisation and define an analogous hybrid magic entropy and a mutual magic entropy that capture the distribution of quantum magic across spin and bosonic subsystems. We use these entropic measures to demonstrate two key...
Go to contribution page -
Ahmet Burak Catli (University of Toronto)Poster
Stochastic Differential Equations (SDEs) provide a way of incorporating randomness directly at the core level of physical models. In this paper we provide an algorithm for simulating matrix linear SDEs on a quantum computer, building on top of contemporary approaches like Linear Combination of Hamiltonian Simulations. SDEs themselves are both relevant immediately as they are employed in...
Go to contribution page -
Matthew Duschenes (Perimeter Institute for Theoretical Physics)Poster
Moments of ensembles of unitary evolutions play a central role in quantum information theory, as they capture the statistical properties of random dynamics. Indeed, such concepts arise when comparing how close the associated moments of a given ensemble are to that of another, reference ensemble. Despite their tremendous importance, the analysis of statistics for more general quantum channels,...
Go to contribution page -
Rabsan Galib Ahmed (Institute for Quantum Computing, University of Waterloo)Poster
We introduce a new family of multi-mode, rotationally symmetric bosonic codes inspired by the group-theoretic framework of [Phys. Rev. Lett. 133, 240603 (2024)][1]. Such a construction inverts the traditional paradigm of code design by identifying codes from the requirement that a group of chosen logical gates should be implemented by means of physically simple logical operations, such as...
Go to contribution page -
Zheng Shi (Institute for Quantum Computing, University of Waterloo)Poster
While universal quantum computers remain under development, analog quantum simulators offer a powerful alternative for understanding complex systems in condensed matter, chemistry, and high-energy physics. One compelling application is the characterization of real-time lattice gauge theories (LGTs). LGTs are nonperturbative tools, utilizing discretized spacetime to describe gauge-invariant...
Go to contribution page -
Yaroslav HerasymenkoPoster
We consider the optimization problem (ground energy search) for fermionic Hamiltonians with classical interactions. This QMA-hard problem is motivated by the Coulomb electron-electron interaction being diagonal in the position basis, a fundamental fact that underpins electronic-structure Hamiltonians in quantum chemistry and condensed matter. We prove that fermionic Gaussian states achieve an...
Go to contribution page -
Joseph Gibson (Université de Sherbrooke)Poster
We propose a quantum algorithm for approximately counting the number of solutions to planar 2-satisfiability (2SAT) formulas natively on neutral atom quantum computers. Our algorithm maps Boolean variables to atomic registers arranged in space according to a given formula, so that 2SAT constraints are enforced via the Rydberg blockade between neighboring atoms. A quench under Rydberg dynamics...
Go to contribution page -
89. Quantum f-divergences and their Local Behaviour: An Analysis via Relative Expansion CoefficientsShreyas Iyer (Institute for Quantum Computing (AMATH))Poster
In our work, we analyse how distinguishability measures behave under quantum channels via relative contraction and relative expansion coefficients, which quantify the fraction of information lost or preserved on a specified class of states. We focus on two prominent families: (i) standard quantum f -divergences and (ii) their local (second-order) behaviour, which induces a monotone Riemannian...
Go to contribution page -
Forouzan Forouharmanesh (IQC, Physics and Astronomy, University of Waterloo, Canada)Poster
Quantum metrology seeks to achieve precision measurements by exploiting fundamental quantum principles. Ultracold atoms provide a highly controllable platform for exploring complex quantum dynamics and realizing precision measurement protocols.
Quantum resources like entanglement enable sensitivity beyond the standard quantum limit, approaching the Heisenberg bound.In this work, we...
Go to contribution page -
Joshua Foo (University of Waterloo)Poster
Optical clocks based on atoms and ions probe relativistic effects with unprecedented sensitivity by resolving time dilation due to atom motion or different positions in the gravitational potential through frequency shifts. However, all measurements of time dilation so far can be explained effectively as the result of dynamics with respect to a classical proper time parameter. Here we show that...
Go to contribution page -
Alessandro Prositto (Department of Physics and Centre for Quantum Information and Quantum Control, University of Toronto)Poster
Preparing quantum thermal states on digital quantum computers remains a major challenge, as existing algorithms typically require computational resources that grow exponentially with the size of the system. This makes thermal state preparation on quantum computers impractical for large or realistic models, limiting the scope of quantum simulations in many-body physics, chemistry, and materials...
Go to contribution page -
Lars Kamin (Institute for Quantum Computing, University of Waterloo)Poster
We develop a flexible and robust framework for finite-size security proofs of quantum key distribution (QKD) protocols under coherent attacks, applicable to both fixed- and variable-length protocols. Our methods achieve high finite-size key rates across a broad class of protocols while imposing minimal requirements. In particular, it eliminates the need for restrictive assumptions such as...
Go to contribution page -
Albie Chan (University of Waterloo), Zheng Shi (University of Waterloo)Poster
Quantum networks are a backbone of future quantum technologies thanks to their role in communication and scalable quantum computing. However, their performance is challenged by noise and decoherence. We propose a self-configuring approach that integrates superimposed quantum paths with variational quantum optimization (VQO) techniques. This allows networks to dynamically optimize noisy path...
Go to contribution page -
Stefan Zatschler (Laurentian University, SNOLAB, University of Toronto)Poster
Quantum technologies based on solid-state devices attract a growing interest in both academic and industrial research, which is why understanding their performance limitations and finding effective mitigation strategies is a key priority. Improving the quantum coherence time beyond the current state-of-the-art requires reducing the density of non-equilibrium quasiparticles (QPs) in the quantum...
Go to contribution page -
Jinglei Zhang (University of Waterloo)Poster
The quantum chromodynamics (QCD) phase diagram is key to answering open questions in physics, from states of matter in neutron stars to the early universe. However, classical simulations of QCD face significant computational barriers, such as the sign problem at finite matter densities. Quantum computing offers a promising solution to overcome these challenges. Here, we take an important step...
Go to contribution page -
Tong Ou (University of Chicago)Poster
Baryogenesis is a dynamical out-of-equilibrium process generating the baryon asymmetry of the Universe. Focusing on the mechanism of electroweak baryogenesis, where baryon number is generated through CP-violating scattering of the fermions with the bubble wall during a first-order electroweak phase transition, perturbative calculations for the relevant processes are known to suffer from...
Go to contribution page
Choose timezone
Your profile timezone: