Timeline for Shortest sequence of universal quantum gates that correspond to a given unitary

Current License: CC BY-SA 4.0

15 events

when toggle format	what		by	license	comment
Jan 14, 2020 at 17:23	comment	added	Kelthar		Is decomposition also intractable for unitaries that are composed solely by the multiplication of clifford gates? I'm looking to build a random circuit generator, and I'd like to insert an inversion layer after the random gates, in order to end up with a deterministic (in this case, equal to the initial) state. However, instead of just mirroring the circuit, I was wondering it is possible to efficiently compute an inversion layer if the input circuit is solely made up of Cliffords?
Aug 7, 2018 at 21:07	history	edited	auden	CC BY-SA 4.0	added 19 characters in body
May 29, 2018 at 12:24	history	edited	rrtucci	CC BY-SA 4.0	added 23 characters in body
May 15, 2018 at 9:06	history	edited	rrtucci	CC BY-SA 4.0	added 10 characters in body
May 14, 2018 at 22:03	history	edited	rrtucci	CC BY-SA 4.0	added 6 characters in body
May 14, 2018 at 14:55	history	edited	rrtucci	CC BY-SA 4.0	added 58 characters in body
May 13, 2018 at 20:32	history	edited	rrtucci	CC BY-SA 4.0	added 23 characters in body
May 13, 2018 at 18:51	vote	accept	user120404
May 13, 2018 at 18:40	history	edited	rrtucci	CC BY-SA 4.0	added 1 character in body
May 13, 2018 at 16:31	history	edited	rrtucci	CC BY-SA 4.0	added 43 characters in body
May 13, 2018 at 15:37	history	edited	rrtucci	CC BY-SA 4.0	added 221 characters in body
May 13, 2018 at 15:26	history	edited	rrtucci	CC BY-SA 4.0	added 5 characters in body
May 13, 2018 at 15:25	history	edited	rrtucci	CC BY-SA 4.0	added 5 characters in body
May 13, 2018 at 15:18	history	edited	rrtucci	CC BY-SA 4.0	deleted 6 characters in body
May 13, 2018 at 15:12	history	answered	rrtucci	CC BY-SA 4.0