Searcharxiv⌕ Search

arXiv subjects

Fang Zhang

Publications and source records attributed to Fang Zhang.

At least 55 records · Page 3Linked to original sources

A Classical Architecture For Digital Quantum Computers

Scaling bottlenecks the making of digital quantum computers, posing challenges from both the quantum and the classical components. We present a classical architecture to cope with a comprehensive list of the latter challenges {\em all at once}, and implement it fully in an end-to-end system by integrating a multi-core RISC-V CPU with our in-house control electronics. Our architecture enables scalable, high-precision control of large quantum processors and accommodates evolving requirements of quantum hardware. A central feature is a microarchitecture executing quantum operations in parallel on arbitrary predefined qubit groups. Another key feature is a reconfigurable quantum instruction set that supports easy qubit re-grouping and instructions extensions. As a demonstration, we implement the widely-studied surface code quantum computing workflow, which is instructive for being demanding on both the controllers and the integrated classical computation. Our design, for the first time, reduces instruction issuing and transmission costs to constants, which do not scale with the number of qubits, without adding any overheads in decoding or dispatching. Rather than relying on specialized hardware for syndrome decoding, our system uses a dedicated multi-core CPU for both qubit control and classical computation, including syndrome decoding. This simplifies the system design and facilitates load-balancing between the quantum and classical components. We implement recent proposals as decoding firmware on a RISC-V system-on-chip (SoC) that parallelizes general inner decoders. By using our in-house Union-Find and PyMatching 2 implementations, we can achieve unprecedented decoding capabilities of up to distances 47 and 67 with the currently available SoCs, under realistic and optimistic assumptions of physical error rate $p=0.001 and p=0.0001, respectively, all in just 1 \textmu s.

quant-ph↗

Effects of high-momentum tail of nucleon momentum distribution on initiation of cluster production in heavy-ion collisions at intermediate energies

Based on the transport model isospin-dependent Boltzmann-Uehling-Uhlenbeck coupled with a phase-space coalescence afterburner, we studied the effects of the high-momentum tail (HMT) of nucleon momentum distribution in initialization in 197Au+197Au reactions at a beam energy of 400 MeV/nucleon with different impact parameters.We found remarkable impact parameter-dependent HMT effects on the fragment multiplicity distribution. The average neutron to proton ratio of produced isotopes is also affected by the HMT. The rapidity distributions of triton and 3He and their elliptic flows are all evidently affected by the HMT. All the effects of the HMT on the cluster production in heavy-ion collisions are centrality dependent.

nucl-th↗

Experimental study and modeling of the lower-level controller of automated vehicle

Accurate modeling of lower-level controller plays an important role in the traffic flow of automated vehicles (AVs). However, there lacks enough attention with this respect. To address this issue, we conduct a field experiment with two vehicles that are equipped with developable autonomous driving system, where one can customize the upper-level control algorithm. Based on the field experimental data, a new lower-level control model is developed and compared with two widely used ones. The comparison results show that the proposed model outperforms the two previous models in capturing the observed actual acceleration, especially the troughs of the acceleration time series. Furthermore, theoretical analysis indicates that comparing with the proposed model, the two previous models significantly overestimate the stability region of the traffic flow of the AVs and the capacity of stable traffic flow. Our study is expected to further shed light on the importance of accurate lower-level control modeling.

physics.soc-ph↗

High-performance non-Fermi-liquid metallic thermoelectric materials

Searching for high-performance thermoelectric (TE) materials in the paradigm of narrow-bandgap semiconductors has lasted for nearly 70 years and is obviously hampered by a bottleneck of research now. Here we report on the discovery of a few metallic compounds, TiFexCu2x-1Sb and TiFe1.33Sb, showing the thermopower exceeding many TE semiconductors and the dimensionless figure of merits comparable with the state-of-the-art TE materials. A quasi-linear temperature (T) dependence of electrical resistivity in 2 K - 700 K and the logarithmic T-dependent electronic specific heat at low temperature are also observed to coexist with the high thermopower, highlighting the strong intercoupling of the non-Fermi-liquid (NFL) quantum critical behavior of electrons with TE transports. Electronic structure analysis reveals the existence of fluctuating Fe-eg-related local magnetic moments, Fe-Fe antiferromagnetic (AFM) interaction at the nearest 4c-4d sites, and two-fold degenerate eg orbitals antiferromagnetically coupled with the dual-type itinerant electrons close to the Fermi level, all of which infer to a competition between the AFM ordering and Kondo-like spin compensation as well as a parallel two-channel Kondo effect. These effects are both strongly meditated by the structural disorder due to the random filling of Fe/Cu at the equivalent 4c/4d sites of the Heusler crystal lattice. The magnetic susceptibility deviates from ideal antiferromagnetism but can be fitted well by x(T) = 1/(θ + BTα), seemingly being consistent with the quantum critical scenario of strong local correlation as discussed before. Our work not only breaks the dilemma that the promising TE materials should be heavily-doped semiconductors, but also demonstrates the correlation among high TE performance, NFL quantum criticality, and magnetic fluctuation, which opens up new directions for future research.

