Arbitrary Quantum State Research Articles

Statistical Signatures of Quantum Contextuality.

Quantum contextuality describes situations where the statistics observed in different measurement contexts cannot be explained by a measurement of the independent reality of the system. The most simple case is observed in a three-dimensional Hilbert space, with five different measurement contexts related to each other by shared measurement outcomes. The quantum formalism defines the relations between these contexts in terms of well-defined relations between operators, and these relations can be used to reconstruct an unknown quantum state from a finite set of measurement results. Here, I introduce a reconstruction method based on the relations between the five measurement contexts that can violate the bounds of non-contextual statistics. A complete description of an arbitrary quantum state requires only five of the eight elements of a Kirkwood-Dirac quasiprobability, but only an overcomplete set of eleven elements provides an unbiased description of all five contexts. A set of five fundamental relations between the eleven elements reveals a deterministic structure that links the five contexts. As illustrated by a number of examples, these relations provide a consistent description of contextual realities for the measurement outcomes of all five contexts.

Quantum multi-state Swap Test: an algorithm for estimating overlaps of arbitrary number quantum states

Estimating the overlap between two states is an important task with several applications in quantum information. However, the typical swap test circuit can only measure a sole pair of quantum states at a time. In this study, a recursive quantum circuit is designed to measure overlaps of n quantum states |ϕ1〉,|ϕ2〉,…|ϕn〉\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$\\left | {\\phi _{1} } \\right \\rangle ,\\left | {\\phi _{2} } \\right \\rangle ,\\ldots\\left | {\\phi _{n} }\\right \\rangle $\\end{document} concurrently with O(k2k)\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$O(k2^{k})$\\end{document} controlled-swap(CSWAP) gates and O(k)\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$O(k)$\\end{document} ancillary qubits, where k=⌈logn⌉\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$k=\\left \\lceil {\\log n} \\right \\rceil $\\end{document}. All pairwise overlaps among input quantum states |〈ϕi|ϕj〉|2\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$|\\langle \\phi _{i}|\\phi _{j}\\rangle |^{2}$\\end{document} can be obtained in this circuit. Compared with existing scheme for measuring the overlap of multiple quantum states, the circuit provides higher precision and less consumption of ancillary qubits. In addition, some simulation experiments are performed on IBM quantum cloud platform to verify the superiority of this algorithm.

Bases for optimising stabiliser decompositions of quantum states

Stabiliser states play a central role in the theory of quantum computation. For example, they are used to encode computational basis states in the most common quantum error correction schemes. Arbitrary quantum states admit many stabiliser decompositions: ways of being expressed as a superposition of stabiliser states. Understanding the structure of stabiliser decompositions has significant applications in verifying and simulating near-term quantum computers. We introduce and study the vector space of linear dependencies of n-qubit stabiliser states. These spaces have canonical bases containing vectors whose size grows exponentially in n. We construct elegant bases of linear dependencies of constant size three. Critically, our sparse bases can be computed without first compiling a dictionary of all n-qubit stabiliser states. We utilise them to explicitly compute the stabiliser extent of states of more qubits than is feasible with existing techniques. Finally, we delineate future applications to improving theoretical bounds on the stabiliser rank of magic states.

Optimal convex approximations of qubit states under Pauli distance

Utilizing the l1 norm as the quantum state distance metric, we consider the Pauli distance of arbitrary target quantum states, that is, the optimal convex approximation of any qubit mixed states relative to the available state of pairs of eigenstates in three Pauli matrices. We get the complete analytical expressions for B1 -distance, B2 -distance and B3 -distance. We determine the parameter range for the optimal approximation of each B2 -distance in eight distinct scenarios. Furthermore, some trade-off relations about B2 -distances are also studied.

Trading T gates for dirty qubits in state preparation and unitary synthesis

Efficient synthesis of arbitrary quantum states and unitaries from a universal fault-tolerant gate-set e.g. Clifford+T is a key subroutine in quantum computation. As large quantum algorithms feature many qubits that encode coherent quantum information but remain idle for parts of the computation, these should be used if it minimizes overall gate counts, especially that of the expensive T-gates. We present a quantum algorithm for preparing any dimension-N pure quantum state specified by a list of N classical numbers, that realizes a trade-off between space and T-gates. Our scheme uses O(log⁡(N/ϵ)) clean qubits and a tunable number of ∼(λlog⁡(log⁡Nϵ)) dirty qubits, to reduce the T-gate cost to O(Nλ+λlog⁡Nϵlog⁡log⁡Nϵ). This trade-off is optimal up to logarithmic factors, proven through an unconditional gate counting lower bound, and is, in the best case, a quadratic improvement in T-count over prior ancillary-free approaches. We prove similar statements for unitary synthesis by reduction to state preparation. Underlying our constructions is a T-efficient circuit implementation of a quantum oracle for arbitrary classical data.

