Skip to content

Commit d181767

Browse files
nobeseEmilyashishks0522co9olguyjosh146
authored
Phase Gradient Demo (#1795)
How can we use phase gradient states to carry out more efficient rotations? --------- Co-authored-by: Emily <emily.nobes@resident.xanadu.ai> Co-authored-by: Ashish Kanwar Singh <104938869+ashishks0522@users.noreply.github.com> Co-authored-by: Nathan Killoran <co9olguy@users.noreply.github.com> Co-authored-by: Josh Izaac <josh146@gmail.com>
1 parent d49abda commit d181767

8 files changed

Lines changed: 326 additions & 0 deletions
34.7 KB
Loading
7.21 KB
Loading

demonstrations_v2/efficient_rotations_with_phase_gradient_states/demo.py

Lines changed: 198 additions & 0 deletions
Large diffs are not rendered by default.
Lines changed: 128 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,128 @@
1+
{
2+
"title": "Efficient Rotations With Phase Gradient States",
3+
"authors": [
4+
{
5+
"username": "emgem"
6+
}
7+
],
8+
"executable_stable": true,
9+
"executable_latest": true,
10+
"dateOfPublication": "2026-07-14T00:00:00+00:00",
11+
"dateOfLastModification": "2026-07-14T00:00:00+00:00",
12+
"categories": ["Algorithms", "Quantum Computing"],
13+
"tags": ["Algorithms", "Rotations", "Gate Decomposition", "Fault Tolerance", "Resource Estimation"],
14+
"previewImages": [
15+
{
16+
"type": "thumbnail",
17+
"uri": "/_static/demo_thumbnails/regular_demo_thumbnails/pennylane-demo-phase-gradient-states-thumbnail.png"
18+
},
19+
{
20+
"type": "large_thumbnail",
21+
"uri": "/_static/demo_thumbnails/large_demo_thumbnails/pennylane-demo-phase-gradient-states-large-thumbnail.png"
22+
}
23+
],
24+
"seoDescription": "The ability to perform arbitrary rotations is essential for the realization of usable algorithms on quantum computers. To minimize gate costs, efficient gate synthesis methods should be selected for implementation, such as multiplexed phase gradient states!",
25+
"doi": "",
26+
"references": [
27+
{
28+
"id": "Gidney2018",
29+
"type": "article",
30+
"title": "Halving the cost of quantum addition",
31+
"authors": "Gidney",
32+
"year": "2018",
33+
"journal": "Quantum",
34+
"doi": "10.22331/q-2018-06-18-74",
35+
"url": "https://doi.org/10.22331/q-2018-06-18-74"
36+
},
37+
{
38+
"id": "Ross2016",
39+
"type": "article",
40+
"title": "Optimal ancilla-free Clifford+T approximation of z-rotations",
41+
"authors": "Ross and Selinger",
42+
"year": "2016",
43+
"journal": "Quantum Information and Computation",
44+
"doi": "10.26421/QIC16.11-12-1",
45+
"url": "https://doi.org/10.26421/QIC16.11-12-1"
46+
},
47+
{
48+
"id": "Paetznick2014",
49+
"type": "article",
50+
"title": "Repeat-Until-Success: Non-deterministic decomposition of single-qubit unitaries",
51+
"authors": "Paetznick and Svore",
52+
"year": "2014",
53+
"journal": "Quantum Information and Computation",
54+
"doi": "10.48550/arXiv.1311.1074",
55+
"url": "https://doi.org/10.48550/arXiv.1311.1074"
56+
},
57+
{
58+
"id": "Dawson2006",
59+
"type": "article",
60+
"title": "The Solovay-Kitaev algorithm",
61+
"authors": "Dawson and Nielsen",
62+
"year": "2006",
63+
"journal": "Quantum Information and Computation",
64+
"doi": "10.26421/QIC6.1-6",
65+
"url": "https://doi.org/10.26421/QIC6.1-6"
66+
},
67+
{
68+
"id": "Kliuchnikov2015",
69+
"type": "article",
70+
"title": "A Framework for Approximating Qubit Unitaries",
71+
"authors": "Kliuchnikov, Bocharov, Roetteler, and Yard",
72+
"year": "2015",
73+
"journal": "arXiv",
74+
"doi": "10.48550/arXiv.1510.03888",
75+
"url": "https://arxiv.org/pdf/1510.03888"
76+
},
77+
{
78+
"id": "Kliuchnikov2022",
79+
"type": "article",
80+
"title": "Shorter quantum circuits via single-qubit gate approximation",
81+
"authors": "Kliuchnikov, Lauter, Minko, Paetznick, and Petit",
82+
"year": "2022",
83+
"journal": "Quantum",
84+
"doi": "10.22331/q-2023-12-18-1208",
85+
"url": "https://doi.org/10.22331/q-2023-12-18-1208"
86+
},
87+
{
88+
"id": "OBrien2025",
89+
"type": "article",
90+
"title": "Quantum State Preparation via Piecewise QSVT",
91+
"authors": "O'Brien and Sunderhauf",
92+
"year": "2025",
93+
"journal": "Quantum",
94+
"doi": "10.22331/q-2025-07-03-1786",
95+
"url": "https://doi.org/10.22331/q-2025-07-03-1786"
96+
},
97+
{
98+
"id": "Mottonen2005",
99+
"type": "article",
100+
"title": "Decompositons of General Quantum Gates",
101+
"authors": "Mottonen and Vartiainen",
102+
"year": "2005",
103+
"journal": "arXiv",
104+
"doi": "10.48550/arXiv.quant-ph/0504100",
105+
"url": "https://doi.org/10.48550/arXiv.quant-ph/0504100"
106+
}
107+
108+
],
109+
"basedOnPapers": [],
110+
"referencedByPapers": [],
111+
"relatedContent": [
112+
{
113+
"type":"demonstration",
114+
"id": "tutorial_intro_qrom",
115+
"weight": 1.0
116+
},
117+
{
118+
"type":"demonstration",
119+
"id": "tutorial_clifford_circuit_simulations",
120+
"weight": 1.0
121+
},
122+
{
123+
"type":"demonstration",
124+
"id": "tutorial_achieving_universality_with_the_clifford_hierarchy",
125+
"weight": 1.0
126+
}
127+
]
128+
}
Loading
Loading
Loading
Loading

0 commit comments

Comments
 (0)