cond-mat.str-el↗

Scalable surface code decoders with parallelization in time

Fast classical processing is essential for most quantum fault-tolerance architectures. We introduce a sliding-window decoding scheme that provides fast classical processing for the surface code through parallelism. Our scheme divides the syndromes in spacetime into overlapping windows along the time direction, which can be decoded in parallel with any inner decoder. With this parallelism, our scheme can solve the decoding throughput problem as the code scales up, even if the inner decoder is slow. When using min-weight perfect matching and union-find as the inner decoders, we observe circuit-level thresholds of $0.68\%$ and $0.55\%$, respectively, which are almost identical to $0.70\%$ and $0.55\%$ for the batch decoding.

quant-ph↗

Quantum Instruction Set Design for Performance

A quantum instruction set is where quantum hardware and software meet. We develop new characterization and compilation techniques for non-Clifford gates to accurately evaluate different quantum instruction set designs. We specifically apply them to our fluxonium processor that supports mainstream instruction $\mathrm{iSWAP}$ by calibrating and characterizing its square root $\mathrm{SQiSW}$. We measure a gate fidelity of up to $99.72\%$ with an average of $99.31\%$ and realize Haar random two-qubit gates using $\mathrm{SQiSW}$ with an average fidelity of $96.38\%$. This is an average error reduction of $41\%$ for the former and a $50\%$ reduction for the latter compared to using $\mathrm{iSWAP}$ on the same processor. This shows designing the quantum instruction set consisting of $\mathrm{SQiSW}$ and single-qubit gates on such platforms leads to a performance boost at almost no cost.

quant-ph↗

Fluxonium: an alternative qubit platform for high-fidelity operations

Superconducting qubits provide a promising path toward building large-scale quantum computers. The simple and robust transmon qubit has been the leading platform, achieving multiple milestones. However, fault-tolerant quantum computing calls for qubit operations at error rates significantly lower than those exhibited in the state of the art. Consequently, alternative superconducting qubits with better error protection have attracted increasing interest. Among them, fluxonium is a particularly promising candidate, featuring large anharmonicity and long coherence times. Here, we engineer a fluxonium-based quantum processor that integrates high qubit-coherence, fast frequency-tunability, and individual-qubit addressability for reset, readout, and gates. With simple and fast gate schemes, we achieve an average single-qubit gate fidelity of 99.97% and a two-qubit gate fidelity of up to 99.72%. This performance is comparable to the highest values reported in the literature of superconducting circuits. Thus our work, for the first time within the realm of superconducting qubits, reveals an approach toward fault-tolerant quantum computing that is alternative and competitive to the transmon system.

quant-ph↗

Tuning color centers at a twisted interface

Color center is a promising platform for quantum technologies, but their application is hindered by the typically random defect distribution and complex mesoscopic environment. Employing cathodoluminescence, we demonstrate that an ultraviolet-emitting single photon emitter can be readily activated and controlled on-demand at the twisted interface of two hexagonal boron nitride flakes. The brightness of the color center can be enhanced by two orders of magnitude by altering the twist angle. Additionally, a brightness modulation of nearly 100% of this color center is achieved by an external voltage. Our ab-initio GW calculations suggest that the emission is correlated to nitrogen vacancies and that a twist-induced moiré potential facilitates electron-hole recombination. This mechanism is further exploited to draw nanoscale color center patterns using electron beams.

cond-mat.mtrl-sci↗

On circulant and skew-circulant splitting algorithms for (continuous) Sylvester equations

We present a circulant and skew-circulant splitting (CSCS) iterative method for solving large sparse continuous Sylvester equations $AX + XB = C$, where the coefficient matrices $A$ and $B$ are Toeplitz matrices. A theoretical study shows that if the circulant and skew-circulant splitting factors of $A$ and $B$ are positive semi-definite and at least one is positive definite (not necessarily Hermitian), then the CSCS method converges to the unique solution of the Sylvester equation. In addition, we obtain an upper bound for the convergence factor of the CSCS iteration. This convergence factor depends only on the eigenvalues of the circulant and skew-circulant splitting matrices. A computational comparison with alternative methods reveals the efficiency and reliability of the proposed method.

math.NA↗

Classical Simulation of Quantum Supremacy Circuits

