相关论文: Weighted Projective Line ZX Calculus: Quantized Or…

Simulating physical systems on near-term quantum computers often requires preparing states within constrained subspaces, like those with fixed particle number or spin. We use Lie algebraic techniques to prove that hardware-efficient gates…

The execution of quantum algorithms on modern hardware is often constrained by noise and qubit decoherence, limiting the circuit depth and the number of gates that can be executed. Circuit optimization techniques help mitigate these…

Qubit Mapping is a critical task in Quantum Compilation, as modern Quantum Processing Units (QPUs) are constrained to nearest-neighbor interactions defined by a qubit coupling graph. This compiler pass repairs the connectivity of two-qubit…

The Scalable ZX-calculus is a compact graphical language used to reason about linear maps between quantum states. These diagrams have multiple applications, but they frequently have to be constructed in a case-by-case basis. In this work we…

We study the behaviour of two different measures of the complexity of multipartite correlation patterns, weaving and neural complexity, for symmetric quantum states. Weaving is the weighted sum of genuine multipartite correlations of any…

Classical simulations of quantum circuits play a vital role in the development of quantum computers and for taking the temperature of the field. Here, we classically simulate various physically-motivated circuits using 2D tensor network…

The symplectic geometry of the phase space associated with a charged particle is determined by the addition of the Faraday 2-form to the standard structure on the Euclidean phase space. In this paper we describe the corresponding algebra of…

We show that much of the structure of the 2-sphere as a complex curve survives the q-deformation and has natural generalizations to the quantum 2-sphere - which, with additional structures, we identify with the quantum projective line.…

We present improved quantum circuits for elliptic curve scalar multiplication, the most costly component in Shor's algorithm to compute discrete logarithms in elliptic curve groups. We optimize low-level components such as reversible…

Physical platforms such as trapped ions suffer from coherent noise where errors manifest as rotations about a particular axis and can accumulate over time. We investigate passive mitigation through decoherence free subspaces, requiring the…

Quantum computers promise to revolutionize our ability to simulate molecules, and cloud-based hardware is becoming increasingly accessible to a wide body of researchers. Algorithms such as Quantum Phase Estimation and the Variational…

The vast and complicated large-qubit state space forbids us to comprehensively capture the dynamics of modern quantum computers via classical simulations or quantum tomography. Recent progress in quantum learning theory prompts a crucial…

Weighted projective spaces are natural generalizations of projective spaces with a rich structure. Projective Reed-Muller codes are error-correcting codes that played an important role in reliably transmitting information on digital…

Quantum hardware suffers from high error rates and noise, which makes directly running applications on them ineffective. Quantum Error Correction (QEC) is a critical technique towards fault tolerance which encodes the quantum information…

We introduce a new algorithm for computing the periods of a smooth complex projective hypersurface. The algorithm intertwine with a new method for computing an explicit basis of the singular homology of the hypersurface. It is based on…

Orbifolding two-dimensional quantum field theories by a symmetry group can involve a choice of discrete torsion. We apply the general formalism of `orbifolding defects' to study and elucidate discrete torsion for topological field theories.…

The paradigm of measurement-based quantum computing (MBQC) starts from a highly entangled resource state on which unitary operations are executed through adaptive measurements and corrections ensuring determinism. This is set in contrast to…

We propose a quantum programming language that generalizes the $\lambda$-calculus. The language is non-linear; duplicated variables denote, not cloning of quantum data, but sharing a qubit's state; that is, producing an entangled pair of…

We provide an efficient algorithm to compile quantum circuits for fault-tolerant execution. We target surface codes, which form a 2D grid of logical qubits with nearest-neighbor logical operations. Embedding an input circuit's qubits in…

We introduce an enhanced technique for strong classical simulation of quantum circuits which combines the `sum-of-stabilisers' method with an automated simplification strategy based on the ZX-calculus. Recently it was shown that quantum…