Magic State Research Articles

Approximate stabilizer rank and improved weak simulation of Clifford-dominated circuits for qudits

Bravyi and Gosset recently gave classical simulation algorithms for quantum circuits dominated by Clifford operations. These algorithms scale exponentially with the number of T-gate in the circuit, but polynomially in the number of qubits and Clifford operations. Here we extend their algorithm to qudits of odd prime dimensions. We generalize their approximate stabilizer rank method for weak simulation to qudits and obtain the scaling of the approximate stabilizer rank with the number of single-qudit magic states. We also relate the canonical form of qudit stabilizer states to Gauss sum evaluations. We give an O(n^3) algorithm to calculating the inner product of two n-qudit stabilizer states.

7 El Helicoide and La Torre de David as Phantom Pavilions: Rethinking Spectacles of Progress in Venezuela

This article explores El Helicoide and La Torre de David as remnants of the recurrent boom-and-bust cycles and spectacles of progress associated with Venezuela's ‘magical state’ (Coronil). Their redefinition as ‘phantom pavilions’—constructions designed to symbolise development but haunted by crisis and precariousness—serves as a conceptual tool against the amnesia and hysteria these sites provoke. First, I use it to track the buildings' grandiose designs, subsequent curtailment and modified uses through political and economic history. Second, the concept informs the analysis of recent artworks that summon monumentality and ruination to envisage alternate forms of public engagement with truncated sites.

Quantum advantage of unitary Clifford circuits with magic state inputs.

We study the computational power of unitary Clifford circuits with solely magic state inputs (CM circuits), supplemented by classical efficient computation. We show that CM circuits are hard to classically simulate up to multiplicative error (assuming polynomial hierarchy non-collapse), and also up to additive error under plausible average-case hardness conjectures. Unlike other such known classes, a broad variety of possible conjectures apply. Along the way, we give an extension of the Gottesman-Knill theorem that applies to universal computation, showing that for Clifford circuits with joint stabilizer and non-stabilizer inputs, the stabilizer part can be eliminated in favour of classical simulation, leaving a Clifford circuit on only the non-stabilizer part. Finally, we discuss implementational advantages of CM circuits.

Efficient magic state factories with a catalyzed|CCZ⟩to2|T⟩transformation

We present magic state factory constructions for producing|CCZ⟩states and|T⟩states. For the|CCZ⟩factory we apply the surface code lattice surgery construction techniques described in \cite{fowler2018} to the fault-tolerant Toffoli \cite{jones2013, eastin2013distilling}. The resulting factory has a footprint of12d×6d(wheredis the code distance) and produces one|CCZ⟩every5.5dsurface code cycles. Our|T⟩state factory uses the|CCZ⟩factory's output and a catalyst|T⟩state to exactly transform one|CCZ⟩state into two|T⟩states. It has a footprint25%smaller than the factory in \cite{fowler2018} but outputs|T⟩states twice as quickly. We show how to generalize the catalyzed transformation to arbitrary phase angles, and note that the caseθ=22.5∘produces a particularly efficient circuit for producing|T⟩states. Compared to using the12d×8d×6.5d|T⟩factory of \cite{fowler2018}, our|CCZ⟩factory can quintuple the speed of algorithms that are dominated by the cost of applying Toffoli gates, including Shor's algorithm \cite{shor1994} and the chemistry algorithm of Babbush et al. \cite{babbush2018}. Assuming a physical gate error rate of10−3, our CCZ factory can produce∼1010states on average before an error occurs. This is sufficient for classically intractable instantiations of the chemistry algorithm, but for more demanding algorithms such as Shor's algorithm the mean number of states until failure can be increased to∼1012by increasing the factory footprint∼20%.

Quantum Computing, Seifert Surfaces, and Singular Fibers

The fundamental group π 1 ( L ) of a knot or link L may be used to generate magic states appropriate for performing universal quantum computation and simultaneously for retrieving complete information about the processed quantum states. In this paper, one defines braids whose closure is the L of such a quantum computer model and computes their braid-induced Seifert surfaces and the corresponding Alexander polynomial. In particular, some d-fold coverings of the trefoil knot, with d = 3 , 4, 6, or 12, define appropriate links L, and the latter two cases connect to the Dynkin diagrams of E 6 and D 4 , respectively. In this new context, one finds that this correspondence continues with Kodaira’s classification of elliptic singular fibers. The Seifert fibered toroidal manifold Σ ′ , at the boundary of the singular fiber E 8 ˜ , allows possible models of quantum computing.

Robustness of Magic and Symmetries of the Stabiliser Polytope