It is believed that random quantum circuits are difficult to simulate classically. These have been used to demonstrate quantum supremacy: the execution of a computational task on a quantum computer that is infeasible for any classical computer. The task underlying the assertion of quantum supremacy by Arute et al. (Nature, 574, 505--510 (2019)) was initially estimated to require Summit, the world's most powerful supercomputer today, approximately 10,000 years. The same task was performed on the Sycamore quantum processor in only 200 seconds. In this work, we present a tensor network-based classical simulation algorithm. Using a Summit-comparable cluster, we estimate that our simulator can perform this task in less than 20 days. On moderately-sized instances, we reduce the runtime from years to minutes, running several times faster than Sycamore itself. These estimates are based on explicit simulations of parallel subtasks, and leave no room for hidden costs. The simulator's key ingredient is identifying and optimizing the "stem" of the computation: a sequence of pairwise tensor contractions that dominates the computational cost. This orders-of-magnitude reduction in classical simulation time, together with proposals for further significant improvements, indicates that achieving quantum supremacy may require a period of continuing quantum hardware developments without an unequivocal first demonstration.

quant-ph↗

Alibaba Cloud Quantum Development Platform: Surface Code Simulations with Crosstalk

We report, in a sequence of notes, our work on the Alibaba Cloud Quantum Development Platform (AC-QDP). AC-QDP provides a set of tools for aiding the development of both quantum computing algorithms and quantum processors, and is powered by a large-scale classical simulator deployed on Alibaba Cloud. In this note, we simulate a distance-3 logical qubit encoded in the 17-qubit surface code using experimental noise parameters for transmon qubits in a planar circuit QED architecture. Our simulation features crosstalk induced by ZZ-interactions. We show that at the current-stage noise levels, crosstalk contributes significantly to the dephasing of the logical qubit. This results in a total phase-flip probability of $\sim 0.6\%$, about $60\%$ higher than expected without considering crosstalk. This indicates that for the code considered, the current noise parameters approach, but do not yet meet, the break-even fault-tolerance regime.

quant-ph↗

Alibaba Cloud Quantum Development Platform: Large-Scale Classical Simulation of Quantum Circuits

We report, in a sequence of notes, our work on the Alibaba Cloud Quantum Development Platform(AC-QDP). AC-QDP provides a set of tools for aiding the development of both quantum computing algorithms and quantum processors, and is powered by a large-scale classical simulator deployed on Alibaba Cloud. In this note, we report the computational experiments demonstrating the classical simulation capability of AC-QDP. We use as a benchmark the random quantum circuits designed for Google's Bristlecone QPU {\cite{GRCS}}. We simulate Bristlecone-70 circuits with depth $1 + 32 + 1$ in $0.43$ second per amplitude, using $1449$ Alibaba Cloud Elastic Computing Service (ECS) instances, each with $88$ Intel Xeon(Skylake) Platinum 8163 vCPU cores @ 2.5 GHz and $160$ gigabytes of memory. By comparison, the previously best reported results for the same tasks are $104$ and $135$ seconds, using NASA's HPC Pleiades and Electra systems, respectively ({arXiv:1811.09599}). Furthermore, we report simulations of Bristlecone-70 with depth $1+36+1$ and depth $1+40+1$ in $5.6$ and $580.7$ seconds per amplitude, respectively. To the best of our knowledge, these are the first successful simulations of instances at these depths.

quant-ph↗

Alibaba Cloud Quantum Development Platform: Applications to Quantum Algorithm Design

We report our work on the Alibaba Cloud Quantum Development Platform (AC-QDP). The capability of AC-QDP's computational engine was already reported in \cite{CZH+18, ZHN+19}.In this follow-up article, we demonstrate with figures how AC-QDP helps in testing large-scale quantum algorithms (currently within the QAOA framework). We give new benchmark results on regular graphs. AC-QDP's QAOA framework can simulate thousands of qubits for up to $4$ layers. Then we discuss two interesting use cases we have implemented on the platform: 1. Optimal QAOA sequences for small-cycle free graphs; 2. Graph structure discovery.

quant-ph↗

Uncovering A Two-Dimensional Semiconductor with Intrinsic Ferromagnetism at Room Temperature

Two-dimensional materials have been gaining great attention as they displayed a broad series of electronic properties that ranging from superconductivity to topology. Among them, those which possess magnetism are most desirable, enabling us to manipulate charge and spin simultaneously. Here, based on first-principles calculation, we demonstrate monolayer chromium iodide arsenide (CrIAs), an undiscovered stable two-dimensional material, is an intrinsic ferromagnetic semiconductor with out-of-plane spin magnetization. The indirect bandgaps are predicted to be 0.32 eV for majority spin and 3.31 eV for minority spin, large enough to preserve semiconducting features at room temperature. Its Curie temperature, estimated by Heisenberg model with magnetic anisotropic energy using Monte Carlo method, is as high as 655 K that well above the room temperature, owing to strong direct exchange interaction between chromium d and iodine p orbitals. This work offers the affirmative answer of whether there exists two-dimensional ferromagnetic semiconductor at room temperature. And the practical realization of quantum spintronic devices, which have been suppressed because of lacking suitable room temperature magnetic materials, would embrace a great opportunity.

