Set Of Quantum Research Articles

Computing in terms of Takeuti's Quantum Set Theory

Computing in terms of Takeuti's Quantum Set Theory

Information Causality as a Tool for Bounding the Set of Quantum Correlations.

Information causality was initially proposed as a physical principle aimed at deriving the predictions of quantum mechanics on the type of correlations observed in the Bell experiment. In the same work, information causality was famously shown to imply the Uffink inequality that approximates the set of quantum correlations and rederives Tsirelson's bound of the Clauser-Horne-Shimony-Holt inequality. This result found limited generalizations due to the difficulty of deducing implications of the information causality principle on the set of nonlocal correlations. In this Letter, we present a simple technique for obtaining polynomial inequalities from information causality bounding the set of physical correlations in any bipartite Bell scenario. This result makes information causality an efficient tool for approximating the set of quantum correlations. To demonstrate our method, we derive a family of inequalities which nontrivially constrains the set of nonlocal correlations in Bell scenarios with binary outcomes and equal number of measurement settings. Finally, we propose an improved statement of the information causality principle and obtain a tighter constraint for the simplest Bell scenario that goes beyond the Uffink inequality and recovers a part of the boundary of the quantum set.

Fully‐Optimized Quantum Metrology: Framework, Tools, and Applications

AbstractThis tutorial introduces a systematic approach for addressing the key question of quantum metrology: For a generic task of sensing an unknown parameter, what is the ultimate precision given a constrained set of admissible strategies. The approach outputs the maximal attainable precision (in terms of the maximum of quantum Fisher information) as a semidefinite program and optimal strategies as feasible solutions thereof. Remarkably, the approach can identify the optimal precision for different sets of strategies, including parallel, sequential, quantum SWITCH‐enhanced, causally superposed, and generic indefinite‐causal‐order strategies. The tutorial consists of a pedagogic introduction to the background and mathematical tools of optimal quantum metrology, a detailed derivation of the main approach, and various concrete examples. As shown in the tutorial, applications of the approach include, but are not limited to, strict hierarchy of strategies in noisy quantum metrology, memory effect in non‐Markovian metrology, and designing optimal strategies. Compared with traditional approaches, the approach here yields the exact value of the optimal precision, offering more accurate criteria for experiments and practical applications. It also allows for the comparison between conventional strategies and the recently discovered causally‐indefinite strategies, serving as a powerful tool for exploring this new area of quantum metrology.

Modeling the unphysical pseudomode model with physical ensembles: Simulation, mitigation, and restructuring of non-Markovian quantum noise

The influence of a Gaussian environment on a quantum system can be described by effectively replacing the continuum with a discrete set of ancillary quantum and classical degrees of freedom. This defines a pseudomode model which can be used to classically simulate the reduced system dynamics. Here we consider an alternative point of view and analyze the potential benefits of an analog or digital quantum simulation of the pseudomode model itself. Superficially, such a direct experimental implementation is, in general, impossible due to the unphysical properties of the effective degrees of freedom involved. However, we show that the effects of the unphysical pseudomode model can still be reproduced using measurement results over an ensemble of physical systems involving ancillary harmonic modes and an optional stochastic driving field. This is done by introducing an extrapolation technique whose efficiency is limited by stability against imprecision in the measurement data. We examine how such a simulation would allow us to (i) perform a quantum simulation of the effects of complex nonperturbative and non-Markovian environments in regimes that are challenging for classical simulation; (ii) conversely, mitigate potential unwanted non-Markovian noise present in quantum devices; and (iii) restructure some of the properties of a given physical bath, such as its temperature. Published by the American Physical Society 2024

Extremal Tsirelson Inequalities.

It is well known that the set of statistics that can be observed in a Bell-type experiment is limited by quantum theory. Unfortunately, tools are missing to identify the precise boundary of this set. Here, we propose to study the set of quantum statistics from a dual perspective. By considering all Bell expressions saturated by a given realization, we show that the Clauser-Horne-Shimony-Holt expression can be decomposed in terms of extremal Tsirelson inequalities that we identify. This brings novel insight into the geometry of the quantum set in the (2,2,2) scenario. Furthermore, this allows us to identify all the Bell expressions that are able to self-test the Tsirelson realization.

