About: Quantum-state preparation with universal gate decompositions

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Quantum-state preparation with universal gate decompositions Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description	In quantum computation every unitary operation can be decomposed into quantum circuits, a series of single qubit rotations and a single type entangling two-qubit gates, such as controlled-not(cnot) gates. Two measures are important when judging the complexity of the circuit: the total number of cnot gates needed to implement it and the depth of the circuit, measured by the minimal number of computation steps needed to perform it. Here we give an explicit and simple quantum circuit scheme for preparation of arbitrary quantum states, which can directly utilize any decomposition scheme for arbitrary full quantum gates, thus connecting the two problems. Our circuit reduces the depth of the best currently known circuit by a factor of 2. It also reduces the total number of cnot gates from 2n to 23/242n in the leading order for even number of qubits. Specifically, the scheme allows us to decrease the upper bound from 11 cnot gates to 9 and the depth from 11 to 5 steps for four qubits. In quantum computation every unitary operation can be decomposed into quantum circuits, a series of single qubit rotations and a single type entangling two-qubit gates, such as controlled-not(cnot) gates. Two measures are important when judging the complexity of the circuit: the total number of cnot gates needed to implement it and the depth of the circuit, measured by the minimal number of computation steps needed to perform it. Here we give an explicit and simple quantum circuit scheme for preparation of arbitrary quantum states, which can directly utilize any decomposition scheme for arbitrary full quantum gates, thus connecting the two problems. Our circuit reduces the depth of the best currently known circuit by a factor of 2. It also reduces the total number of cnot gates from 2n to 23/242n in the leading order for even number of qubits. Specifically, the scheme allows us to decrease the upper bound from 11 cnot gates to 9 and the depth from 11 to 5 steps for four qubits. (en)
Title	Quantum-state preparation with universal gate decompositions Quantum-state preparation with universal gate decompositions (en)
skos:prefLabel	Quantum-state preparation with universal gate decompositions Quantum-state preparation with universal gate decompositions (en)
skos:notation	RIV/00216224:14330/11:00053115!RIV12-MSM-14330___
http://linked.open...avai/riv/aktivita	I P S
http://linked.open...avai/riv/aktivity	I, P(LA09016), S
http://linked.open...iv/cisloPeriodika	3
http://linked.open...vai/riv/dodaniDat	2012
http://linked.open...aciTvurceVysledku	Plesch, Martin
http://linked.open.../riv/druhVysledku	J - Článek v odborném periodiku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Masarykova univerzita / Fakulta informatiky
http://linked.open...dnocenehoVysledku	225460
http://linked.open...ai/riv/idVysledku	RIV/00216224:14330/11:00053115
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Preparation of quantum states; universal gate library (en)
http://linked.open.../riv/klicoveSlovo	Preparation of quantum states universal gate library
http://linked.open...odStatuVydavatele	CZ - Česká republika
http://linked.open...ontrolniKodProRIV	[1237E1849688]
http://linked.open...i/riv/nazevZdroje	Physical Review A
http://linked.open...in/vavai/riv/obor	BD
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...vavai/riv/projekt	Czech Republic membership in the European Research Consortium for Informatics and Mathematics (ERCIM)
http://linked.open...UplatneniVysledku	2011
http://linked.open...v/svazekPeriodika	83
http://linked.open...iv/tvurceVysledku	Brukner, Časlav Plesch, Martin
http://linked.open...ain/vavai/riv/wos	000287960200002
issn	1050-2947
number of pages	5 (xsd:int)
http://bibframe.org/vocab/doi	10.1103/PhysRevA.83.032302
http://localhost/t...ganizacniJednotka	14330

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 112 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software