arXiv subjects

Jianxin Chen

Publications and source records attributed to Jianxin Chen.

At least 55 records · Page 3Linked to original sources

arXiv2020

High-speed InAs/GaSb Mid-Wave Infrared Interband Cascade Photodetector at Room Temperature

High speed mid-wave infrared (MWIR) photodetectors have important applications in the emerging areas such high-precision frequency comb spectroscopy and light detection and ranging (LIDAR). In this work, we report a high-speed room-temperature mid-wave infrared interband cascade photodetector (ICIP) based on a type-II InAs/GaSb superlattice. The devices show an optical cut-off wavelength around 5um and a 3-dB bandwidth up to 7.04 GHz. The relatively low dark current density around 9.39 x 10-2 A/cm2 under -0.1 V is also demonstrated at 300 K. These results validate the advantages of ICIPs to achieve both high-frequency operation and low noise at room temperature. Limitations on the high-speed performance of the detector are also discussed based on the S-parameter analysis and other RF performance measurement.

physics.app-ph↗

arXiv2020

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↗

arXiv2020

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↗

arXiv2020

The Solar Probe ANalyzers -- Electrons on Parker Solar Probe

Electrostatic analyzers of different designs have been used since the earliest days of the space age, beginning with the very earliest solar wind measurements made by Mariner 2 en route to Venus in 1962. The Parker Solar Probe (PSP) mission, NASA's first dedicated mission to study the innermost reaches of the heliosphere, makes its thermal plasma measurements using a suite of instruments called the Solar Wind Electrons, Alphas, and Protons (SWEAP) investigation. SWEAP's electron Parker Solar Probe Analyzer (SPAN-E) instruments are a pair of top-hat electrostatic analyzers on PSP that are capable of measuring the electron distribution function in the solar wind from 2 eV to 30 keV. For the first time, in-situ measurements of thermal electrons provided by SPAN-E will help reveal the heating and acceleration mechanisms driving the evolution of the solar wind at the points of acceleration and heating, closer than ever before to the Sun. This paper details the design of the SPAN-E sensors and their operation, data formats, and measurement caveats from Parker Solar Probe's first two close encounters with the Sun.

astro-ph.IM↗

arXiv2020

Graph-FCN for image semantic segmentation

Semantic segmentation with deep learning has achieved great progress in classifying the pixels in the image. However, the local location information is usually ignored in the high-level feature extraction by the deep learning, which is important for image semantic segmentation. To avoid this problem, we propose a graph model initialized by a fully convolutional network (FCN) named Graph-FCN for image semantic segmentation. Firstly, the image grid data is extended to graph structure data by a convolutional network, which transforms the semantic segmentation problem into a graph node classification problem. Then we apply graph convolutional network to solve this graph node classification problem. As far as we know, it is the first time that we apply the graph convolutional network in image semantic segmentation. Our method achieves competitive performance in mean intersection over union (mIOU) on the VOC dataset(about 1.34% improvement), compared to the original FCN model.

cs.CV↗

arXiv2019

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↗

arXiv2019

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↗

arXiv2019

High Speed Mid-Infrared Interband Cascade Photodetector Based on InAs/GaSb Type-II Superlattice

High speed mid-wave infrared (MWIR) photodetectors have applications in the areas such as free space optical communication and frequency comb spectroscopy. However, most of the research on the MWIR photodetectors is focused on how to increase the quantum efficiency and reduce the dark current, in order to improve the detectivity (D*), and the 3dB bandwidth performance of the corresponding MWIR photodetectors is still not fully studied. In this work, we report and characterize a MWIR interband cascade photodetector based on InAs/GaSb type-II superlattice with a 50% cutoff wavelength at ~5.3 um at 300 K. The 3 dB cutoff frequency is 2.4 GHz at 300 K, for a 40 μm circular diameter device under -5 V applied bias. Limitations on the detector high speed performance are also discussed.High speed mid-wave infrared (MWIR) photodetectors have applications in the areas such as free space optical communication and frequency comb spectroscopy. However, most of the research on the MWIR photodetectors is focused on how to increase the quantum efficiency and reduce the dark current, in order to improve the detectivity (D*), and the 3dB bandwidth performance of the corresponding MWIR photodetectors is still not fully studied. In this work, we report and characterize a MWIR interband cascade photodetector based on InAs/GaSb type-II superlattice with a 50% cutoff wavelength at ~5.3 um at 300 K. The 3 dB cutoff frequency is 2.4 GHz at 300 K, for a 40 um circular diameter device under -5 V applied bias. Limitations on the detector high speed performance are also discussed.