Designing of Reversible Functions in Classical and Quantum Domains

First sections of the paper contain some considerations relevant to the reversibility of quantum gates. The Solovay-Kitayev theorem shows that using proper set of quantum gates one can build a quantum version of the nondeterministic Turing machine. On the other hand the Gottesmann-Knill theorem shows the possibility to simulate the quantum machine consisting of only Clifford/Pauli group of gates. This paper presents also an original method of designing the reversible functions. This method is intended for the most popular gate set with three types of gates CNT (Control, NOT and Toffoli). The presented algorithm leads to cascade with minimal number CNT gates. This solution is called optimal reversible circuits. The paper is organized as follows. Section 5 recalls basic concepts of reversible logic. Section 6 contain short description of CNT set of the reversible gates. In Section 7 is presented form of result of designing as the cascade of gates. Section 8 describes the algorithm and section 9 simple example.

Logical Platforms for Mobile Application in Decision Support Systems Based on Color Information Processing

Logical Platforms for Mobile Application in Decision Support Systems Based on Color Information Processing

The quantum maxima for the basic graphs of exclusivity are not reachable in Bell scenarios.

A necessary condition for the probabilities of a set of events to exhibit Bell non-locality or Kochen-Specker contextuality is that the graph of exclusivity of the events contains induced odd cycles with five or more vertices, called odd holes, or their complements, called odd antiholes. From this perspective, events whose graph of exclusivity are odd holes or antiholes are the building blocks of contextuality. For any odd hole or antihole, any assignment of probabilities allowed by quantum theory can be achieved in specific contextuality scenarios. However, here we prove that, for any odd hole, the probabilities that attain the quantum maxima cannot be achieved in Bell scenarios. We also prove it for the simplest odd antiholes. This leads us to the conjecture that the quantum maxima for any of the building blocks cannot be achieved in Bell scenarios. This result sheds light on why the problem of whether a probability assignment is quantum is decidable, while whether a probability assignment within a given Bell scenario is quantum is, in general, undecidable. This also helps to understand why identifying principles for quantum correlations is simpler when we start by identifying principles for quantum sets of probabilities defined with no reference to specific scenarios. This article is part of the theme issue 'Quantum contextuality, causality and freedom of choice'.

On Photonic Implementation of Quantum Computers

The first section of the work investigates light modes as a means of implementing optical qubits and qudits. The modes considered are polarization mode, path mode, transverse spatial mode, frequency mode, temporal bin-mode and temporal mode. Subsequently, mathematical model of linear optical elements like beam splitters (BS) and phase shifters are deduced and their capability of representing any single qubit optical gate is exposed. Finally Knill, Laflamme and Milburn (KLM) method of using linear optical elements to promote nonlinear operations based on nonlinear (nondeterministic) sign-flip gate (NS) is explained, and designs of two qubits conditional sign flip gate (c-z1/16) and CNOT gate, both based on KLM method, are demonstrated. So, universal set of quantum gates based on linear optics is possible.

Logical Characterization of Contextual Hidden-Variable Theories based on Quantum Set Theory

Logical Characterization of Contextual Hidden-Variable Theories based on Quantum Set Theory

The geometry of discrete L-algebras

Abstract The relationship of discrete L-algebras to projective geometry is deepened and made explicit in several ways. Firstly, a geometric lattice is associated to any discrete L-algebra. Monoids of I-type are obtained as a special case where the perspectivity relation is trivial. Secondly, the structure group of a non-degenerate discrete L-algebra X is determined and shown to be a complete invariant. It is proved that X ∖ {1} is a projective space with an orthogonality relation. A new definition of non-symmetric quantum sets, extending the recursive definition of symmetric quantum sets, is provided and shown to be equivalent to the former one. Quantum sets are characterized as complete projective spaces with an anisotropic duality, and they are also characterized in terms of their complete lattice of closed subspaces, which is one-sided orthomodular and semimodular. For quantum sets of finite cardinality n > 3, a representation as a projective space with duality over a skew-field is given. Quantum sets of cardinality 2 are classified, and the structure group of their associated L-algebra is determined.

