English
Related papers

Related papers: Implementation of a general single-qubit positive …

200 papers

We study minimum-error identification of an unknown single-bit Boolean function given black-box (oracle) access with one allowed query. Rather than stopping at an abstract optimal measurement, we give a fully constructive solution: an…

Quantum Physics · Physics 2025-12-19 Leonardo Bohac

According to the statistical interpretation of quantum theory, quantum computers form a distinguished class of probabilistic machines (PMs) by encoding n qubits in 2n pbits (random binary variables). This raises the possibility of a…

Quantum Physics · Physics 2007-05-23 P. Gralewicz

Optimal and finite positive operator valued measurements on a finite number $N$ of identically prepared systems have been presented recently. With physical realization in mind we propose here optimal and minimal generalized quantum…

Quantum Physics · Physics 2009-10-31 J. I. Latorre , P. Pascual , R. Tarrach

Neutral atom quantum processors provide a viable route to scalable quantum computing, with recent demonstrations of high-fidelity and parallel gate operations and initial implementation of quantum algorithms using both physical and logical…

Quantum Physics · Physics 2024-02-06 K. McInroy , N. Pearson , J. D. Pritchard

We report a deterministic and exact protocol to reverse any unknown qubit-unitary operation, which simulates the time inversion of a closed qubit system. To avoid known no-go results on universal deterministic exact unitary inversion, we…

Quantum Physics · Physics 2023-09-21 Satoshi Yoshida , Akihito Soeda , Mio Murao

Quantum discord is a measure based on local projective measurements which captures quantum correlations that may not be fully captured by entanglement. A change in the measurement process, achieved by replacing rank-one projectors with a…

Quantum Physics · Physics 2020-08-17 Akanksha Gautam , Varad R. Pande , Amandeep Singh , Kavita Dorai , Arvind

The first generation of small noisy quantum processors have recently become available to non-specialists who are not required to understand specifics of the physical platforms and, in particular, the types and sources of noise. As such, it…

Quantum Physics · Physics 2019-05-16 Oktay Göktaş , W. K. Tham , Kent Bonsma-Fisher , Aharon Brodutch

Applying post selection in each step of an iterated protocol leads to sensitive quantum dynamics that may be utilized to test and benchmark current quantum computers. An example of this type of protocols was originally proposed for the task…

Quantum Physics · Physics 2024-10-10 Adrian Ortega , Orsolya Kálmán , Tamás Kiss

Current universal quantum computers have a limited number of noisy qubits. Because of this, it is difficult to use them to solve large-scale complex optimization problems. In this paper we tackle this issue by proposing a quantum…

Quantum Physics · Physics 2023-06-30 Pablo Bermejo , Roman Orus

We present a measurement protocol for discriminating between two different quantum states of a qubit with high fidelity. The protocol, called null value, is comprised of a projective measurement performed on the system with a small…

Variational Quantum Algorithms (VQAs) have emerged as a powerful class of algorithms that is highly suitable for noisy quantum devices. Therefore, investigating their design has become key in quantum computing research. Previous works have…

There has been a strong recent interest in applying quantum mechanics (QM) outside physics, including in cognitive science. We analyze the applicability of QM to two basic properties in opinion polling. The first property (response…

Neurons and Cognition · Quantitative Biology 2017-02-08 Andrei Khrennikov , Irina Basieva , Ehtibar N. Dzhafarov , Jerome R. Busemeyer

Quantum computers with tens to hundreds of noisy qubits are being developed today. To be useful for real-world applications, we believe that these near-term systems cannot simply be scaled-down non-error-corrected versions of future…

Medium-scale quantum devices that integrate about hundreds of physical qubits are likely to be developed in the near future. However, such devices will lack the resources for realizing quantum fault tolerance. Therefore, the main challenge…

Quantum Physics · Physics 2021-12-24 Chao Song , Jing Cui , H. Wang , J. Hao , H. Feng , Ying Li

Suppose we measure the time-dependent spectrum of a single photon. That is, we first send the photon through a set of frequency filters (which we assume to have different filter frequencies but the same finite bandwidth $\Gamma$), and then…

Quantum Physics · Physics 2017-09-27 S. J. van Enk

Analog quantum simulation is expected to be a significant application of near-term quantum devices. Verification of these devices without comparison to known simulation results will be an important task as the system size grows beyond the…

Quantum Physics · Physics 2021-03-04 Ryan Shaffer , Eli Megidish , Joseph Broz , Wei-Ting Chen , Hartmut Häffner

As far as we know, a useful quantum computer will require fault-tolerant gates, and existing schemes demand a prohibitively large space and time overhead. We argue that a first generation quantum computer will be very valuable to design,…

Quantum Physics · Physics 2017-11-15 Pavithran S. Iyer , David Poulin

Generalized quantum measurements (POVMs or POMs) are important for optimally extracting information for quantum communication and computation. The standard realization via the Neumark extension requires extensive resources in the form of…

Quantum Physics · Physics 2009-11-13 Erika Andersson , Daniel K. L. Oi

Performing experiments on small-scale quantum computers is certainly a challenging endeavor. Many parameters need to be optimized to achieve high-fidelity operations. This can be done efficiently for operations acting on single qubits as…

Quantum Physics · Physics 2016-08-31 M. Müller , A. Rivas , E. A. Martínez , D. Nigg , P. Schindler , T. Monz , R. Blatt , M. A. Martin-Delgado

The aim of this paper is to build quantum circuits that implement discrete-time quantum walks having an arbitrary position-dependent coin operator. The position of the walker is encoded in base 2: with $n$ wires, each corresponding to one…

‹ Prev 1 8 9 10 Next ›