Perfect pulsed inline twin-beam squeezers

Perfect inline squeezers are both spectrally pure and have identical input and output temporal modes, allowing one to squeeze an arbitrary input quantum state in the sole input mode on which the device acts, while the quantum states of any other modes are unaffected. We study theoretically how to obtain a perfect pulsed inline squeezer in twin-beam systems by considering three commonly used configurations: unpoled single pass, poled single pass, and poled double pass. By obtaining analytical relations between the input and output temporal modes from the Bloch–Messiah decomposition of the discretized Heisenberg-picture propagator, we find that a double-pass structure produces a perfect pulsed inline squeezer when operated in a frequency degenerate, symmetric group-velocity matched type-II configuration.

Trainable parameterized quantum encoding and application based on enhanced robustness and parallel computing

One key advantage of quantum algorithms is based on the assumption that arbitrary quantum states can be efficiently prepared. However, limited by qubits’ number and decoherence time, existing preparation methods are not friendly to the quantum state preparation of high-dimensional data. In this paper, we propose a Trainable Parameterized Quantum Encoding (TPQE) method for realizing approximate encoding of arbitrary quantum states, and the representation ability is proposed as the verification criterion for TPQE for arbitrary quantum states. To enhance the robustness of the TPQE, we take into account noise as part of the TPQE and absorb the noise into the parameters through training. Moreover, we utilize parallel computing between multiple quantum processors to achieve a speedup of TPQE. Finally, the representation ability of TPQE is validated on a publicly available dataset of breast cancer using amplitude encoding as a benchmark. Experiments demonstrate that our method shows good robustness.

Custom Bell inequalities from formal sums of squares

Bell inequalities play a key role in certifying quantum properties for device-independent quantum information protocols. It is still a major challenge, however, to devise Bell inequalities tailored for an arbitrary given quantum state. Existing approaches based on sums of squares provide results in this direction, but they are restricted by the necessity of first choosing measurement settings suited to the state. Here, we show how the sum of square property can be enforced for an arbitrary target state by making an appropriate choice of nullifiers, which is made possible by leaving freedom in the choice of measurement. Using our method, we construct simple Bell inequalities for several families of quantum states, including partially entangled multipartite GHZ states and qutrit states. In most cases we are able to prove that the constructed Bell inequalities achieve self-testing of the target state. We also use the freedom in the choice of measurement to self-test partially entangled two-qubit states with a family of settings with two parameters. Finally, we show that some statistics can be self-tested with distinct Bell inequalities, hence obtaining new insight on the shape of the set of quantum correlations.

Virtual Photon-Mediated Quantum State Transfer and Remote Entanglement between Spin Qubits in Quantum Dots Using Superadiabatic Pulses.

Spin qubits in semiconductor quantum dots are an attractive candidate for scalable quantum information processing. Reliable quantum state transfer and entanglement between spatially separated spin qubits is a highly desirable but challenging goal. Here, we propose a fast and high-fidelity quantum state transfer scheme for two spin qubits mediated by virtual microwave photons. Our general strategy involves using a superadiabatic pulse to eliminate non-adiabatic transitions, without the need for increased control complexity. We show that arbitrary quantum state transfer can be achieved with a fidelity of 95.1% within a 60 ns short time under realistic parameter conditions. We also demonstrate the robustness of this scheme to experimental imperfections and environmental noises. Furthermore, this scheme can be directly applied to the generation of a remote Bell entangled state with a fidelity as high as 97.6%. These results pave the way for fault-tolerant quantum computation on spin quantum network architecture platforms.

Virtual Quantum Broadcasting.

The quantum no-broadcasting theorem states that it is impossible to produce perfect copies of an arbitrary quantum state, even if the copies are allowed to be correlated. Here we show that, although quantum broadcasting cannot be achieved by any physical process, it can be achieved by a virtual process, described by a Hermitian-preserving trace-preserving map. This virtual process is canonical: it is the only map that broadcasts all quantum states, is covariant under unitary evolution, is invariant under permutations of the copies, and reduces to the classical broadcasting map when subjected to decoherence. We show that the optimal physical approximation to the canonical broadcasting map is the optimal universal quantum cloning, and we also show that virtual broadcasting can be achieved by a virtual measure-and-prepare protocol, where a virtual measurement is performed, and, depending on the outcomes, two copies of a virtual quantum state are generated. Finally, we use canonical virtual broadcasting to prove a uniqueness result for quantum states over time.