We give a new algorithm for computing therobustness of magic- a measure of the utility of quantum states as a computational resource. Our work is motivated by themagic state modelof fault-tolerant quantum computation. In this model, all unitaries belong to the Clifford group. Non-Clifford operations are effected by injecting non-stabiliser states, which are referred to asmagic statesin this context. Therobustness of magicmeasures the complexity of simulating such a circuit using a classical Monte Carlo algorithm. It is closely related to the degree negativity that slows down Monte Carlo simulations through the infamoussign problem. Surprisingly, the robustness of magic issub- multiplicative. This implies that the classical simulation overhead scales subexponentially with the number of injected magic states - better than a naive analysis would suggest. However, determining the robustness ofncopies of a magic state is difficult, as its definition involves a convex optimisation problem in a 4n-dimensional space. In this paper, we make use of inherent symmetries to reduce the problem tondimensions. The total run-time of our algorithm, while still exponential inn, is super-polynomially faster than previously published methods. We provide a computer implementation and give the robustness of up to 10 copies of the most commonly used magic states. Guided by the exact results, we find a finite hierarchy of approximate solutions where each level can be evaluated in polynomial time and yields rigorous upper bounds to the robustness. Technically, we use symmetries of the stabiliser polytope to connect the robustness of magic to the geometry of a low-dimensional convex polytope generated by certainsigned quantum weight enumerators. As a by-product, we characterised the automorphism group of the stabiliser polytope, and, more generally, of projections onto complex projective 3-designs.

Resource optimized quantum architectures for surface code implementations of magic-state distillation

Quantum computers capable of solving classically intractable problems are under construction, and intermediate-scale devices are approaching completion. Current efforts to design large-scale devices require allocating immense resources to error correction, with the majority dedicated to the production of high-fidelity ancillary states known as magic-states. Leading techniques focus on dedicating a large, contiguous region of the processor as a single “magic-state distillation factory” responsible for meeting the magic-state demands of applications.In this work we design and analyze a set of optimized factory architectural layouts that divide a single factory into spatially distributed factories located throughout the processor. We find that distributed factory architectures minimize the space-time volume overhead imposed by distillation. Additionally, we find that the number of distributed components in each optimal configuration is sensitive to application characteristics and underlying physical device error rates. More specifically, we find that the rate at which T-gates are demanded by an application has a significant impact on the optimal distillation architecture. We develop an optimization procedure that discovers the optimal number of factory distillation rounds and number of output magic states per factory, as well as an overall system architecture that interacts with the factories. This yields between a 10x and 20x resource reduction compared to commonly accepted single factory designs. Performance is analyzed across representative application classes such as quantum simulation and quantum chemistry.

Quantum computing thanks to Bianchi groups

It has been shown that the concept of a magic state (in universal quantum computing: uqc) and that of a minimal informationally complete positive operator valued measure: MIC-POVMs (in quantum measurements) are in good agreement when such a magic state is selected in the set of non-stabilizer eigenstates of permutation gates with the Pauli group acting on it [1]. Further work observed that most found low-dimensional MICs may be built from subgroups of the modular group PS L(2, Z) [2] and that this can be understood from the picture of the trefoil knot and related 3-manifolds [3]. Here one concentrates on Bianchi groups PS L(2, O10) (with O10 the integer ring over the imaginary quadratic field) whose torsion-free subgroups define the appropriate knots and links leading to MICs and the related uqc. One finds a chain of Bianchi congruence n-cusped links playing a significant role [4].

Topological properties of graphene moiré superlattice systems and recent optical studies

When 2D materials with different lattice constants or lattice rotation angles are stacked together, a periodic moiré pattern will appear. Such moiré superlattice introduces a new two dimensional periodic potential, which can greatly change the physical properties of the original systems. Recent experimental studies of moiré superlattices formed by graphene on graphene and graphene on hexagonal boron nitride have revealed very rich strong correlation effects and topological effects due to novel states in superlattice minibands. It has been shown that flat bands in graphene-based moiré superlattice systems can host both topological states and strongly correlated states, which can be controlled by an external electric field. In bilayer graphene, ABC stacked trilayer graphene and twisted bilayer-bilayer graphene, the number of valence and conduction bands near the Dirac point and even the band topology and bandwidth can be changed by varying the stacking angle between graphene layers or the applied bias voltage. Moreover, the competition between kinetic energy and coulomb interaction depends on the bandwidth and the external electric field, and at the so-called magic angle mott insulator states and superconductivity were observed. Twisted bilayer-bilayer graphene has also been predicted to show similar intriguing properties, including electrically tunable strongly correlated insulators, superconductivity and many rich topological states. In graphene-based moiré systems, the combination of topological states and strong correlations is expected to lead to a broad range of novel phenomena that are not achievable in other material systems. Therefore, graphene moiré systems is likely to bring substantial progress to the study of topological materials. In this paper, we review theoretical and experimental investigations of the topological properties of graphene moiré superlattices, including topological domain wall states in bilayer graphene and topological effects in twisted bilayer graphene, ABC trilayer graphene and twisted double bilayer graphene. The origins of topological properties of these systems are discussed as well as topological phenomena observed in various experiments. Finally, recent near-field optical studies of the band structure and novel topological properties of graphene moiré superlattices are discussed.

