没有合适的资源?快使用搜索试试~ 我知道了~
给定N个q位的两个量子状态,我们有兴趣找到最短的量子电路,该电路仅由一个和两个q位的门组成,它将一个状态转换为另一状态。 由于本文所述原因,我们称其为量子迷宫问题。 我们认为,在较大的N限制下,量子迷宫问题等同于在具有几何平坦但拓扑紧凑的空间切片的N +1维时空上找到某些晶格场论(对偶论)的半经典轨迹的问题 。 空间基本域是N维超斜面体,时间方向描述了从任意初始状态到任意目标状态的过渡,因此,这两个量子计算状态描述了初始和最终的双场理论条件。 我们首先考虑一个复杂的Klein-Gordon场论,并认为它只能用于研究最短的量子电路,而不涉及由多个Pauli Z矩阵的张量积构成的发生器。 由于这种情况不是一般性的,因此我们将其称为Z问题。 在双场理论方面,Z问题对应于我们尝试使用希格斯机制进行修正的相位(金石模式)的无质量激励。 不受无质量激发(或Z问题)困扰的最简单对偶理论是Abelian-Higgs模型,我们认为该模型可用于找到最短的量子电路。 由于场论的每个轨迹都直接映射到量子电路,所以最短的量子电路用半经典轨迹来标识。 我们还将讨论使用对偶理论来解决量子迷宫问题的实际算法的复杂性,
资源推荐
资源详情
资源评论
JHEP06(2016)001
Published for SISSA by Springer
Received: April 1, 2016
Revised: May 18, 2016
Accepted: May 19, 2016
Published: June 1, 2016
Dual field theories of quantum computation
Vitaly Vanchurin
Department of Physics and Astronomy, University of Minnesota,
1023 University Dr., Duluth, MN 55812, U.S.A.
E-mail: vvanchur@d.umn.edu
Abstract: Given two quantum states of N q-bits we are interested to find the shortest
quantum circuit consisting of only one- and two- q-bit gates that would transfer one state
into another. We call it the quantum maze problem for the reasons described in the paper.
We argue that in a large N limit the quantum maze problem is equivalent to the problem
of finding a semiclassical trajectory of some lattice field theory (the dual theory) on an
N + 1 dimensional space-time with geometrically flat, but topologically compact spatial
slices. The spatial fundamental domain is an N dimensional hyper-rhombohedron, and the
temporal direction describes transitions from an arbitrary initial state to an arbitrary target
state and so the initial and final dual field theory conditions are described by these two
quantum computational states. We first consider a complex Klein-Gordon field theory and
argue that it can only be used to study the shortest quantum circuits which do not involve
generators composed of tensor products of multiple Pauli Z matrices. Since such situation
is not generic we call it the Z-problem. On the dual field theory side the Z-problem
corresponds to massless excitations of the phase (Goldstone modes) that we attempt to fix
using Higgs mechanism. The simplest dual theory which does not suffer from the massless
excitation (or from the Z-problem) is the Abelian-Higgs model which we argue can be
used for finding the shortest quantum circuits. Since every trajectory of the field theory
is mapped directly to a quantum circuit, the shortest quantum circuits are identified with
semiclassical trajectories. We also discuss the complexity of an actual algorithm that uses
a dual theory prospective for solving the quantum maze problem and compare it with
a geometric approach. We argue that it might be possible to solve the problem in sub-
exponential time in 2
N
, but for that we must consider the Klein-Gordon theory on curved
spatial geometry and/or more complicated (than N-torus) topology.
Keywords: Field Theories in Higher Dimensions, Lattice Quantum Field Theory
ArXiv ePrint: 1603.07982
Open Access,
c
The Authors.
Article funded by SCOAP
3
.
doi:10.1007/JHEP06(2016)001
JHEP06(2016)001
Contents
1 Introduction 1
2 Path integrals for dual theories 2
3 Klein-Gordon dual theory 4
3.1 Dual lattice field theory 5
3.2 Classical field theory solutions 8
4 Quantum circuits from classical solutions 9
5 Abelian-Higgs dual theory 12
5.1 The Z-problem or massless excitations 12
5.2 Non-relativistic limit of field theories 14
6 Solving the quantum maze 15
7 Summary 17
1 Introduction
Consider a quantum system of N q-bits whose states can be described by unit vectors in
2
N
-complex dimensional Hilbert space. The unit size of the sphere indicates that all of
the points are within distance of O(1) from each other if you were allowed to move along
geodesics on the unit sphere. Now imagine that you are only allowed to move in O(N
2
)
orthogonal directions out of O(2
N
). More precisely, at any point you are allowed to only
apply O(N) of one- q-bit gates or O(N
2
) of two- q-bit gates. Then the relevant question
is: what is the shortest distance connecting an arbitrary pair of points on the unit sphere?
This is like playing a very high-dimensional maze with a lot of walls and very few pathways.
There are two motivations to study the “quantum maze”: one computational and one
physical. First of all if we knew how to solve the “quantum maze” problem we would be
able to design the most efficient quantum algorithms or in other words to construct the
shortest quantum circuits that can transform some simple initial state to the desired target
state. A problem which is known to be double exponentially hard O
2
2
N
(see ref. [1] for
a pedagogical discussion of computational complexities in context of quantum information
theory). The second reason has its roots in black-hole physics. It was conjectured that
black-holes are the fastest quantum computers in nature [2] and so in some sense the black-
holes know how to solve the “quantum maze”. Some other recent applications of the theory
of computational complexities in context of black-hole physics were discussed in ref. [3] and
in refs. [4, 5] in an attempt to tackle the firewall problem [6].
– 1 –
JHEP06(2016)001
In addition, a large body of work is directed towards establishing connections between
special kinds of quantum circuits (known as tensor networks) in context of the AdS/CFT
correspondence [7–10]. Indeed the tensor networks provide an interesting new prospective
on how the spacetime (on the AdS side) might emerge from a holographic state (on the
CFT side) by identifying the spacetime with a tensor network which would produce such
holographic state. In refs. [2, 11] the authors went even further and first conjectured and
then verified that the complexity of the holographic CFT states are dual to the actions
over certain patches in the AdS spacetime.
In this paper we are going to expand and build upon the action-complexity conjec-
ture [2], but we shall not be concerned with transitions from only simple states to only
holographic states. Instead we will study transitions from an arbitrary initial |ψ
in
i to an
arbitrary final |ψ
out
i state, i.e. the quantum maze problem. Nevertheless we will still con-
jecture that there must exist a (yet to be discovered) dual field theory whose Euclidean
action describes the computational complexity of the smallest quantum circuit connecting
the two states, i.e.
C(|ψ
out
i, |ψ
in
i) = S
E
[Φ] (1.1)
where Φ is a collective notation for all fields. Note that both sides of eq. (1.1) are not
uniquely specified: the left hand side depends on size of Hilbert space and on the collection
of fundamental gates and the right hand side depends on the Lagrangian and on the region
of integration, but it is quite possible that for certain collections of fundamental gates there
exist a Lagrangian with desired properties.
The paper is organized as follows. In section 2 we define path integrals for the dual
theories of quantum computation and discuss the symmetries that the dual theory should
possess. In section 3 we argue that the dual theory can be conveniently described as a Klein-
Gordon lattice field theory on an N + 1 dimensional space-time with geometrically flat,
but topologically compact spatial slices. In section 4 we show how one can map classical
solutions on the dual theory side to quantum circuits on the quantum computation side.
In section 5 we identify the Z-problem of the Klein-Gordon theory which corresponds
to the massless excitations problem (Goldstone mode) and attempt to fix it using Higgs
mechanism. In section 6 we discuss how the dual theory description can be used for solving
the “quantum maze” problem in sub-exponential time, but for that we must consider curved
spatial geometry and/or more complicated spatial topologies. In section 7 we summaries
the main results of the paper.
2 Path integrals for dual theories
Our initial task is to describe a possible construction of the dual field theories for a system
of N q-bits with fundamental gates consisting of all one- q-bit and two q-bit operations.
Since the total number of degrees of freedom of such system is finite (dimensionality of
Hilbert space is only 2
N
), we are directed towards dual theories on the lattice with finite
fundamental domain, i.e.
C(|ψ
out
i, |ψ
in
i) =
Z
T
0
dt
E
L
E
(Φ
i
,
˙
Φ
i
) , (2.1)
– 2 –
剩余19页未读,继续阅读
资源评论
weixin_38570854
- 粉丝: 5
- 资源: 931
上传资源 快速赚钱
- 我的内容管理 展开
- 我的资源 快来上传第一个资源
- 我的收益 登录查看自己的收益
- 我的积分 登录查看自己的积分
- 我的C币 登录后查看C币余额
- 我的收藏
- 我的下载
- 下载帮助
最新资源
- 5G模组升级刷模块救砖以及5G模组资料路由器固件
- C183579-123578-c1235789.jpg
- Qt5.14 绘画板 Qt Creator C++项目
- python实现Excel表格合并
- Java实现读取Excel批量发送邮件.zip
- 【java毕业设计】商城后台管理系统源码(springboot+vue+mysql+说明文档).zip
- 【java毕业设计】开发停车位管理系统(调用百度地图API)源码(springboot+vue+mysql+说明文档).zip
- 星耀软件库(升级版).apk.1
- 基于Django后端和Vue前端的多语言购物车项目设计源码
- 基于Python与Vue的浮光在线教育平台源码设计
资源上传下载、课程学习等过程中有任何疑问或建议,欢迎提出宝贵意见哦~我们会及时处理!
点击此处反馈
安全验证
文档复制为VIP权益,开通VIP直接复制
信息提交成功