Quantum differential privacy under noise channels

Quantum differential privacy is a way to protect privacy in quantum computing. It perturbs the final state of quantum computing by a specific quantum noise channel and makes the output useless to the attackers, so as to achieve privacy protection. In this paper, we study the quantum differential privacy under three channels: bit flip channel, phase flip channel and depolarizing channel. We calculate the privacy parameters for these three channels based on the proportional distance. We show the privacy protection capability by calculating the decay rates of the trace distances of two arbitrary quantum states before and after passing through the channels. Under the same privacy budget, we compare the fidelities, the trace distances between the real outputs and the outputs after entering the channels, and analyze the privacy protection performance of different quantum channels in detail.

Spacetime-Efficient Low-Depth Quantum State Preparation with Applications

We propose a novel deterministic method for preparing arbitrary quantum states. When our protocol is compiled into CNOT and arbitrary single-qubit gates, it prepares an N-dimensional state in depth O(log⁡(N)) and spacetime allocation (a metric that accounts for the fact that oftentimes some ancilla qubits need not be active for the entire circuit) O(N), which are both optimal. When compiled into the {H,S,T,CNOT} gate set, we show that it requires asymptotically fewer quantum resources than previous methods. Specifically, it prepares an arbitrary state up to error ϵ with optimal depth of O(log⁡(N)+log⁡(1/ϵ)) and spacetime allocation O(Nlog⁡(log⁡(N)/ϵ)), improving over O(log⁡(N)log⁡(log⁡(N)/ϵ)) and O(Nlog⁡(N/ϵ)), respectively. We illustrate how the reduced spacetime allocation of our protocol enables rapid preparation of many disjoint states with only constant-factor ancilla overhead – O(N) ancilla qubits are reused efficiently to prepare a product state of wN-dimensional states in depth O(w+log⁡(N)) rather than O(wlog⁡(N)), achieving effectively constant depth per state. We highlight several applications where this ability would be useful, including quantum machine learning, Hamiltonian simulation, and solving linear systems of equations. We provide quantum circuit descriptions of our protocol, detailed pseudocode, and gate-level implementation examples using Braket.

Impact of conditional modelling for a universal autoregressive quantum state

We present a generalized framework to adapt universal quantum state approximators, enabling them to satisfy rigorous normalization and autoregressive properties. We also introduce filters as analogues to convolutional layers in neural networks to incorporate translationally symmetrized correlations in arbitrary quantum states. By applying this framework to the Gaussian process state, we enforce autoregressive and/or filter properties, analyzing the impact of the resulting inductive biases on variational flexibility, symmetries, and conserved quantities. In doing so we bring together different autoregressive states under a unified framework for machine learning-inspired ansätze. Our results provide insights into how the autoregressive construction influences the ability of a variational model to describe correlations in spin and fermionic lattice models, as well as ab initio electronic structure problems where the choice of representation affects accuracy. We conclude that, while enabling efficient and direct sampling, thus avoiding autocorrelation and loss of ergodicity issues in Metropolis sampling, the autoregressive construction materially constrains the expressivity of the model in many systems.

Long-distance transmission of arbitrary quantum states between spatially separated microwave cavities.

Long-distance transmission between spatially separated microwave cavities is a crucial area of quantum information science and technology. In this work, we present a method for achieving long-distance transmission of arbitrary quantum states between two microwave cavities, by using a hybrid system that comprises two microwave cavities, two nitrogen-vacancy center ensembles (NV ensembles), two optical cavities, and an optical fiber. Each NV ensemble serves as a quantum transducer, dispersively coupling with a microwave cavity and an optical cavity, which enables the conversion of quantum states between a microwave cavity and an optical cavity. The optical fiber acts as a connector between the two optical cavities. Numerical simulations demonstrate that our method allows for the transfer of an arbitrary photonic qubit state between two spatially separated microwave cavities with high fidelity. Furthermore, the method exhibits robustness against environmental decay, parameter fluctuations, and additive white Gaussian noise. Our approach offers a promising way for achieving long-distance transmission of quantum states between two spatially separated microwave cavities, which may have practical applications in networked large-scale quantum information processing and quantum communication.

No-masking does not imply no commitment

The no-masking theorem claims that arbitrary quantum states cannot be masked. Based on this result, it was further claimed that qubit commitment is impossible. However, here we show that arbitrary known quantum states can be masked. Meanwhile, the states in qubit commitment is always known. Consequently, the no-masking theorem cannot lead to no qubit commitment.

Quantifying the intrinsic randomness in sequential measurements