Universal Quantum Computing and Three-Manifolds

A single qubit may be represented on the Bloch sphere or similarly on the 3-sphere S 3 . Our goal is to dress this correspondence by converting the language of universal quantum computing (UQC) to that of 3-manifolds. A magic state and the Pauli group acting on it define a model of UQC as a positive operator-valued measure (POVM) that one recognizes to be a 3-manifold M 3 . More precisely, the d-dimensional POVMs defined from subgroups of finite index of the modular group P S L ( 2 , Z ) correspond to d-fold M 3 - coverings over the trefoil knot. In this paper, we also investigate quantum information on a few ‘universal’ knots and links such as the figure-of-eight knot, the Whitehead link and Borromean rings, making use of the catalog of platonic manifolds available on the software SnapPy. Further connections between POVMs based UQC and M 3 ’s obtained from Dehn fillings are explored.

Magic number colloidal clusters as minimum free energy structures

Clusters in systems as diverse as metal atoms, virus proteins, noble gases, and nucleons have properties that depend sensitively on the number of constituent particles. Certain numbers are termed ‘magic’ because they grant the system with closed shells and exceptional stability. To this point, magic number clusters have been exclusively found with attractive interactions as present between atoms. Here we show that magic number clusters exist in a confined soft matter system with negligible interactions. Colloidal particles in an emulsion droplet spontaneously organize into a series of clusters with precisely defined shell structures. Crucially, free energy calculations demonstrate that colloidal clusters with magic numbers possess higher thermodynamic stability than those off magic numbers. A complex kinetic pathway is responsible for the efficiency of this system in finding its minimum free energy configuration. Targeting similar magic number states is a strategy towards unique configurations in finite self-organizing systems across the scales.

Structural, optical, and nuclear magnetic resonance studies of V2O5-doped lead calcium titanate borosilicate glasses

In this study, the melt-quenching technique was used to synthesize various glass compositions for the system 55[(PbxCa1-x)·OTiO2]-44[2SiO2·B2O3]-1V2O5 (0.0 ≤ x ≤ 0.7). The synthesized glasses were investigated by X-ray diffraction (XRD), Fourier transform infrared spectroscopy (FTIR), Raman spectroscopy, ultraviolet–visible spectroscopy, scanning electron microscopy (SEM), and nuclear magnetic resonance spectroscopy (NMR). The experimental density of the glass samples increased from 1.48 to 2.19 g/cm3 as the concentration of lead oxide (PbO) increased. The XRD results agreed well with the SEM observations and they confirmed the amorphous nature of the glasses. The FTIR and Raman analyses indicated the presence of various bonds comprising VOV, PbOB, BOB, SiOSi, BOSi and BOH, which were attributed to different vibrations. The optical band gap values decreased from 2.07 to 1.65 eV as the PbO content increased. 29Si and 11B magic angle spinning solid state NMR spectral analysis suggested that the number of non-bridging oxygens increased within the silicate and borate network as the concentration of PbO increased in the glassy system.

Quantification and manipulation of magic states

Magic states can be used as a resource to circumvent the restrictions due to stabilizer-preserving operations, and magic-state conversion has not been studied in the single-copy regime thus far. Here we solve the question of whether a stabilizer-preserving quantum operation exists that can convert between two given magic states in the single-shot regime. We first phrase this question as a feasibility problem for a semi-definite program (SDP), which provides a procedure for constructing a stabilizer-preserving quantum operation (free channel) if it exists. Then we employ a variant of the Farkas Lemma to derive necessary and sufficient conditions for existence, and this method is used to construct a complete set of magic monotones.

Simulation of Non-Abelian Braiding in Majorana Time Crystals.

Discrete time crystals have attracted considerable theoretical and experimental studies but their potential applications have remained unexplored. A particular type of discrete time crystals, termed "Majorana time crystals," is found to emerge in a periodically driven superconducting wire accommodating two different species of topological edge modes. It is further shown that one can manipulate different Majorana edge modes separated in the time lattice, giving rise to an unforeseen scenario for topologically protected gate operations mimicking braiding. The proposed protocol can also generate a magic state that is important for universal quantum computation. This study thus advances the quantum control in discrete time crystals and reveals their great potential arising from their time-domain properties.

Majorana-Based Fermionic Quantum Computation.