cond-mat.mtrl-sci↗

Optimizing T gates in Clifford+T circuit as $π/4$ rotations around Paulis

In this work, we introduce a new circuit optimization technique to reduce the number of T gates in Clifford+T circuits by treating T gates conjugated by Clifford gates as $\fracπ{4}$-rotations around Pauli operators. The tested benchmarks shows up to $71.43\%$ and an average $42.67\%$ reduction in T-count, both surpass the best performance reported. The worst case complexity of our algorithm is $O(nk^2)$ where $n$ is the number of qubits and $k$ is the number of T gates in the original Clifford+T circuit.

quant-ph↗

Fully Distributed DC Optimal Power Flow Based on Distributed Economic Dispatch and Distributed State Estimation

Optimal power flow (OPF) is an important technique for power systems to achieve optimal operation while satisfying multiple constraints. The traditional OPF are mostly centralized methods which are executed in the centralized control center. This paper introduces a totally Distributed DC Optimal Power Flow (DDCOPF) method for future power systems which have more and more distributed generators. The proposed method is based on the Distributed Economic Dispatch (DED) method and the Distributed State Estimation (DSE) method. In this proposed scheme, the DED method is used to achieve the optimal power dispatch with the lowest cost, and the DSE method provides power flow information of the power system to the proposed DDCOPF algorithm. In the proposed method, the Auto-Regressive (AR) model is used to predict the load variation so that the proposed algorithm can prevent overflow. In addition, a method called constraint algorithm is developed to correct the results of DED with the proposed correction algorithm and penalty term so that the constraints for the power system will not be violated. Different from existing research, the proposed method is completely distributed without need for any centralized facility.

eess.SY↗

OpenFermion: The Electronic Structure Package for Quantum Computers

Quantum simulation of chemistry and materials is predicted to be an important application for both near-term and fault-tolerant quantum devices. However, at present, developing and studying algorithms for these problems can be difficult due to the prohibitive amount of domain knowledge required in both the area of chemistry and quantum algorithms. To help bridge this gap and open the field to more researchers, we have developed the OpenFermion software package (www.openfermion.org). OpenFermion is an open-source software library written largely in Python under an Apache 2.0 license, aimed at enabling the simulation of fermionic models and quantum chemistry problems on quantum hardware. Beginning with an interface to common electronic structure packages, it simplifies the translation between a molecular specification and a quantum circuit for solving or studying the electronic structure problem on a quantum computer, minimizing the amount of domain expertise required to enter the field. The package is designed to be extensible and robust, maintaining high software standards in documentation and testing. This release paper outlines the key motivations behind design choices in OpenFermion and discusses some basic OpenFermion functionality which we believe will aid the community in the development of better quantum algorithms and tools for this exciting area of research.

quant-ph↗

Super-Exchange Theory for Polyvalent Anion Magnets

The Goodenough-Kanamori-Anderson (GKA) rules have been widely applied for explaining the magnetic properties induced by super-exchange interaction. As conclusions of the super-exchange theory, they reveal the antiferromagnetic (ferromagnetic) ordering along with bond angle of 180 degrees (90 degrees) in the cation-anion-cation interaction path, in which the theory sets a pre-condition that the electronic states of cations in all paths are identical. We observed that the GKA rules are in fact not universal and even invalid to materials containing anions with different valence states, for example, the layered CrOCl crystal (with two valence states of anions: O2- and Cl-). In this study, we propose an extended super-exchange theory (ESET) related to superposed electronic states of cation in a specific path. ESET is capable of predicting not only the sign and relative magnitude of magnetic exchange constants in different cation-anion-cation paths, but also the magnetic ground state. Through our proposed theory, we conclude that the magnetic ordering along with bond angle of 90 degrees in Cr-Cl-Cr path is moderately antiferromagnetic and of 180 degrees in Cr-O-Cr path is strongly ferromagnetic, which are opposite to the contents of GKA rules. Moreover, we clarify that monolayer CrOCl has antiferromagnetic ordering rather than ferromagnetic as reported recently. The reliability of ESET is verified via first-principles calculation and previous experimental report as well, and its universality is also demonstrated. Thus, our theory is powerful to predict the magnetic properties, which makes it possible to design new high Curie temperature two-dimensional semiconducting ferromagnets with polyvalent anion materials.

cond-mat.mtrl-sci↗