In the standard Bell scenario, when making a local projective measurement on each system component, the amount of randomness generated is restricted. However, this limitation can be surpassed through the implementation of sequential measurements. Nonetheless, a rigorous definition of random numbers in the context of sequential measurements is yet to be established, except for the lower quantification in device-independent scenarios. In this paper, we define quantum intrinsic randomness in sequential measurements and quantify the randomness in the Collins–Gisin–Linden–Massar–Popescu inequality sequential scenario. Initially, we investigate the quantum intrinsic randomness of the mixed states under sequential projective measurements and the intrinsic randomness of the sequential positive-operator-valued measure (POVM) under pure states. Naturally, we rigorously define quantum intrinsic randomness under sequential POVM for arbitrary quantum states. Furthermore, we apply our method to one-Alice and two-Bobs sequential measurement scenarios, and quantify the quantum intrinsic randomness of the maximally entangled state and maximally violated state by giving an extremal decomposition. Finally, using the sequential Navascues–Pironio–Acin hierarchy in the device-independent scenario, we derive lower bounds on the quantum intrinsic randomness of the maximally entangled state and maximally violated state.

Perfect state transfer by means of discrete-time quantum walk on the complete bipartite graph

Perfect state transfer has attracted a great deal of attention recently due to its crucial role in quantum communication and scalable quantum computation. In this paper, we propose the perfect state transfer algorithms with a pair of sender-receiver and two pairs of sender-receiver on the complete bipartite graph respectively. The algorithm with a pair of sender-receiver is implemented through discrete-time quantum walk, flexibly setting the coin operators based on the positions of the sender and receiver. The algorithm with two pairs of sender-receiver ensures that the two quantum states are distributed on both sides of the complete bipartite graph during the process, thereby achieving perfect state transfer. In addition, the quantum circuits corresponding to the algorithms are provided. The algorithms can transfer an arbitrary quantum state and can simultaneously transfer two arbitrary quantum states from the senders to the receivers in any case. Moreover, the algorithms are not only applicable to complete bipartite graphs but also to more graph structures with complete bipartite subgraphs, which will provide potential applications for quantum information processing.

Experimental full calibration of quantum devices in a semi-device-independent way

Semi-device-independent (SDI) methods offer a credible way to calibrate preparation and measurement devices simultaneously in quantum information processing, using only prior knowledge such as the Hilbert space dimension. To date, the SDI method is restricted to a few state paradigms, which impedes its broader applications. Recently, Tavakoli [Phys. Rev. Lett. 125, 150503 (2020)PRLTAO0031-900710.1103/PhysRevLett.125.150503] proposed an SDI scheme to certify t-designs with discrete and symmetric structures. In this work, we bridge the gap between discrete and continuous structures with a concept termed “covering angle,” while maintaining the SDI feature. This concept enables us to evaluate a quantum device’s ability to generate arbitrary quantum states in a Hilbert space via calibrating a certain t-design. This so-called full calibration method is further tailored to be tolerant of errors in realistic state production. We demonstrate this full calibration scheme for a qubit system with various t-designs and show that it renders SDI certificates for quantum key distribution, quantum random number generation, and magic state distillability.

Efficient classical algorithms for simulating symmetric quantum systems

In light of recently proposed quantum algorithms that incorporate symmetries in the hope of quantum advantage, we show that with symmetries that are restrictive enough, classical algorithms can efficiently emulate their quantum counterparts given certain classical descriptions of the input. Specifically, we give classical algorithms that calculate ground states and time-evolved expectation values for permutation-invariant Hamiltonians specified in the symmetrized Pauli basis with runtimes polynomial in the system size. We use tensor-network methods to transform symmetry-equivariant operators to the block-diagonal Schur basis that is of polynomial size, and then perform exact matrix multiplication or diagonalization in this basis. These methods are adaptable to a wide range of input and output states including those prescribed in the Schur basis, as matrix product states, or as arbitrary quantum states when given the power to apply low depth circuits and single qubit measurements.

No graph state is preparable in quantum networks with bipartite sources and no classical communication

In research concerning quantum networks, it is often assumed that the parties can classically communicate with each other. However, classical communication might introduce a substantial delay to the network, especially if it is large. As the latency of a network is one of its most important characteristics, it is interesting to consider quantum networks in which parties cannot communicate classically and ask what limitations this assumption imposes on the possibility of preparing multipartite states in such networks. We show that graph states of an arbitrary prime local dimension known for their numerous applications in quantum information cannot be generated in a quantum network in which parties are connected via sources of bipartite quantum states and the classical communication is replaced by some pre-shared classical correlations. We then generalise our result to arbitrary quantum states that are sufficiently close to graph states.