Modularized and scalable compilation for double quantum dot quantum computing

Any quantum program on a realistic quantum device must be compiled into an executable form while taking into account the underlying hardware constraints. Stringent restrictions on architecture and control imposed by physical platforms make this very challenging. In this paper, based on the quantum variational algorithm, we propose a novel scheme to train an Ansatz circuit and realize high-fidelity compilation of a set of universal quantum gates for singlet-triplet qubits in semiconductor double quantum dots, a fairly heavily constrained system. Furthermore, we propose a scalable architecture for a modular implementation of quantum programs in this constrained systems and validate its performance with two representative demonstrations, the Grover’s algorithm for the database searching (static compilation) and a variant of variational quantum eigensolver for the Max-Cut optimization (dynamic compilation). Our methods are potentially applicable to a wide range of physical devices. This work constitutes an important stepping-stone for exploiting the potential for advanced and complicated quantum algorithms on near-term devices.

De Finetti Theorems for Quantum Conditional Probability Distributions with Symmetry

The aim of device-independent quantum key distribution (DIQKD) is to study protocols that allow the generation of a secret shared key between two parties under minimal assumptions on the devices that produce the key. These devices are merely modeled as black boxes and mathematically described as conditional probability distributions. A major obstacle in the analysis of DIQKD protocols is the huge space of possible black box behaviors. De Finetti theorems can help to overcome this problem by reducing the analysis to black boxes that have an iid structure. Here we show two new de Finetti theorems that relate conditional probability distributions in the quantum set to de Finetti distributions (convex combinations of iid distributions) that are themselves in the quantum set. We also show how one of these de Finetti theorems can be used to enforce some restrictions onto the attacker of a DIQKD protocol. Finally we observe that some desirable strengthenings of this restriction, for instance to collective attacks only, are not straightforwardly possible.

Extending the coherence of spin defects in hBN enables advanced qubit control and quantum sensing

Negatively-charged boron vacancy centers ({{V}_{B}}^{-}) in hexagonal Boron Nitride (hBN) are attracting increasing interest since they represent optically-addressable qubits in a van der Waals material. In particular, these spin defects have shown promise as sensors for temperature, pressure, and static magnetic fields. However, their short spin coherence time limits their scope for quantum technology. Here, we apply dynamical decoupling techniques to suppress magnetic noise and extend the spin coherence time by two orders of magnitude, approaching the fundamental T1 relaxation limit. Based on this improvement, we demonstrate advanced spin control and a set of quantum sensing protocols to detect radiofrequency signals with sub-Hz resolution. The corresponding sensitivity is benchmarked against that of state-of-the-art NV-diamond quantum sensors. This work lays the foundation for nanoscale sensing using spin defects in an exfoliable material and opens a promising path to quantum sensors and quantum networks integrated into ultra-thin structures.

Solving quantum circuit compilation problem variants through genetic algorithms

The gate-based model is one of the leading quantum computing paradigms for representing quantum circuits. Within this paradigm, a quantum algorithm is expressed in terms of a set of quantum gates that are executed on the quantum hardware over time, subject to a number of constraints whose satisfaction must be guaranteed before running the circuit, to allow for feasible execution. The need to guarantee the previous feasibility condition gives rise to the Quantum Circuit Compilation Problem (QCCP). The QCCP has been demonstrated to be NP-Complete, and can be considered as a Planning and Scheduling problem. In this paper, we consider quantum compilation instances deriving from the general Quantum Approximation Optimization Algorithm (QAOA), applied to the MaxCut problem, devised to be executed on Noisy Intermediate Scale Quantum (NISQ) hardware architectures. More specifically, in addition to the basic QCCP version, we also tackle other variants of the same problem such as the QCCP-X (QCCP with crosstalk constraints), the QCCP-V (QCCP with variable qubit state initialization), as well as the QCCP-VX that includes both previous variants. All problem variants are solved using genetic algorithms. We perform an experimental study across a conventional set of instances taken from the literature, and show that the proposed genetic algorithm, termed GA_{VX}, outperforms previous approaches in the literature.