physics.app-ph↗

arXiv2019

A Finite Presentation of CNOT-Dihedral Operators

We give a finite presentation by generators and relations of the unitary operators expressible over the {CNOT, T, X} gate set, also known as CNOT-dihedral operators. To this end, we introduce a notion of normal form for CNOT-dihedral circuits and prove that every CNOT-dihedral operator admits a unique normal form. Moreover, we show that in the presence of certain structural rules only finitely many circuit identities are required to reduce an arbitrary CNOT-dihedral circuit to its normal form. By appropriately restricting our relations, we obtain a finite presentation of unitary operators expressible over the {CNOT, T} gate set as a corollary.

quant-ph↗

arXiv2019

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↗

arXiv2018

Minimum Entangling Power is Close to Its Maximum

Given a quantum gate $U$ acting on a bipartite quantum system, its maximum (average, minimum) entangling power is the maximum (average, minimum) entanglement generation with respect to certain entanglement measure when the inputs are restricted to be product states. In this paper, we mainly focus on the 'weakest' one, i.e., the minimum entangling power, among all these entangling powers. We show that, by choosing von Neumann entropy of reduced density operator or Schmidt rank as entanglement measure, even the 'weakest' entangling power is generically very close to its maximal possible entanglement generation. In other words, maximum, average and minimum entangling powers are generically close. We then study minimum entangling power with respect to other Lipschitiz-continuous entanglement measures and generalize our results to multipartite quantum systems. As a straightforward application, a random quantum gate will almost surely be an intrinsically fault-tolerant entangling device that will always transform every low-entangled state to near-maximally entangled state.

quant-ph↗

arXiv2018

Local density matrices of many-body states in the constant weight subspaces

Let $V=\bigotimes_{k=1}^{N} V_{k}$ be the $N$ spin-$j$ Hilbert space with $d=2j+1$-dimensional single particle space. We fix an orthonormal basis $\{|m_i\rangle\}$ for each $V_{k}$, with weight $m_i\in \{-j,\ldots j\}$. Let $V_{(w)}$ be the subspace of $V$ with a constant weight $w$, with an orthonormal basis $\{|m_1,\ldots,m_N\rangle\}$ subject to $\sum_k m_k=w$. We show that the combinatorial properties of the constant weight condition imposes strong constraints on the reduced density matrices for any vector $|ψ\rangle$ in the constant weight subspace, which limits the possible entanglement structures of $|ψ\rangle$. Our results find applications in the overlapping quantum marginal problems, quantum error-correcting codes, and the spin-network structures in quantum gravity.

quant-ph↗

arXiv2018

Classical Simulation of Intermediate-Size Quantum Circuits

We introduce a distributed classical simulation algorithm for general quantum circuits, and present numerical results for calculating the output probabilities of universal random circuits. We find that we can simulate more qubits to greater depth than previously reported using the cluster supported by the Data Infrastructure and Search Technology Division of the Alibaba Group. For example, computing a single amplitude of an $8\times 8$ qubit circuit with depth $40$ was previously beyond the reach of supercomputers. Our algorithm can compute this within $2$ minutes using a small portion ($\approx$ 14% of the nodes) of the cluster. Furthermore, by successfully simulating quantum supremacy circuits of size $9\times 9\times 40$, $10\times 10\times 35 $, $11\times 11\times 31$, and $12\times 12\times 27 $, we give evidence that noisy random circuits with realistic physical parameters may be simulated classically. This suggests that either harder circuits or error-correction may be vital for achieving quantum supremacy from random circuit sampling.

quant-ph↗

arXiv2018

Multiparty quantum data hiding with enhanced security and remote deletion

