Search results

The disjointness of a stabilizer code is a quantity used to constrain the level of the logical Clifford hierarchy attainable by transversal gates and constant-depth quantum circuits. We show that for any positive integer constant c, the problem of calculating the c-disjointness, or even approximating it to within a constant multiplicative factor, is NP-complete. We provide bounds on the disjointness for

Quantum many-body systems involving bosonic modes or gauge fields have infinite-dimensional local Hilbert spaces which must be truncated to perform simulations of real-time dynamics on classical or quantum computers. To analyze the truncation error, we develop methods for bounding the rate of growth of local quantum numbers such as the occupation number of a mode at a lattice site, or the electric field

Quantum codes typically rely on large numbers of degrees of freedom to achieve low error rates. However each additional degree of freedom introduces a new set of error mechanisms. Hence minimizing the degrees of freedom that a quantum code utilizes is helpful. One quantum error correction solution is to encode quantum information into one or more bosonic modes. We revisit rotation-invariant bosonic codes

Characterizing the computational advantage from noisy intermediate-scale quantum (NISQ) devices is an important task from theoretical and practical perspectives. Here, we numerically investigate the computational power of NISQ devices focusing on boson sampling, one of the well-known promising problems which can exhibit quantum supremacy. We study hardness of lossy boson sampling using matrix product operator

We consider the problem of jointly estimating expectation values of many Pauli observables, a crucial subroutine in variational quantum algorithms. Starting with randomized measurements, we propose an efficient derandomization procedure that iteratively replaces random single-qubit measurements by fixed Pauli measurements; the resulting deterministic measurement procedure is guaranteed to perform at least

Localized electronic and nuclear spin qubits in the solid state constitute a promising platform for storage and manipulation of quantum information, even at room temperature. However, the development of scalable systems requires the ability to entangle distant spins, which remains a challenge today. We propose and analyze an efficient, heralded scheme that employs a parity measurement in a decoherence free

Forty years ago, Richard Feynman proposed harnessing quantum physics to build a more powerful kind of computer. Realizing Feynman's vision is one of the grand challenges facing 21st century science and technology. In this article, we'll recall Feynman's contribution that launched the quest for a quantum computer, and assess where the field stands 40 years later.

Classical machine learning (ML) provides a potentially powerful approach to solving challenging quantum many-body problems in physics and chemistry. However, the advantages of ML over more traditional methods have not been firmly established. In this work, we prove that classical ML algorithms can efficiently predict ground state properties of gapped Hamiltonians in finite spatial dimensions, after learning

Random quantum circuits have played a central role in establishing the computational advantages of near-term quantum computers over their conventional counterparts. Here, we use ensembles of low-depth random circuits with local connectivity in D ≥ 1 spatial dimensions to generate quantum error-correcting codes. For random stabilizer codes and the erasure channel, we find strong evidence that a depth O(log

We study the performance of classical and quantum machine learning (ML) models in predicting outcomes of physical experiments. The experiments depend on an input parameter x and involve execution of a (possibly unknown) quantum process E. Our figure of merit is the number of runs of E required to achieve a desired prediction performance. We consider classical ML models that perform a measurement and record

Decoherence and noise from optical absorption in superconducting circuits hinder development of microwave to optical quantum transducers. Addressing these issues, we fabricate niobium-based resonators and qubits, and study them under laser illumination at milliKelvin temperatures.

The promise of quantum computing with imperfect qubits relies on the ability of a quantum computing system to scale cheaply through error correction and fault tolerance. While fault tolerance requires relatively mild assumptions about the nature of qubit errors, the overhead associated with coherent and non-Markovian errors can be orders of magnitude larger than the overhead associated with purely stochastic

Cavity resonators are promising resources for quantum technology, while native nonlinear interactions for cavities are typically too weak to provide the level of quantum control required to deliver complex targeted operations. Here we investigate a scheme to engineer a target Hamiltonian for photonic cavities using ancilla qubits. By off resonantly driving dispersively coupled ancilla qubits, we develop

While designing the energy-momentum relation of photons is key to many linear, nonlinear, and quantum optical phenomena, a new set of light-matter properties may be realized by employing the topology of the photonic bath itself. In this work we experimentally investigate the properties of superconducting qubits coupled to a metamaterial waveguide based on a photonic analog of the Su-Schrieffer-Heeger model

Realizing the potential of quantum computing requires sufficiently low logical error rates(1). Many applications call for error rates as low as 10⁻¹⁵ (refs. 2,3,4,5,6,7,8,9), but state-of-the-art quantum platforms typically have physical error rates near 10⁻³ (refs. 10,11,12,13,14). Quantum error correction(15,16,17) promises to bridge this divide by distributing quantum logical information across many

The estimation of multiple parameters in quantum metrology is important for a vast array of applications in quantum information processing. However, the unattainability of fundamental precision bounds for incompatible observables greatly diminishes the applicability of estimation theory in many practical implementations. The Holevo Cramér-Rao bound (HCRB) provides the most fundamental, simultaneously attainable

Near-term quantum computers are noisy, and therefore must run algorithms with a low circuit depth and qubit count. Here we investigate how noise affects a quantum neural network (QNN) for state discrimination, which is applicable on near-term quantum devices as it fulfils the above criteria. We find that for the required gradient calculation on a noisy device a quantum circuit with a large number of parameters

In membership/subscriber acquisition and retention, we sometimes need to recommend marketing content for multiple pages in sequence. Different from general sequential decision making process, the use cases have a simpler flow where customers per seeing recommended content on each page can only return feedback as moving forward in the process or dropping from it until a termination state. We refer to this

Query rewriting (QR) is an increasingly important technique for reducing user friction in a conversational AI system. User friction is caused by various reasons, including errors in automatic speech recognition (ASR), natural language understanding (NLU), entity resolution (ER) component, or users’ slip of the tongue. In this work, we propose a search-based self-learning QR framework: User Feedback Search

We consider the problem of topic-focused abstractive summarization, where the goal is to generate an abstractive summary focused on a particular topic, a phrase of one or multiple words. We hypothesize that the task of generating topic-focused summaries can be improved by showing the model what it must not focus on. We introduce a deep reinforcement learning approach to topic-focused abstractive summarization