Because Majorana zero modes store quantum information nonlocally, they are protected from noise, and have been proposed as a building block for a quantum computer. We show how to use the same protection from noise to implement universal fermionic quantum computation. Our architecture requires only two Majorana modes to encode a fermionic quantum degree of freedom, compared to alternative implementations which require a minimum of four Majorana modes for a spin quantum degree of freedom. The fermionic degrees of freedom support both unitary coupled cluster variational quantum eigensolver and quantum phase estimation algorithms, proposed for quantum chemistry simulations. Because we avoid the Jordan-Wigner transformation, our scheme has a lower overhead for implementing both of these algorithms, allowing for simulation of the Trotterized Hubbard Hamiltonian in O(1) time per unitary step. We finally demonstrate magic state distillation in our fermionic architecture, giving a universal set of topologically protected fermionic quantum gates.

Post-capitalist Development in Latin America’s Left Turn: Beyond Peronism and the Magical State

ABSTRACTThe persistence of struggles by popular sectors in the context of the pink tide has generated ongoing debates about how to interpret the region’s left turn. For some, these movements are understood as forming part of a tense but ultimately productive relationship with left governments in the pursuit of post-neoliberal development. For others, it points to potentially irreconcilable political differences, and neoliberal continuities in pink tide governance. In this paper, I address these debates by presenting research on two social movements: Argentina’s recuperated enterprises and Venezuela’s popular economy. Using a Marxian-inspired, situated case study approach, I argue that these movements can be understood as ‘post-capitalist struggles’, that is, attempts to articulate new forms of democracy and cooperation that point beyond capitalism. As such, these movements push beyond the politics of Kirchnerismo and Chavismo that reproduce, albeit in new forms, the limitations to post-capitalist development associated with Peronism and the ‘magical state’. These movements therefore reveal both the region’s potential post-capitalist future, and the barriers that stand against it in the context of the region’s latest phase of development.

Lattice Surgery with a Twist: Simplifying Clifford Gates of Surface Codes

We present a planar surface-code-based scheme for fault-tolerant quantum computation which eliminates the time overhead of single-qubit Clifford gates, and implements long-range multi-target CNOT gates with a time overhead that scales only logarithmically with the control-target separation. This is done by replacing hardware operations for single-qubit Clifford gates with a classical tracking protocol. Inter-qubit communication is added via a modified lattice surgery protocol that employs twist defects of the surface code. The long-range multi-target CNOT gates facilitate magic state distillation, which renders our scheme fault-tolerant and universal.

Towers of generalized divisible quantum codes

A divisible binary classical code is one in which every code word has weight divisible by a fixed integer. If the divisor is $2^\nu$ for a positive integer $\nu$, then one can construct a Calderbank-Shor-Steane (CSS) code, where $X$-stabilizer space is the divisible classical code, that admits a transversal gate in the $\nu$-th level of Clifford hierarchy. We consider a generalization of the divisibility by allowing a coefficient vector of odd integers with which every code word has zero dot product modulo the divisor. In this generalized sense, we construct a CSS code with divisor $2^{\nu+1}$ and code distance $d$ from any CSS code of code distance $d$ and divisor $2^\nu$ where the transversal $X$ is a nontrivial logical operator. The encoding rate of the new code is approximately $d$ times smaller than that of the old code. In particular, for large $d$ and $\nu \ge 2$, our construction yields a CSS code of parameters $[[O(d^{\nu-1}), \Omega(d),d]]$ admitting a transversal gate at the $\nu$-th level of Clifford hierarchy. For our construction we introduce a conversion from magic state distillation protocols based on Clifford measurements to those based on codes with transversal $T$-gates. Our tower contains, as a subclass, generalized triply even CSS codes that have appeared in so-called gauge fixing or code switching methods.

Magic state parity-checker with pre-distilled components

Magic states are eigenstates of non-Pauli operators. One way of suppressing errors present in magic states is to perform parity measurements in their non-Pauli eigenbasis and postselect on even parity. Here we develop new protocols based on non-Pauli parity checking, where the measurements are implemented with the aid of pre-distilled multiqubit resource states. This leads to a two step process: pre-distillation of multiqubit resource states, followed by implementation of the parity check. These protocols can prepare single-qubit magic states that enable direct injection of single-qubit axial rotations without subsequent gate-synthesis and its associated overhead. We show our protocols are more efficient than all previous comparable protocols with quadratic error reduction, including the protocols of Bravyi and Haah.

Magic state distillation at intermediate size

Recently [1] we proposed a family of magic state distillation protocols that obtains asymptotic performance that is conjectured to be optimal. This family depends upon several codes, called “inner codes” and “outer codes.” In Ref. [1], some small examples of these codes were given as well as an analysis of codes in the asymptotic limit. Here, we analyze such protocols in an intermediate size regime, using hundreds to thousands of qubits. We use BCH inner codes [2], combined with various outer codes. We extend the protocols of Ref. [1] by adding error correction in some cases. We present a variety of protocols in various input error regimes; in many cases these protocols require significantly fewer input magic states to obtain a given output error than previous protocols.