One of the applications of quantum technology is to use quantum states and measurements to communicate which offers more reliable security promises. Quantum data hiding, which gives the source party the ability of sharing data among multiple receivers and revealing it at a later time depending on his/her will, is one of the promising information sharing schemes which may address practical security issues. In this work, we propose a novel quantum data hiding protocol. By concatenating different subprotocols which apply to rather symmetric hiding scenarios, we cover a variety of more general hiding scenarios. We provide the general requirements for constructing such protocols and give explicit examples of encoding states for five parties. We also proved the security of the protocol in sense that the achievable information by unauthorized operations asymptotically goes to zero. In addition, due to the capability of the sender to manipulate his/her subsystem, the sender is able to abort the protocol remotely at any time before he/she reveals the information.

quant-ph↗

arXiv2018

Quantum algorithm for multivariate polynomial interpolation

How many quantum queries are required to determine the coefficients of a degree-$d$ polynomial in $n$ variables? We present and analyze quantum algorithms for this multivariate polynomial interpolation problem over the fields $\mathbb{F}_q$, $\mathbb{R}$, and $\mathbb{C}$. We show that $k_{\mathbb{C}}$ and $2k_{\mathbb{C}}$ queries suffice to achieve probability $1$ for $\mathbb{C}$ and $\mathbb{R}$, respectively, where $k_{\mathbb{C}}=\smash{\lceil\frac{1}{n+1}{n+d\choose d}\rceil}$ except for $d=2$ and four other special cases. For $\mathbb{F}_q$, we show that $\smash{\lceil\frac{d}{n+d}{n+d\choose d}\rceil}$ queries suffice to achieve probability approaching $1$ for large field order $q$. The classical query complexity of this problem is $\smash{n+d\choose d}$, so our result provides a speedup by a factor of $n+1$, $\frac{n+1}{2}$, and $\frac{n+d}{d}$ for $\mathbb{C}$, $\mathbb{R}$, and $\mathbb{F}_q$, respectively. Thus we find a much larger gap between classical and quantum algorithms than the univariate case, where the speedup is by a factor of $2$. For the case of $\mathbb{F}_q$, we conjecture that $2k_{\mathbb{C}}$ queries also suffice to achieve probability approaching $1$ for large field order $q$, although we leave this as an open problem.

quant-ph↗

arXiv2018

Quantum State Tomography for Generic Pure States

We show that a generic $N$-qudit pure quantum state is uniquely determined by only $2$ of its $\lceil\frac{N+1}{2}\rceil$-particle reduced density matrices. Therefore we give a method to uniquely determine a generic $N$-qudit pure state of dimension $D=d^N$ with $O(D)$ local measurements, which is an improvement comparing with the previous known approach using $O(D\log^2 D)$ or $O(D\log D)$ measurements.

quant-ph↗

arXiv2017

A Characterization of Antidegradable Qubit Channels

This paper provides a characterization for the set of antidegradable qubit channels. The characterization arises from the correspondence between the antidegradability of a channel and the symmetric extendibility of its Choi operator. Using an inequality derived to describe the set of bipartite qubit states which admit symmetric extension, we are able to characterize the set of all antidegradable qubit channels. Using the characterization we investigate the antidegradability of unital qubit channels and arbitrary qubit channels with respect to the dimension of the environment. We additionally provide a condition which describes qubit channels which are simultaneously degradable and antidegradable along with a classification of self-complementary qubit channels.

quant-ph↗

arXiv2017

A Separability-Entanglement Classifier via Machine Learning

The problem of determining whether a given quantum state is entangled lies at the heart of quantum information processing, which is known to be an NP-hard problem in general. Despite the proposed many methods such as the positive partial transpose (PPT) criterion and the k-symmetric extendibility criterion to tackle this problem in practice, none of them enables a general, effective solution to the problem even for small dimensions. Explicitly, separable states form a high-dimensional convex set, which exhibits a vastly complicated structure. In this work, we build a new separability-entanglement classifier underpinned by machine learning techniques. Our method outperforms the existing methods in generic cases in terms of both speed and accuracy, opening up the avenues to explore quantum entanglement via the machine learning approach.

quant-ph↗