We present two new quantum algorithms that either find a triangle (a copy of $K_{3}$) in an undirected graph $G$ on $n$ nodes, or reject if $G$ is triangle free. The first algorithm uses combinatorial ideas with Grover Search and makes $\tilde{O}(n^{10/7})$ queries. The second algorithm uses $\tilde{O}(n^{13/10})$ queries, and it is based on a design concept of Ambainis~\cite{amb04} that incorporates the benefits of quantum walks into Grover search~\cite{gro96}. The first algorithm uses only $O(\log n)$ qubits in its quantum subroutines, whereas the second one uses O(n) qubits. The Triangle Problem was first treated in~\cite{bdhhmsw01}, where an algorithm with $O(n+\sqrt{nm})$ query complexity was presented, where $m$ is the number of edges of $G$.
In this paper we consider a quantum version of Pascal's triangle. Pascal's triangle is a well-known triangular array of numbers and when these numbers are plotted modulo 2, a fractal known as the Sierpinski triangle appears. We first prove the appearance of more general fractals when Pascal's triangle is considered modulo prime powers. The numbers in Pascal's triangle can be obtained by scaling the probabilities of the simple symmetric random walk on the line. In this paper we consider a quantum version of Pascal's triangle by replacing the random walk by the quantum walk known as the Hadamard…
Quantum coherence and entanglement are two key features in quantum mechanics and play important roles in quantum information processing and quantum computation. We provide a general triangle-like inequality satisfied by the $l_1$-norm measure of coherence for convex combination of arbitrary $n$ pure states of a quantum state $ρ$. Furthermore, we present triangle-like inequality for the convex-roof extended negativity for any states of rank 2, which gives a positive answer to a conjecture raised in [Phys. Rev. A 96, 062308 (2017)]. Detailed examples are given to illustrate the relations charact…
In order to study N-locality without inputs in long lines and in configurations with loops, e.g. the triangle, we introduce a natural joint measurement on two qubits different from the usual Bell state measurement. The resulting quantum probability $p(a_1,a_2,...,a_N)$ has interesting features. In particular the probability that all results are equal is that large, while respecting full symmetry, that it seems highly implausible that one could reproduce it with any N-local model, though - unfortunately - I have not been unable to prove it.
Quantum networks allow in principle for completely novel forms of quantum correlations. In particular, quantum nonlocality can be demonstrated here without the need of having various input settings, but only by considering the joint statistics of fixed local measurement outputs. However, previous examples of this intriguing phenomenon all appear to stem directly from the usual form of quantum nonlocality, namely via the violation of a standard Bell inequality. Here we present novel examples of 'quantum nonlocality without inputs', which we believe represent a new form of quantum nonlocality, g…
It has long been recognized that certain quantum correlations are incompatible with particular assumption about classical causal structure. Given a causal structure of unknown classicality, the presence of such correlations certifies the nonclassical nature of the causal structure in a device-independent fashion. In structures where all parties share a common resource, these nonclassical correlations are also known as nonlocal correlations. Any constraint satisfied by all correlations which are classically compatible with a given causal structure defines a causal compatibility criterion. Such …
Beyond future applications, quantum networks open interesting fundamental perspectives, notably novel forms of quantum correlations. In this work we discuss quantum correlations in networks from the perspective of the underlying quantum states and their entanglement. We address the questions of which states can be prepared in the so-called triangle network, consisting of three nodes connected pairwise by three sources. We derive necessary criteria for a state to be preparable in such a network, considering both the cases where the sources are statistically independent and classically correlate…
The interplay of interactions, symmetries and gauge fields usually leads to intriguing quantum many-body phases. To explore the nature of emerging phases, we study a quantum Rabi triangle system as an elementary building block for synthesizing an artificial magnetic field. We develop an analytical approach to study the rich phase diagram and the associated quantum criticality. Of particular interest is the emergence of a chiral-coherent phase, which breaks both the $\mathbb{Z}_2$ and the chiral symmetry. In this chiral phase, photons flow unidirectionally and the chirality can be tuned by the …
Quantum networks are the center of many of the recent advances in quantum science, not only leading to the discovery of new properties in the foundations of quantum theory but also allowing for novel communication and cryptography protocols. It is known that networks beyond that in the paradigmatic Bell's theorem imply new and sometimes stronger forms of nonclassicality. Due to a number of practical difficulties, however, the experimental implementation of such networks remains far less explored. Going beyond what has been previously tested, here we verify the nonlocality of an experimental tr…
Classically, for many computational problems one can conclude time lower bounds conditioned on the hardness of one or more of key problems: k-SAT, 3SUM and APSP. More recently, similar results have been derived in the quantum setting conditioned on the hardness of k-SAT and 3SUM. This is done using fine-grained reductions, where the approach is to (1) select a key problem $X$ that, for some function $T$, is conjectured to not be solvable by any $O(T(n)^{1-ε})$ time algorithm for any constant $ε> 0$ (in a fixed model of computation), and (2) reduce $X$ in a fine-grained way to these computation…
Improved Quantum Query Algorithms for Triangle Finding and Associativity Testing
我们证明了检测$n$ -顶点图是否包含三角形的量子查询复杂度为$O(n^{9/7})$。这改进了以前Belovs进行$O(n^{35/27})$查询的最佳算法。对于判断一个操作$\circ : S \times S \rightarrow S$是否是结合的问题，我们给出了一个生成$O(|S|^{10/7})$查询的算法，这是对Grover搜索的平凡应用$O(|S|^{3/2})$的第一次改进.我们的算法设计使用Belovs的学习图框架。我们给出了一个家庭的算法检测常数大小的子图，这可能是有向和着色。这些算法是用一种简单的高级语言设计的;我们的主要定理展示了这种高级语言如何被编译为学习图，并给出了由此产生的复杂性。我们的改进的关键思想是允许更多的自由度，在数据库的参数保持的算法。在我们以前的工作中，在数据库中维护的边缘插槽指定的图，其边缘是定期二分图的工会，其整体结构模仿的图形的证书。通过允许这些二部图是不平衡的和可变的程度，我们得到更好的算法。
This paper considers the triangle finding problem in the CONGEST model of distributed computing. Recent works by Izumi and Le Gall (PODC'17), Chang, Pettie and Zhang (SODA'19) and Chang and Saranurak (PODC'19) have successively reduced the classical round complexity of triangle finding (as well as triangle listing) from the trivial upper bound $O(n)$ to $\tilde O(n^{1/3})$, where~$n$ denotes the number of vertices in the graph. In this paper we present a quantum distributed algorithm that solves the triangle finding problem in $\tilde O(n^{1/4})$ rounds in the CONGEST model. This gives another…
Correlations in quantum networks with independent sources exhibit a completely novel form of nonclassicality in the sense that the nonlocality of such correlations can be demonstrated in fixed local input scenarios. Before the pioneering work by M.O.Renou, et al., in [1], the nonlocal feature of such network correlations was directly attributable to standard Bell nonlocality. In [1], the authors provided some of the first examples of triangle network correlations, whose nonlocality cannot be deduced from Bell-CHSH nonlocality. To date, a complete characterization of such scenarios is yet to be…
We express the matrix elements of the density matrix of the qutrit state in terms of probabilities associated with artificial qubit states. We show that the quantum statistics of qubit states and observables is formally equivalent to the statistics of classical systems with three random vector variables and three classical probability distributions obeying special constrains found in this study. The Bloch spheres geometry of qubit states is mapped onto triangle geometry of qubits. We investigate the triada of Malevich's squares describing the qubit states in quantum suprematism picture and the…
Quantum Algorithm for Triangle Finding in Sparse Graphs
本文提出了一种在稀疏图上寻找三角形的量子算法，该算法改进了Buhrman等人[SIAM Journal on Computing，2005]针对该任务的先前最佳量子算法。我们的算法基于Le Gall [FOCS 2014]给出的最近的$\tilde O(n^{5/4})$ -查询算法，用于在密集图上寻找三角形（这里$n$表示图中的顶点数）。我们特别表明，三角形发现可以解决与$O(n^{5/4-ε})$查询的一些恒定的$ε>0$每当图有最多$O(n^{2-c})$边缘的一些恒定的$c>0$。
We study the holographic quantum error correcting code properties of a Sierpinski Triangle-shaped boundary subregion in $AdS_4/CFT_3$. Due to existing no-go theorems in topological quantum error correction regarding fractal noise, this gives holographic codes a specific advantage over topological codes. We then further argue that a boundary subregion in the shape of the Sierpinski gasket in $AdS_5/CFT_4$ does not possess these holographic quantum error correction properties.
We consider a ZX-calculus augmented with triangle nodes which is well-suited to reason on the so-called Toffoli-Hadamard fragment of quantum mechanics. We precisely show the form of the matrices it represents, and we provide an axiomatisation which makes the language complete for the Toffoli-Hadamard quantum mechanics. We extend the language with arbitrary angles and show that any true equation involving linear diagrams which constant angles are multiple of Pi are derivable. We show that a single axiom is then necessary and sufficient to make the language equivalent to the ZX-calculus which is…
We study the statistical and dynamical properties of the quantum triangle map, whose classical counterpart can exhibit ergodic and mixing dynamics, but is never chaotic. Numerical results show that ergodicity is a sufficient condition for spectrum and eigenfunctions to follow the prediction of Random Matrix Theory, even though the underlying classical dynamics is not chaotic. On the other hand, dynamical quantities such as the out-of-time-ordered correlator (OTOC) and the number of harmonics, exhibit a growth rate vanishing in the semiclassical limit, in agreement with the fact that classical …
The infinite Projected Entangled-Pair State (iPEPS) algorithm is one of the most efficient techniques for studying the ground-state properties of two-dimensional quantum lattice Hamiltonians in the thermodynamic limit. Here, we show how the algorithm can be adapted to explore nearest-neighbor local Hamiltonians on the ruby and triangle-honeycomb lattices, using the Corner Transfer Matrix (CTM) renormalization group for 2D tensor network contraction. Additionally, we show how the CTM method can be used to calculate the ground state fidelity per lattice site and the boundary density operator and…