Multi-qubit quantum computing using discrete-time quantum walks on closed graphs

Universal quantum computation can be realised using both continuous-time and discrete-time quantum walks. We present a version based on single particle discrete-time quantum walk to realize multi-qubit computation tasks. The scalability of the scheme is demonstrated by using a set of walk operations on a closed lattice form to implement the universal set of quantum gates on multi-qubit system. We also present a set of experimentally realizable walk operations that can implement Grover’s algorithm, quantum Fourier transformation and quantum phase estimation algorithms. An elementary implementation of error detection and correction is also presented. Analysis of space and time complexity of the scheme highlights the advantages of quantum walk based model for quantum computation on systems where implementation of quantum walk evolution operations is an inherent feature of the system.

Extremal points of the quantum set in the Clauser-Horne-Shimony-Holt scenario: Conjectured analytical solution

Extremal points of the quantum set in the Clauser-Horne-Shimony-Holt scenario: Conjectured analytical solution

Quantum correlations on the no-signaling boundary: self-testing and more

In device-independent quantum information, correlations between local measurement outcomes observed by spatially separated parties in a Bell test play a fundamental role. Even though it is long-known that the set of correlations allowed in quantum theory lies strictly between the Bell-local set and the no-signaling set, many questions concerning the geometry of the quantum set remain unanswered. Here, we revisit the problem of when the boundary of the quantum set coincides with the no-signaling set in the simplest Bell scenario. In particular, for each Class of these common boundaries containing k zero probabilities, we provide a (5−k)-parameter family of quantum strategies realizing these (extremal) correlations. We further prove that self-testing is possible in all nontrivial Classes beyond the known examples of Hardy-type correlations, and provide numerical evidence supporting the robustness of these self-testing results. Candidates of one-parameter families of self-testing correlations from some of these Classes are identified. As a byproduct of our investigation, if the qubit strategies leading to an extremal nonlocal correlation are local-unitarily equivalent, a self-testing statement provably follows. Interestingly, all these self-testing correlations found on the no-signaling boundary are provably non-exposed. An analogous characterization for the set M of quantum correlations arising from finite-dimensional maximally entangled states is also provided. En route to establishing this last result, we show that all correlations of M in the simplest Bell scenario are attainable as convex combinations of those achievable using a Bell pair and projective measurements. In turn, we obtain the maximal Clauser-Horne-Shimony-Holt Bell inequality violation by any maximally entangled two-qudit state and a no-go theorem regarding the self-testing of such states.

A NATURAL DEDUCTION SYSTEM FOR ORTHOMODULAR LOGIC

AbstractOrthomodular logic is a weakening of quantum logic in the sense of Birkhoff and von Neumann. Orthomodular logic is shown to be a nonlinear noncommutative logic. Sequents are given a physically motivated semantics that is consistent with exactly one semantics for propositional formulas that use negation, conjunction, and implication. In particular, implication must be interpreted as the Sasaki arrow, which satisfies the deduction theorem in this logic. As an application, this deductive system is extended to two systems of predicate logic: the first is sound for Takeuti’s quantum set theory, and the second is sound for a variant of Weaver’s quantum logic.

Comment on “Geometry of the quantum set on no-signaling faces”

In Ref. [1] the authors claim that the Almost Quantum set of correlations cannot reproduce two points on the boundary of the quantum set of correlations. This claim is incorrect. The underlying issue is that the associated SDP is not strictly feasible, which makes the numerical solvers give unreliable answers. We give analytical proofs that both points are indeed reproduced by Almost Quantum.