Harry Buhrman, Robert Spalek
We present a quantum algorithm that verifies a product of two n*n matrices over any field with bounded error in worst-case time n^{5/3} and expected time n^{5/3} / min(w,sqrt(n))^{1/3}, where w is the number of wrong entries. This improves the previous best algorithm that runs in time n^{7/4}. We also present a quantum matrix multiplication algorithm that is efficient when the result has few nonzero entries.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We present a space-efficient implementation of the quantum verification of matrix products (QVMP) algorithm and demonstrate its functionality by running it on the Aer simulator with two simulation methods: statevector and matrix product state (MPS). We report circuit metrics (gate count, qubit count, circuit depth), transpilation time, simulation time, and a proof of Grover oracle correctness. Our study concludes that while QVMP can be simulated on moderately sized inputs, it cannot scale to a degree where we can observe any quantum advantage on current quantum hardware due to circuit depth an…
Recently much attention has been paid to quantum circuit design to prepare for the future "quantum computation era." Like the conventional logic synthesis, it should be important to verify and analyze the functionalities of generated quantum circuits. For that purpose, we propose an efficient verification method for quantum circuits under a practical restriction. Thanks to the restriction, we can introduce an efficient verification scheme based on decision diagrams called Decision Diagrams for Matrix Functions (DDMFs). Then, we show analytically the advantages of our approach based on DDMFs ov…
We consider entanglement detection for quantum key distribution systems that use two signal states and continuous variable measurements. This problem can be formulated as a separability problem in a qubit-mode system. To verify entanglement, we introduce an object that combines the covariance matrix of the mode with the density matrix of the qubit. We derive necessary separability criteria for this scenario. These criteria can be readily evaluated using semidefinite programming and we apply them to the specific quantum key distribution protocol.
Practical Log-Depth Quantum State Preparation and Circuit Verification via Tree Tensor Network Compilation
本文提出通过树张量网络重整化方法将矩阵积态分解为对数深度量子电路，实现量子态制备和电路验证，并用于设备校准。
Automated Construction and Verification of Unextendible Product Bases
该研究提出基于超立方体分解与SAT的框架，构造并验证了多体系统中多种大小的不可扩展乘积基，其小维实例可用于递归构造更大系统的相关基。
Variational quantum eigensolvers offer a small-scale testbed to demonstrate the performance of error mitigation techniques with low experimental overhead. We present successful error mitigation by applying the recently proposed symmetry verification technique to the experimental estimation of the ground-state energy and ground state of the hydrogen molecule. A finely adjustable exchange interaction between two qubits in a circuit QED processor efficiently prepares variational ansatz states in the single-excitation subspace respecting the parity symmetry of the qubit-mapped Hamiltonian. Symmetr…
We study the time evolution of fidelity in a dynamical many body system, namely a kicked Ising model, modified to allow for a time reversal invariance breaking. We find good agreement with the random matrix predictions in the realm of strong perturbations. In particular for the time-reversal symmetry breaking case the predicted revival at Heisenberg time is clearly seen.
We present a method to test quantum behavior of quantum information processing devices, such as quantum memories, teleportation devices, channels and quantum key distribution protocols. The test of quantum behavior can be phrased as the verification of effective entanglement. Necessary separability criteria are formulated in terms of a matrix of expectation values in conjunction with the partial transposition map. Our method is designed to reduce the resources for entanglement verification. A particular protocol based on coherent states and homodyne detection is used to illustrate the method. …
This short note proposes a symbolic approach for representing and reasoning about quantum circuits using complex, vector or matrix-valued Boolean expressions. A major benefit of this approach is that it allows us to directly borrow the existing techniques and tools for verification of classical logic circuits in reasoning about quantum circuits.
Efficient distributed inner product estimation via Pauli sampling
本文提出基于泡利采样的跨平台验证协议，证明其对低魔幻度和低纠缠纯态高效，并给出高复杂度态的超多项式下界。
We investigate the performance of error mitigation via measurement of conserved symmetries on near-term devices. We present two protocols to measure conserved symmetries during the bulk of an experiment, and develop a zero-cost post-processing protocol which is equivalent to a variant of the quantum subspace expansion. We develop methods for inserting global and local symetries into quantum algorithms, and for adjusting natural symmetries of the problem to boost their mitigation against different error channels. We demonstrate these techniques on two- and four-qubit simulations of the hydrogen…
Improved Quantum Query Bounds for Boolean Matrix Product Verification
本文首次给出布尔矩阵乘积验证的量子查询上界Õ(n^{17/12})，并证明Ω(n^{5/4})下界，通过等价性分析实现半径与直径判定问题的多项式分离。
We propose an efficient scheme for verifying quantum computations in the `high complexity' regime i.e. beyond the remit of classical computers. Previously proposed schemes remarkably provide confidence against arbitrarily malicious adversarial behaviour in the misfunctioning of the quantum computing device. Our scheme is not secure against arbitrarily adversarial behaviour, but may nevertheless be sufficiently acceptable in many practical situations. With this concession we gain in manifest simplicity and transparency, and in contrast to previous schemes, our verifier is entirely classical. It…
In the direct communication quantum channels the authorized recipient (Bob) and the non-authorized recipient (Eve) have different abilities for verification of received information. Bob can apply the feedback to commit the sender (Alice) to perform verification. Eve has to use for verification an indirect method based on the measurement of a set of incompatible observables enough for determination of the coding basis used by Alice. In the protocol of direct communication regular modification of coding basis and masking it with an equilibrium in average information carrier density matrix preven…
A diagram is introduced for visualizing matrix product states which makes transparent a connection between matrix product factorizations of states and operators, and complex weighted finite state automata. It is then shown how one can proceed in the opposite direction: writing an automaton that ``generates'' an operator gives one an immediate matrix product factorization of it. Matrix product factorizations have the advantage of reducing the cost of computing expectation values by facilitating caching of intermediate calculations. Thus our connection to complex weighted finite state automata y…
We present a necessary and sufficient product criterion for bipartite quantum states based on the rank of realignment matrix of density matrix. Then, this approach is generalized to multipartite systems. We first introduce the concept of semiproduct in a similar manner to the semiseparable and prove that semiproduct is equivalent to fully product. Therefore, a quantum state is bipartite product with respect to all possible partitions implies fully product which is different from the case of separability. For pure states, it can easily be seen that several necessary and sufficient separability …
We show how to construct relevant families of matrix product operators in one and higher dimensions. Those form the building blocks for the numerical simulation methods based on matrix product states and projected entangled pair states. In particular, we construct translational invariant matrix product operators suitable for time evolution, and show how such descriptions are possible for Hamiltonians with long-range interactions. We illustrate how those tools can be exploited for constructing new algorithms for simulating quantum spin systems.
Quantitative measure of disorder or randomness based on the entropy production characterizes thermodynamical irreversibility, which is relevant to the conventional second law of thermodynamics. Here we report, in a quantum mechanical fashion, the first theoretical prediction and experimental exploration of an information-theoretical bound on the entropy production. Our theoretical model consists of a simplest two-level dissipative system driven by a purely classical field, and under the Markovian dissipation, we find that such an information-theoretical bound, not fully validating quantum rela…
This paper presents Giallar, a fully-automated verification toolkit for quantum compilers. Giallar requires no manual specifications, invariants, or proofs, and can automatically verify that a compiler pass preserves the semantics of quantum circuits. To deal with unbounded loops in quantum compilers, Giallar abstracts three loop templates, whose loop invariants can be automatically inferred. To efficiently check the equivalence of arbitrary input and output circuits that have complicated matrix semantics representation, Giallar introduces a symbolic representation for quantum circuits and a s…
A C++ library, named ZKCM, has been developed for the purpose of multiprecision matrix calculations, which is based on the GNU MP and MPFR libraries. It is especially convenient for writing programs involving tensor-product operations, tracing-out operations, and singular-value decompositions. Its extension library, ZKCM_QC, for simulating quantum computing has been developed using the time-dependent matrix-product-state simulation method. This report gives a brief introduction to the libraries with sample programs.
A complete classification is given for one dimensional chains with nearest neighbor interactions having two states in each site, for which a matrix product ground state exists. The Hamiltonians and their corresponding matrix product ground states are explicitly obtained.
Current descriptions of the ab initio DMRG algorithm use two superficially different languages: an older language of the renormalization group and renormalized operators, and a more recent language of matrix product states and matrix product operators. The same algorithm can appear dramatically different when written in the two different vocabularies. In this work, we carefully describe the translation between the two languages in several contexts. First, we describe how to efficiently implement the ab-initio DMRG sweep using a matrix product operator based code, and the equivalence to the ori…
We describe a protocol for cross-platform verification of quantum simulators and quantum computers. We show how to measure directly the overlap $\textrm{Tr}\left[ρ_1 ρ_2\right]$ and the purities $\textrm{Tr}\left[ρ^2_{1,2}\right]$, and thus a fidelity of two possibly mixed quantum states $ρ_1$ and $ρ_2$ prepared in separate experimental platforms. We require only local measurements in randomized product bases, which are communicated classically. As a proof-of-principle, we present the measurement of experiment-theory fidelities for entangled $10$-qubit quantum states in a trapped ion quantum s…
In this talk, we will describe a framework for assertion-based verification (ABV) of quantum circuits by applying model checking techniques for quantum systems developed in our previous work, in which: (i) Noiseless and noisy quantum circuits are modelled as operator- and super-operator-valued transition systems, respectively, both of which can be further represented by tensor networks. (ii) Quantum assertions are specified by a temporal extension of Birkhoff-von Neumann quantum logic. Their semantics is defined based on the design decision: they will be used in verification of quantum circuit…
Using random matrix techniques and the theory of Matrix Product States we show that reduced density matrices of quantum spin chains have generically maximum entropy.
Matrix-product codes over finite fields are an important class of long linear codes by combining several commensurate shorter linear codes with a defining matrix over finite fields. The construction of matrix-product codes with certain self-orthogonality over finite fields is an effective way to obtain good $q$-ary quantum codes of large length. This article has two purposes: the first is to summarize some results of this topic obtained by the author of this article and his cooperators in [10-12]; the second is to add some new results on quasi-orthogonal matrices (resp. quasi-unitary matrices)…
We define matrix product states in the continuum limit, without any reference to an underlying lattice parameter. This allows to extend the density matrix renormalization group and variational matrix product state formalism to quantum field theories and continuum models in 1 spatial dimension. We illustrate our procedure with the Lieb-Liniger model.
Transfer matrices and matrix product operators play an ubiquitous role in the field of many body physics. This paper gives an ideosyncratic overview of applications, exact results and computational aspects of diagonalizing transfer matrices and matrix product operators. The results in this paper are a mixture of classic results, presented from the point of view of tensor networks, and of new results. Topics discussed are exact solutions of transfer matrices in equilibrium and non-equilibrium statistical physics, tensor network states, matrix product operator algebras, and numerical matrix prod…
Continuous matrix product operators for quantum fields
本文提出连续矩阵乘积算符的ansatz，展示其闭式表达、连续极限及保持纠缠面积律，用于构建超越量子细胞自动机的连续矩阵乘积单元aris。
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。